A machine program for theorem-proving
Communications of the ACM
Journal of Automated Reasoning
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
Partial Instantiation Methods for Inference in First-Order Logic
Journal of Automated Reasoning
Merging Relational Database Technology with Constraint Technology
Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
A Comparison of Different Techniques for Grounding Near-Propositional CNF Formulae
Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference
The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
DCTP - A Disconnection Calculus Theorem Prover - System Abstract
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
New Directions in Instantiation-Based Theorem Proving
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
AI Communications - CASC
The design and implementation of VAMPIRE
AI Communications - CASC
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Instantiation-Based Automated Reasoning: From Theory to Practice
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Encoding industrial hardware verification problems into effectively propositional logic
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Superposition for bounded domains
Automated Reasoning and Mathematics
| Hi-index | 0.00 |
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refutations than resolution for this logic. This shows that methods based on ground instantiation may be weaker than non-ground methods. Second, we introduce a generalisation rule for effectively propositional logic and show that resolution for this logic may have exponentially longer proofs than resolution with generalisation. We also discuss some related questions, such as sort assignments for generalisation.