| |
Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Deduction And Theorem Proving (I.2.3) > Deduction (I.2.3...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 15
Reviews about "Deduction (I.2.3...)":
|
Date Reviewed |
| |
Developing industrial case-based reasoning applications: the INRECA methodology
Bergmann R., Althoff K., Breen S., Goker M., Manago M., Springer-Verlag, London, UK, 2004. 236 pp. Type: Book (9783540207375)
INRECA (induction and reasoning from cases) was developed by a European consortium of several firms and a German university, and its methodology is described in the first edition of this book [1]. The goal of the methodol...
|
Jul 14 2004 |
| |
Conditional independence in propositional logic
Lang J., Liberatore P., Marquis P. Artificial Intelligence 141(1): 79-121, 2002. Type: Article
This mathematical paper falls into the general framework of knowledge-based engineering. It focuses on the analysis of the problems underlying the use of relevance to improve inferences. In particular, the authors investigate the comp...
|
Mar 26 2003 |
| |
The development of CASC
Pelletier F., Sutcliffe G., Suttner C. AI Communications 15(2): 79-90, 2002. Type: Article
A competition on automated theorem proving (ATP), held during conferences on automated deduction (CADE), is described in this paper....
|
Mar 18 2003 |
| |
Experiments in linear natural deduction
Martini S., Masini A. Theoretical Computer Science 176(1-2): 159-173, 1997. Type: Article
Linear logic is a hot research topic in the theoretical foundations of programming language. This paper presents some interesting results and methodological insights about several fragments of multiplicative linear logic within a natur...
|
Dec 1 1997 |
| |
Normalized rewriting
Marché C. Journal of Symbolic Computation 21(3): 253-288, 1996. Type: Article
Term rewriting and the completion of term rewriting systems are important tools for deciding equational problems in such fields as automated deduction, algebraic specification, and discrete mathematics. Probably the most infuriating li...
|
Oct 1 1997 |
| |
Robust reasoning
Sun R. Artificial Intelligence 75(2): 241-295, 1995. Type: Article
Sun presents analysis, theoretical foundations, implementation architecture, and evaluation for a framework for reasoning with rules and similarities. The framework allows its users to deal with reasoning situations involving partial i...
|
Sep 1 1996 |
| |
The psychology of proof
Rips L., MIT Press, Cambridge, MA, 1994. Type: Book (9780262181532)
The author argues that deduction is a central aspect of cognition, by giving evidence that principles such as modus ponens underlie several deductive abilities. This idea, called the deduction-system hypothesis, is developed and tested...
|
Oct 1 1995 |
| |
Instantiation theory
Williams J., Springer-Verlag New York, Inc., New York, NY, 1991. Type: Book (9780387543338)
Instantiation theory is introduced and discussed. The theory aims at giving an abstract framework for instantiation that is applicable to various logic formalisms. The book focuses on the algebraic properties of instantiation, and it i...
|
Feb 1 1994 |
| |
Reduction rules for resolution-based systems
Eisinger N., Ohlbach H., Präcklein A. Artificial Intelligence 50(2): 141-181, 1991. Type: Article
The reasoning process developed by resolution-based systems inherently involves disjunctions in deriving definite consequences and always requires derived clauses to be reused as side clauses. Hence the number of derived clauses is usu...
|
Oct 1 1992 |
| |
Automated deduction in nonclassical logics
Wallen L., MIT Press, Cambridge, MA, 1990. Type: Book (9789780262231442)
The main current application of automated deduction is to a knowledge base and a query “Q?”. The system gives the answer “yes” if and only if Q can be deduced from the knowledge base. The inferen...
|
Feb 1 1991 |
| |
|
|
| |
|
|
