Conference Paper

Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable.

DOI: 10.1007/3-540-54233-7_155 Conference: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings
Source: DBLP

ABSTRACT Without Abstract

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider two decision problems related to the Knuth-Bendix order (KBO). The first problem is orientability: given a system of rewrite rules R, does there exist an instance of KBO which orients every ground instance of every rewrite rule in R. The second problem is whether a given instance of KBO orients every ground instance of a given rewrite rule. This problem can also be reformulated as the problem of solving a single ordering constraint for the KBO. We prove that both problems can be solved in polynomial time. The polynomial-time algorithm for orientability builds upon an algorithm for solving systems of homogeneous linear inequalities over integers. The polynomial-time algorithm for solving a single ordering constraint does not need to solve systems of linear inequalities and can be run in time O(n 2 ). We show that the orientability problem is P-complete. Also we show that if a system is orientable using a realvalued instance of KBO, then it is also orientable using an integer-valued instance of KBO.
    Information and Computation 11/2001; 183(2). DOI:10.1016/S0890-5401(03)00021-X · 0.60 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: It is crucial for the performance of ordered resolution or paramodulationbased deduction systems that they incorporate specialized techniques to work efficiently with standard algebraic theories E. Essential ingredients for this purpose are term orderings that are E-compatible, for the given E, and algorithms deciding constraint satisfiability for such orderings.
    Constraints 10/2001; DOI:10.1023/ · 1.15 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We show that the problem of solving Knuth-Bendix ordering constraints is NP-complete, as a corollary we show that the existential first-order theory of any term algebra with the Knuth-Bendix ordering is NP-complete.
    ACM Transactions on Computational Logic 12/2000; 6(2). DOI:10.1145/1055686.1055692 · 0.64 Impact Factor