Any ground associative-commutative theory has a finite canonical system
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Theorem-proving with resolution and superposition
Journal of Symbolic Computation
On word problems in horn theories
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Congruence Closure Modulo Associativity and Commutativity
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Decision Procedures Using Model Building Techniques
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Deciding Horn Classes by Hyperresolution
CSL '89 Proceedings of the 3rd Workshop on Computer Science Logic
Abstract Congruence Closure and Specializations
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
A Decision Procedure for an Extensional Theory of Arrays
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Simplification by cooperating decision procedures
Simplification by cooperating decision procedures
A Rewrite Rule Based Framework for Combining Decision Procedures
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
A Tableau Calculus for Combining Non-disjoint Theories
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Combining Generic and Domain Specific Reasoning by Using Contexts
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Automatic Synthesis of Decision Procedures: A Case Study of Ground and Linear Arithmetic
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
A Logic of Singly Indexed Arrays
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Automatic 'descente infinie' induction reasoning
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
A resolution-based decision procedure for SHOIQ
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
What's decidable about arrays?
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Superposition for bounded domains
Automated Reasoning and Mathematics
| Hi-index | 0.00 |
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including lists, arrays, extensional arrays and combinations of them. We also give a superposition-based decision procedure for homomorphism.