Handbook of theoretical computer science (vol. B)
Handbook of logic in artificial intelligence and logic programming
Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation
Information and Computation
Normalized rewriting: an alternative to rewriting modulo a set of equations
Journal of Symbolic Computation
Paramodulation with built-in AC-theories and symbolic constraints
Journal of Symbolic Computation
Superposition theorem proving for abelian groups represented as integer modules
Theoretical Computer Science - Special issue on rewriting techniques and applications
Decidability and complexity analysis by basic paramodulation
Information and Computation
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
A Case Study of Completion Modulo Distributivity and Abelian Groups
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Associative-Commutative Deduction with Constraints
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Superposition for Divisible Torsion-Free Abelian Groups
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Complexity Analysis Based on Ordered Resolution
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Basic Paramodulation and Decidable Theories
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The Two-Variable Guarded Fragment with Transitive Relations
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Superposition Decision Procedure for the Guarded Fragment with Equality
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Paramodulation with Built-In Abelian Groups
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Combinable Extensions of Abelian Groups
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Automatic decidability and combinability
Information and Computation
Deduction with XOR constraints in security API modelling
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Integrating linear arithmetic into superposition calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
A new technique is presented for superposition with first-order clauses with built-in Abelian groups (AG). Compared with previous approaches, it is simpler, and AG-unification is used instead of the computationally more expensive unification modulo associativity and commutativity. Furthermore, no inferences with the AG axioms or abstraction rules are needed; in this sense this is the first approach where AG is completely built in.