Short proofs of the pigeonhole formulas based on the connection method
Journal of Automated Reasoning
SETHEO: a high-performance theorem prover
Journal of Automated Reasoning
The Cut Role in Theorem Proving
Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
Proof = Guarantee + Explanation
Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
leanCoP: lean connection-based theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
The Singularity Is Near: When Humans Transcend Biology
The Singularity Is Near: When Humans Transcend Biology
First-order probabilistic inference
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Clausal connection-based theorem proving in intuitionistic first-order logic
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Adding constraint solving to mercury
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Naming proofs in classical propositional logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Early History and Perspectives of Automated Deduction
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Artificial Intelligence in a historical perspective
AI Communications - ECAI 2012 Turing and Anniversary Track
Hi-index | 0.00 |
The article is meant to be kind of the author's manifesto for the role of logic and deduction within Intellectics. Based on a brief analysis of this role the paper presents a number of proposals for future scientific research along the various dimensions in the space of logical explorations. These dimensions include the range of possible applications including modelling intelligent behavior, the grounding of logic in some semantic context, the choice of an appropriate logic from the great variety of alternatives, then the choice of an appropriate formal system for representing the chosen logic, and finally the issue of developing the most efficient search strategies. Among the proposals is a conjecture concerning the treatment of cuts in proof search.