Robert Nieuwenhuis Technical University of Catalonia Pau Gargallo 5, 08028...  Home/Search
Context Related
| lsi.upc.es/~roberto/paper...ipl93.ps.gz lsi.upc.es/~roberto/paper...ipl93.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...1993 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present simple techniques for deciding the satisfiability of lexicographic path ordering constraints under two different semantics: solutions built over the given signature and solutions in extended signatures. For both cases we give the first NP algorithms, which is optimal as we prove the problems to be NP-complete. We discuss the efficient applicability of the techniques in practice, where, as far as we know, their simply exponential bound improves upon the existing methods, and describe... (Update)
Context of citations to this paper: More
...such as [13, 10] coincide in the unary case. Among the positive results it is known that the existential theory of total lpo is decidable [3, 17]. The same result holds for the case of total rpo [8, 15] The proof technique we use for our decidability result might be...
...constraint solving. This is also the case for our proof of finiteness of the trees. Here we adapt the constraint solving algorithms of [Nie93] with extended signature semantics (i.e. new symbols may appear in solutions) for the recursive path ordering with status (RPO) In...
Cited by: More
The complete list of RTA open problems - Date April Summary (Correct)
The Decidability of the First-Order Theory of the.. - Korovin, Voronkov (Correct)
Practical Algorithms for Deciding Path Ordering Constraint.. - Nieuwenhuis, Rivero (2001) (Correct)
Active bibliography (related documents): More All
0.0: Ordering Constraints on Trees - Comon, Treinen (1994) (Correct)
0.0: The First-Order Theory of Lexicographic Path Orderings is.. - Comon, Treinen (1997) (Correct)
0.0: Theorem Proving with Ordering and Equality Constrained Clauses - Nieuwenhuis, Rubio (1995) (Correct)
Similar documents based on text: More All
0.2: Upper Mantle Tectonics: Three-Dimensional Deformation.. - Andrea Tommasi.. (Correct)
0.2: The Light Lexicographic path Ordering - Cichon, Marion (1999) (Correct)
0.2: μCRL: A Toolset for Analysing Algebraic Specifications - Blom, Fokkink, Groote.. (2001) (Correct)
Related documents from co-citation: More All
21: Solving symbolic ordering constraints - Comon - 1990
16: Rewrite systems - Dershowitz, Jouannaud - 1990
16: Theorem proving with ordering constrained clauses (context) - Nieuwenhuis, Rubio - 1992
BibTeX entry: (Update)
R. Nieuwenhuis. Simple lpo constraint solving methods. IPL, 47(2), 1993. http://citeseer.ist.psu.edu/nieuwenhuis93simple.html More
@article{ nieuwenhuis93simple,
author = "Robert Nieuwenhuis",
title = "Simple {LPO} Constraint Solving Methods",
journal = "Information Processing Letters",
volume = "47",
number = "2",
pages = "65-69",
year = "1993",
url = "citeseer.ist.psu.edu/nieuwenhuis93simple.html" }
Citations (may not include all citations):55 Theorem proving with ordering constrained clauses (context) - Nieuwenhuis, Rubio - 1992
47 Solving symbolic ordering constraints - Comon - 1990
23 Satisfiability of systems of ordinal notations with the subt.. (context) - Jouannaud, Okada - 1991
The graph only includes citing articles where the year of publication is known.
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