## Paramodulation with Built-In Abelian Groups (2000)

Venue: | in `15th IEEE Symposium on Logic in Computer Science (LICS |

Citations: | 6 - 4 self |

### BibTeX

@INPROCEEDINGS{Godoy00paramodulationwith,

author = {Guillem Godoy and Robert Nieuwenhuis},

title = {Paramodulation with Built-In Abelian Groups},

booktitle = {in `15th IEEE Symposium on Logic in Computer Science (LICS},

year = {2000},

pages = {413--424},

publisher = {IEEE Computer Society Press}

}

### OpenURL

### Abstract

A new technique is presented for superposition with firstorder clauses with built-in abelian groups (AG). Compared with previous approaches, it is simpler, and no inferences with the AG axioms or abstraction rules are needed. Furthermore, AG-unification is used instead of the computationally more expensive unification modulo associativity and commutativity. Due to the simplicity and restrictiveness of our inference system, its compatibility with redundancy notions and constraints, and the fact that standard term orderings like RPO can be used, we believe that our technique will become the method of choice for practice, as well as a basis for new theoretical developments like logicbased complexity and decidability analysis. Keywords: term rewriting, automated deduction. 1 Introduction It is crucial for the performance of a deduction system that it incorporates specialized techniques to work efficiently with standard algebraic theories, since a nave handling of some axioms (like assoc...

### Citations

779 | Rewrite Systems
- Dershowitz, Jouannaud
- 1990
(Show Context)
Citation Context ...also lead to logic-based decidability and complexity results, along the lines of, e.g., [5, 13, 14] [9, 8, 22]. 2 Basic notions We use the standard notation and terminology for terms and rewriting of =-=[7]-=-, for inference rules, clauses and equality Herbrand models of [3, 17], and for constraints and constrained clauses of [15, 17]. We use the followingterminology for positions p and q in a term t: we s... |

238 | Unification theory
- Baader, Snyder
- 2001
(Show Context)
Citation Context ...ymbols the decision problem is NP-complete in all three cases, AG unification behaves better in practice. Also the number of unifiers is usually much smaller and not doubly exponential as for AC (see =-=[1, 2]-=- for surveys on these results). Another aspect that makes building-in AG attractive is called symmetrization (e.g., by Le Chenadec in [6]): modulo abelian groups (+; \Gamma; 0), every ground equation ... |

202 |
Rewrite~Based Equational Theorem Proving with Selection and Simplification. Journal of Logic and Computation. Revised version of
- BACHMAIR, GANZINGER
- 1993
(Show Context)
Citation Context ... Thesis [19], proofs for the ground case are given in a uniform framework for AG and several other commutative theories. Here we apply a variant of Bachmair and Ganzinger's model generation technique =-=[3]-=-, where the model is defined by rewriting, modulo associativity and commutativity of +, with the well-known convergent rewrite system RAG for AG, plus a set of ground rewrite rules R that consists of ... |

117 | Paramodulation-based theorem proving
- Nieuwenhuis, Rubio
- 2001
(Show Context)
Citation Context ...g the lines of, e.g., [5, 13, 14] [9, 8, 22]. 2 Basic notions We use the standard notation and terminology for terms and rewriting of [7], for inference rules, clauses and equality Herbrand models of =-=[3, 17]-=-, and for constraints and constrained clauses of [15, 17]. We use the followingterminology for positions p and q in a term t: we say that p is (strictly) below q if q is a (proper) prefix of p, and th... |

73 | Theorem Proving with Ordering and Equality Constrained Clauses
- Nieuwenhuis, Rubio
- 1995
(Show Context)
Citation Context ...s a cheap and useful simplification anyway). Furthermore, in the completeness proofs we consider instances with simplified substitutions oe (extending some ideas from the basic superposition approach =-=[15, 4]-=-). Some steps with RAG may then still be needed in Coe at the frontier between C and oe. But a careful analysis of these steps reveals that they can be covered by considering inferences with AG-unific... |

67 | Basic Paramodulation
- Bachmair, Ganzinger, et al.
- 1995
(Show Context)
Citation Context ...riefly comment on a few aspects that have not been treated yet in this paper. Our completeness proofs are compatible with the notions for redundancy and saturation as in the basic framework and as in =-=[15, 4]-=-. Note that, by dealing with constrained clauses, no AG-unifiers are computed. Instead, the unification problems are stored in the constraints and a constrained clause C j T is redundant if T is unsat... |

58 | A superposition decision procedure for the guarded fragment with equality
- Ganzinger, Nivelle
- 1999
(Show Context)
Citation Context ...hod of choice for practice. On the theoretical side, we expect that our techniques and results will also lead to logic-based decidability and complexity results, along the lines of, e.g., [5, 13, 14] =-=[9, 8, 22]-=-. 2 Basic notions We use the standard notation and terminology for terms and rewriting of [7], for inference rules, clauses and equality Herbrand models of [3, 17], and for constraints and constrained... |

45 | Complexity analysis based on ordered resolution
- Basin, Ganzinger
- 1996
(Show Context)
Citation Context ...come the method of choice for practice. On the theoretical side, we expect that our techniques and results will also lead to logic-based decidability and complexity results, along the lines of, e.g., =-=[5, 13, 14]-=- [9, 8, 22]. 2 Basic notions We use the standard notation and terminology for terms and rewriting of [7], for inference rules, clauses and equality Herbrand models of [3, 17], and for constraints and ... |

35 | The two-variable guarded fragment with transitive relations
- Ganzinger, Meyer, et al.
- 1999
(Show Context)
Citation Context ...hod of choice for practice. On the theoretical side, we expect that our techniques and results will also lead to logic-based decidability and complexity results, along the lines of, e.g., [5, 13, 14] =-=[9, 8, 22]-=-. 2 Basic notions We use the standard notation and terminology for terms and rewriting of [7], for inference rules, clauses and equality Herbrand models of [3, 17], and for constraints and constrained... |

26 | Normalized rewriting: an alternative to rewriting modulo a set of equations
- Marché
- 1996
(Show Context)
Citation Context ...ve handling of some axioms (like associativity and commutativity, AC) leads to an explosion of the search space. Paramodulation with built-in abelian groups (AG) has been investigated by many authors =-=[6, 23, 11, 12, 10, 21, 22, 18]-=-. This is not surprising since abelian groups are of course ubiquitous in many applications of (semi-)automated reasoning. But building-in AG is also attractive for at least two more reasons. On the o... |

21 |
Basic Paramodulation and Decidable Theories
- Nieuwenhuis
- 1996
(Show Context)
Citation Context ...come the method of choice for practice. On the theoretical side, we expect that our techniques and results will also lead to logic-based decidability and complexity results, along the lines of, e.g., =-=[5, 13, 14]-=- [9, 8, 22]. 2 Basic notions We use the standard notation and terminology for terms and rewriting of [7], for inference rules, clauses and equality Herbrand models of [3, 17], and for constraints and ... |

19 | Normalised rewriting and normalised completion
- Marché
- 1994
(Show Context)
Citation Context ...ve handling of some axioms (like associativity and commutativity, AC) leads to an explosion of the search space. Paramodulation with built-in abelian groups (AG) has been investigated by many authors =-=[6, 23, 11, 12, 10, 21, 22, 18]-=-. This is not surprising since abelian groups are of course ubiquitous in many applications of (semi-)automated reasoning. But building-in AG is also attractive for at least two more reasons. On the o... |

13 | Superposition theorem proving for abelian groups represented as integer modules
- Stuber
- 1996
(Show Context)
Citation Context ...ve handling of some axioms (like associativity and commutativity, AC) leads to an explosion of the search space. Paramodulation with built-in abelian groups (AG) has been investigated by many authors =-=[6, 23, 11, 12, 10, 21, 22, 18]-=-. This is not surprising since abelian groups are of course ubiquitous in many applications of (semi-)automated reasoning. But building-in AG is also attractive for at least two more reasons. On the o... |

13 |
Associative Commutative Deduction with constraints. In
- Vigneron
- 1994
(Show Context)
Citation Context ...j T is redundant if T is unsatisfiable. Apart from the well-known basicness restriction, an additional advantage is that only one conclusion is generated, instead of one conclusion for each AG-unifier=-=[20, 16]-=-. Checking the ordering restrictions in our framework is different from the usual situation. Instead of checking whether, say, for given terms s and t, there exists some ground oe such that soesrpo to... |

12 | Decidability and complexity analysis by basic paramodulation
- Nieuwenhuis
- 1998
(Show Context)
Citation Context ...come the method of choice for practice. On the theoretical side, we expect that our techniques and results will also lead to logic-based decidability and complexity results, along the lines of, e.g., =-=[5, 13, 14]-=- [9, 8, 22]. 2 Basic notions We use the standard notation and terminology for terms and rewriting of [7], for inference rules, clauses and equality Herbrand models of [3, 17], and for constraints and ... |

11 | 1997], `Paramodulation with built-in AC-theories and symbolic constraints
- Nieuwenhuis, Rubio
(Show Context)
Citation Context ...j T is redundant if T is unsatisfiable. Apart from the well-known basicness restriction, an additional advantage is that only one conclusion is generated, instead of one conclusion for each AG-unifier=-=[20, 16]-=-. Checking the ordering restrictions in our framework is different from the usual situation. Instead of checking whether, say, for given terms s and t, there exists some ground oe such that soesrpo to... |

8 | Theorem proving in cancellative Abelian monoids
- Ganzinger, Waldmann
- 1996
(Show Context)
Citation Context |

6 | Superposition Theorem Proving for Commutative Algebraic Theories
- Stuber
- 1999
(Show Context)
Citation Context ...ad of directly finding the contradictory instance b \Gamma a for x by AGunification. Technically, even for the ground case, his inference rules and proofs are rather involved. In Stuber's PhD. Thesis =-=[19]-=-, proofs for the ground case are given in a uniform framework for AG and several other commutative theories. Here we apply a variant of Bachmair and Ganzinger's model generation technique [3], where t... |

5 |
Superposition for divisible torsion-free Abelian monoids. In
- Waldmann
- 1998
(Show Context)
Citation Context |

2 |
Canonical Forms in Finitely Presented Algebras
- Chenadec
- 1986
(Show Context)
Citation Context |

2 | Cancellative superposition decides the theory of divisible torsion-free abelian groups
- Waldmann
- 1999
(Show Context)
Citation Context |

2 |
A case study of completion modulo distributivity and Abelian groups
- Zhang
- 1993
(Show Context)
Citation Context |