Alexandre Boudet, Evelyne Contejean, Claude Marché  Home/Search
Context Related
| lri.fr/LRI/articles/march...rta96.ps.gz lri.fr/~contejea/publis/rta96.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ps.unisb.de/ccl/publicati...1996 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The inefficiency of AC-completion is mainly due to the doubly exponential number of AC-unifiers and thereby of critical pairs generated. We present AC-complete E-unification, a new technique whose goal is to reduce the number of AC-critical pairs inferred by performing unification in a extension E of AC (e.g. ACU, Abelian groups, Boolean rings, ...) in the process of normalized completion [21]. The idea is to represent complete sets of AC-unifiers by (smaller) sets of E-unifiers. Not only... (Update)
Context of citations to this paper: More
...original term structure, special unification techniques are needed. AC unification algorithms [ Stickel, 1981; Domenjoud, 1991; Boudet et al. 1996 ] are developed to compute all possible most general unifiers of two terms up to associativity and commutativity axioms. Special...
...Since flattening breaks the original term structure, special unification techniques are needed. AC unification algorithms [Sti81, Dom91, BCM96] are developed to compute all possible most general unifiers of two terms up to associativity and commutativity axioms. Special...
Cited by: More
Superposition Theorem Proving for Abelian Groups Represented as.. - Stuber (1996) (Correct)
Efficient First-Order Semantic Deduction Techniques - Zhu (1998) (Correct)
Equational Reasoning using AC Constraints - Plaisted, Zhu (1997) (Correct)
Active bibliography (related documents): More All
0.6: Rewrite Systems - Dershowitz, Jouannaud (1990) (Correct)
0.5: Normalised Rewriting and Normalised Completion - Marche (1994) (Correct)
0.3: Constraints in Term Algebras (Short Survey) - Comon (Correct)
Similar documents based on text: More All
0.5: About the Confluence of Equational Pattern Rewrite Systems - Boudet, Contejean (Correct)
0.3: On Diophantine systems coming from AC-unification of.. - Tomás, Contejean (Correct)
0.3: AC-Unification of Higher-order Patterns - Alexandre Boudet (1997) (Correct)
Related documents from co-citation: More All
3: Termination orderings for associativecommutative rewriting systems (context) - Bachmair, Plaisted - 1985
3: Rewrite systems - Dershowitz, Jouannaud - 1990
2: Automated Reasoning: 33 Basic Research Problems (context) - Wos - 1988
BibTeX entry: (Update)
A. Boudet, E. Contejean, and C Marche. AC-complete unification and its application to theorem proving. In Proceedings of the 7th International Conference on Rewriting Techniques and Applications, pages 18--32, July 1996. http://citeseer.ist.psu.edu/boudet96accomplete.html More
@inproceedings{ boudet96accomplete,
author = "Alexandre Boudet and Evelyne Contejean and Claude March{\'e}",
title = "{AC}-Complete Unification and its Application to Theorem Proving",
booktitle = "Proceedings of the 7th International Conference on Rewriting Techniques and Applications ({RTA}-96)",
volume = "1103",
publisher = "Springer-Verlag",
editor = "H.~Ganzinger",
pages = "18--32",
year = "1996",
url = "citeseer.ist.psu.edu/boudet96accomplete.html" }
Citations (may not include all citations):384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
125 Solving equations in abstract algebras: A rulebased survey o.. (context) - Jouannaud, Kirchner - 1991
103 Complete sets of reductions for some equational theories (context) - Peterson, Stickel - 1981
74 Basic paramodulation and superposition (context) - Bachmair, Ganzinger et al. - 1992
71 Unification in the union of disjoint equational theories: Co.. - Baader, Schulz - 1992
64 Basic superposition is complete (context) - Nieuwenhuis, Rubio - 1992
62 A unification algorithm for associative-commutative function.. (context) - Stickel - 1981
55 Completion of a set of rules modulo a set of equations (context) - Jouannaud, Kirchner - 1986
45 An Algorithm for Finding a Basis for the Residue Class Ring .. (context) - Buchberger - 1965
33 Completion for rewriting modulo a congruence (context) - Bachmair, Dershowitz - 1989
30 Unification in a combination of arbitrary disjoint equationa.. (context) - Schmidt-Schauss - 1990
29 Decision procedures for simple equational theories with perm.. (context) - Lankford, Ballantyne - 1977
23 Associative-commutative unification (context) - Fages - 1987
22 Only prime superpositions need be considered for the Knuth-B.. (context) - Kapur, Musser et al. - 1988
20 Algebraic simplification (context) - Buchberger, Loos - 1982
18 Combining unification algorithms (context) - Boudet - 1993
17 Critical pair criteria for completion (context) - Bachmair, Dershowitz - 1988
15 M'ethodes et outils de conception syst'ematique d'algorithme.. (context) - Kirchner - 1985
13 A new AC-unification algorithm with a new algorithm for solv.. (context) - Boudet, Contejean et al. - 1990
12 Complete sets of reductions modulo Associativity (context) - Baird, Peterson et al. - 1989
12 Normalised rewriting and normalised completion (context) - March'e - 1994
8 Term reduction systems and algebraic algorithms (context) - Loos - 1981
5 ese de doctorat, Universit (context) - Boudet, les et al. - 1990
3 commutativity and identity (context) - Jouannaud, March'e et al. - 1992
Documents on the same site (http://www.ps.uni-sb.de/ccl/publications/1996.html): More
Inductive Data Type Systems: Strong Normalization - Jouannaud, Okada (1997) (Correct)
A Recursive Path Ordering for Higher-Order Terms in.. - Jouannaud, Rubio (1996) (Correct)
Type inference and checking for POS-typed functional logic .. - Almendros-Jiménez (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC