Automated reasoning: 33 BASIC research problems
Automated reasoning: 33 BASIC research problems
Logic programming and databases
Logic programming and databases
SLIM: an automated reasoner for equivalences, applied to set theory
CADE-10 Proceedings of the tenth international conference on Automated deduction
Reasoning with predicate replacement
Methodologies for intelligent systems, 5
SETHEO: a high-performance theorem prover
Journal of Automated Reasoning
Principles of knowledge representation
Principles of knowledge representation
Prolog technology for default reasoning: proof theory and compilation techniques
Artificial Intelligence
A Confluent Connection Calculus
Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
A Resolution Calculus Extende by Equivalence
GWAI '89 Proceedings of the 13th German Workshop on Artificial Intelligence
Caching and Lemmaizing in Model Elimination Theorem Provers
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
System Description: Similarity-Based Lemma Generation for Model Elimination
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
| Hi-index | 0.00 |
In a previous paper we proposed an approach to exploit literal equivalences in connection tableau based calculi. There we showed that making equivalences explicit offers new possibilities for search space reduction by applying literal demodulation for simplification and by strengthening the well-known regularity refinement. In this paper we generalize this approach to handle conditional equivalences. The generalization is mainly motivated by the circumstance that nonconditional equivalences, if not present at the beginning of a deduction, are much harder to generate than conditional ones.