Hubert Comon  Home/Search
Context Related
Links: DBLP | lsv.enscachan.fr/~com...inequations.ps 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: lsv.enscachan.fr/~comon...biblio (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show how to solve boolean combinations of inequations s ? t in the Herbrand Universe, assuming that is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a total precedence is decidable. Keywords: simplification orderings, ordered strategies, term algebras, constraint solving. 1. Introduction The first order theory of term algebras over a language (or ... (Update)
Context of citations to this paper: More
...[33] for simplifying subtyping constraints. There is also related work in term rewriting and constraint solving over trees in general [8, 10]. The work in this paper is inspired by work in this area. Maher shows the first order theory of finite trees, infinite trees, and...
...for ordering constraints has been well studied. For the recursive path orders decidability and complexity issues were considered in [8, 2, 16, 17, 15, 14]. For the Knuth Bendix orders we have the following results: the decidability of constraints [10] a nondeterministic...
Cited by: More
Decidability of Type-checking in the Calculus of Algebraic.. - Blanqui (2005) (Correct)
Saturation of First-Order (constrained) Clauses - With The Saturate (Correct)
Complete Monotonic Semantic Path Orderings - Borralleras, Ferreira, Rubio (2000) (Correct)
Active bibliography (related documents): More All
0.5: Rewrite Proofs and Computations - Jouannaud (1995) (Correct)
0.1: Combining Unification- and Disunification Algorithms - Tractable.. - Schulz (1996) (Correct)
0.1: On the Combination of Symbolic Constraints, Solution Domains, .. - Baader, Schulz (Correct)
Similar documents based on text: More All
0.2: About the Theory of Tree Embedding - Boudet, Comon (1993) (Correct)
0.2: Completion of Rewrite Systems with Membership Constraints Part II: .. - Comon (1997) (Correct)
0.1: The First-Order Theory of Lexicographic Path Orderings is.. - Comon, Treinen (1997) (Correct)
Related documents from co-citation: More All
21: Simple lpo constraint solving methods - Nieuwenhuis - 1993
20: Rewrite systems - Dershowitz, Jouannaud - 1990
19: Satisfiability of systems of ordinal notation with the subterm property is decid.. (context) - Jouannaud, Okada - 1991
BibTeX entry: (Update)
Hubert Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387--411, 1990. http://citeseer.ist.psu.edu/comon90solving.html More
@article{ comon90solving,
author = "Hubert Comon",
title = "Solving Symbolic Ordering Constraints",
journal = "International Journal of Foundations of Computer Science",
volume = "1",
number = "4",
pages = "387-412",
year = "1990",
url = "citeseer.ist.psu.edu/comon90solving.html" }
Citations (may not include all citations):788 Rewrite Systems - Dershowitz, Jouannaud - 1990 ACM DBLP
151 Proving termination with multiset orderings (context) - Dershowitz, Manna - 1979
129 Termination of rewriting (context) - Dershowitz - 1987 ACM DBLP
70 Equational problems and disunification (context) - Comon, Lescanne - 1989 ACM DBLP
52 On word problems in equational theories (context) - Hsiang, Rusinowitch - 1987 ACM DBLP
49 Orderings for equational proofs (context) - Bachmair, Dershowitz et al. - 1986 DBLP
48 Disunification: a survey - Comon - 1991 DBLP
31 Decidability of the purely existential fragment of the theor.. (context) - Venkataraman - 1987 ACM DBLP
30 A new method for undecidability proofs of first order theori.. - Treinen - 1990 ACM DBLP
8 Complete axiomatizations of the algebras of finite, rational.. (context) - Maher - 1988 DBLP
2 Proof-theoretic techniques for term rewriting (context) - Dershowitz, Okada - 1988
1 Bounded deduction and application to completion procedures (context) - Rusinowitch - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lsv.ens-cachan.fr/~comon/biblio.html): More
A Methodological View of Constraint Solving - Comon, al. (1997) (Correct)
Completion of Rewrite Systems with Membership Constraints Part I.. - Comon (1997) (Correct)
Multiple counters automata, safety analysis and Presburger.. - Comon, Jurski (1998) (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