Advertisement

RPO Constraint Solving Is in NP

  • Paliath Narendran
  • Michael Rusinowitch
  • Rakesh Verma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1584)

Abstract

A new decision procedure for the existential fragment of ordering constraints expressed using the recursive path ordering is presented. This procedure is nondeterministic and checks whether a set of constraints is solvable over the given signature, i.e., the signature over which the terms in the constraints are defined. It is shown that this non-deterministic procedure runs in polynomial time, thus establishing the membership of this problem in the complexity class NP for the first time.

Keywords

Simple System Function Symbol Ground Term Automate Deduction Unordered Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Comon, H.: Solving inequations in term algebras. In: Proc. 5th IEEE Symp. Logic in Computer Science (LICS), Philadelphia (June 1990)Google Scholar
  2. 2.
    Comon, H., Treinen, R.: The first-order theory of lexicographic path orderings is undecidable. Theoretical Computer Science 176 (April 1997)Google Scholar
  3. 3.
    Dershowitz, N.: Orderings for term-rewriting systems. Theoretical Computer Science 17(3), 279–301 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Dershowitz, N.: Termination of rewriting. Journal of Symbolic Computation 3(1), 69–115 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243–309. North-Holland, Amsterdam (1990)Google Scholar
  6. 6.
    Ganzinger, H., Nieuwenhuis, R., Nivela, P.: The Saturate System (1995), Software and documentation available from: http://www.mpi-sb.mpg.de
  7. 7.
    Hsiang, J., Rusinowitch, M.: On word problems in equational theories. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 54–71. Springer, Heidelberg (1987)Google Scholar
  8. 8.
    Jouannaud, J.-P., Okada, M.: Satisfiability of systems of ordinal notations with the subterm ordering is decidable. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 455–468. Springer, Heidelberg (1991)Google Scholar
  9. 9.
    Kapur, D., Narendran, P., Sivakumar, G.: A path ordering for proving termination of term rewriting systems. In: Nivat, M., Floyd, C., Thatcher, J., Ehrig, H. (eds.) CAAP 1985 and TAPSOFT 1985. LNCS, vol. 185, pp. 173–187. Springer, Berlin (1985)Google Scholar
  10. 10.
    Kapur, D., Sivakumar, G.: Maximal Extensions of Simplification Orderings. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026. Springer, Heidelberg (1995)Google Scholar
  11. 11.
    Kirchner, C., Kirchner, H., Rusinowitch, M.: Deduction with symbolic constraints. Revue Française d’Intelligence Artificielle 4(3), 9–52 (1990) (Special issue on automatic deduction)Google Scholar
  12. 12.
    Krishnamoorthy, M.S., Narendran, P.: Note on recursive path ordering. TCS 40, 323–328 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Lescanne, P.: On the recursive decomposition ordering with lexicographical status and other related orderings. J. of Automated Reasoning 6(1), 39–49 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Nieuwenhuis, R.: Simple LPO constraint solving methods. Inf. Process. Lett. 47(2), 65–69 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Nieuwenhuis, R., Rubio, A.: Theorem proving with ordering constrained clauses. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 477–491. Springer, Heidelberg (1992)Google Scholar
  16. 16.
    Plaisted, D.: A recursively defined ordering for proving termination of term rewriting systems. Technical Report R-78-943, U. of Illinois, Dept of Computer Science (1978)Google Scholar
  17. 17.
    Steinbach, J.: Extensions and comparison of simplification orderings. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 434–448. Springer, Heidelberg (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Paliath Narendran
    • 1
  • Michael Rusinowitch
    • 2
  • Rakesh Verma
    • 3
  1. 1.Institute of Programming and Logics, Department of Computer ScienceState University of New York at AlbanyAlbanyUSA
  2. 2.LORIAVillers les Nancy cedexFrance
  3. 3.Dept. of Comp. ScienceUniversity of HoustonHoustonUSA

Personalised recommendations