Symbolic boolean manipulation with ordered binary-decision diagrams. Prolog Programming for Artificial Intelligence. Proving theorems with the modification method. Set theory in first-order logic: Clauses for Gödel's axioms. Computers and Mathematics with Applications, 29(2):27-62, 1995. The Boyer-Moore theorem prover and its interactive enhancement. The Association for Computational Linguistics, 2005. Recognising textual entailment with logical inference. On the reconstruction of proofs in distributed theorem proving: a modified clause-diffusion method. Elsevier, Amsterdam, The Netherlands, January 2001 (Chapter 12). In Proceedings of the 15th International Conference on Automated Deduction, pages 365-380, 1998. CADE-16: Proceedings of the 16th International Conference on Automated Deduction Trento, Italy, 1999, Lecture Notes in Artificial Intelligence, vol. A breadth-first strategy for mating search. Proceedings of TABLEAUX-96, Lecture Notes in Artificial Intelligence, vol. Computer Structures: Readings and Examples. Computer proofs in Gödel's class theory with equational definitions for composite and cross. CADE-19: The 19th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. In Proceedings of the Conference on Automated Deduction, 1994. PROTEIN: A PROver with a theory extension INterface. CADE-17-The 17th International Conference on Automated Deduction, vol. FDPLL-A first-order Davis-Putnam-Logemann-Loveland procedure. Verify: A program for proving correctness of digital hardware designs. Discussion of the paper: Programs with common sense. International Semantic Web Conference, Lecture Notes in Computer Science, vol. Consistency checking of semantic web ontologies. Elimination of equality via transformation with ordering constraints. Rewrite-based equational theorem proving with selection and simplification. Resolution of Equations in Algebraic Structures 2: Rewriting Techniques, pages 1-30. In Proceedings of the Symposium on Logic in Computer Science, pages 346-357, 1986. Proceedings of the Eighth International Conference on Automated Deduction, pages 5-20, 1986. Commutation, transformation, and termination. Termination orderings for associative-commutative rewriting systems. Cambridge University Press, Cambridge, England, 1998. CADE-19, 19th International Conference on Automated Deduction, Miami Beach, FL, USA, July 28-August 2, 2003. Cambridge University Press, Cambridge, UK, 2003.
The Description Logic Handbook: Theory, Implementation, Applications.
Termination of term rewriting using dependency pairs. Dislop: A research project on disjunctive logic programming. TPS: A hybrid automatic-interactive system for developing proofs. TPS: A theorem proving system for classical type theory.
Partition-based logical reasoning for first-order and propositional theories.
0 kommentar(er)
