See this document in CiteSeerX!

Practical Algorithms for Deciding Path Ordering Constraint Satisfaction (2001)  (Make Corrections)  
Robert Nieuwenhuis, José Miguel Rivero



  Home/Search   Context   Related

 
View or download:
lsi.upc.es/~roberto/papers/sf.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  lsi.upc.es/~roberto/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper we introduce some new notions of solved form, where, in addition to the closure under the classical RPO decomposition rules, a restricted form of transitivity through variables is applied. It is proved that if C is a solved form in this sense, then it is satisfiable under extended signatures if, and only if, it has no cycle (Section 5) (Update)

Similar documents (at the sentence level):
56.5%:   Data Structures and Algorithms for Automated Deduction with.. - Rivero (2000)   (Correct)
23.8%:   Solved Forms for Path Ordering Constraints - Nieuwenhuis, Rivero (1999)   (Correct)

Active bibliography (related documents):   More   All
0.9:   Practical Algorithms for Deciding Path Ordering Constraint.. - Nieuwenhuis, Rivero (2000)   (Correct)
0.5:   Paramodulation-Based Theorem Proving - Nieuwenhuis, Rubio (2001)   (Correct)
0.4:   RPO constraint solving is in NP - Narendran, Rusinowitch, Verma (1998)   (Correct)

Similar documents based on text:   More   All
0.8:   Deciding the Confluence of Ordered Term Rewrite Systems - Comon, Narendran..   (Correct)
0.6:   Constraint Solving for Term Orderings Compatible with.. - Godoy, Nieuwenhuis   (Correct)
0.4:   The Barcelona Prover - Nieuwenhuis, Rivero, Vallejo   (Correct)

BibTeX entry:   (Update)

@misc{ nieuwenhuis-practical,
  author = "Robert Nieuwenhuis and José Miguel Rivero",
  title = "Practical Algorithms for Deciding Path Ordering Constraint Satisfaction",
  url = "citeseer.ist.psu.edu/nieuwenhuis01practical.html" }
Citations (may not include all citations):
788   Rewrite systems - Dershowitz, Jouannaud - 1990
82   Two generalizations of the recursive path ordering (context) - Kamin, Levy - 1980
67   Theorem Proving with Ordering and Equality Constrained Claus.. - Nieuwenhuis, Rubio - 1995
55   Theorem proving with ordering constrained clauses (context) - Nieuwenhuis, Rubio - 1992
47   Solving symbolic ordering constraints - Comon - 1990
38   Simple LPO constraint solving methods - Nieuwenhuis - 1993
37   Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
37   Paramodulation-based theorem proving - Nieuwenhuis, Rubio - 2000
23   Satisfiability of systems of ordinal notations with the subt.. (context) - Jouannaud, Okada - 1991
19   ene Kirchner, and Michael Rusinowitch. Deduction with symbol.. (context) - Kirchner - 1990
19   the recursive decomposition ordering with lexicographical st.. (context) - Lescanne - 1990
18   Decision problems in ordered rewriting - Comon, Narendran et al. - 1998
15   A path ordering for proving termination for term rewriting s.. (context) - Kapur, Narendran et al. - 1985
15   Ordering Constraints on Trees - Comon, Treinen - 1994
7   RPO constraint solving is in NP - Narendran, Rusinowitch et al. - 1999
7   Solved forms for path ordering constraints - Nieuwenhuis, Rivero - 1999
5   A note on recursive path ordering (context) - Krishnamoorthy, Narendran - 1985
1   Software and documentation available at: http://www (context) - Ganzinger, Nieuwenhuis et al. - 1999

Documents on the same site (http://www.lsi.upc.es/~roberto/papers.html):   More
Induction = I-Axiomatization + First-Order Consistency - Comon, Nieuwenhuis (1999)   (Correct)
Paramodulation with Non-Monotonic Orderings - Bofill, Godoy, Nieuwenhuis, Rubio (1999)   (Correct)
Modular Redundancy for Theorem Proving - Bofill, Godoy, Nieuwenhuis, Rubio (2000)   (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