Narendran and Rusinowitch. The theory of total unary rpo is decidable. In First International Conference on Computational Logic, volume 1861 of Lecture Notes in Computer Science, pages 660-672, 2000.  Home/Search   Document Details and Download   Summary   Related Articles

....mainly used in automated deduction: the Knuth Bendix orders [9] and various versions of the recursive path orders [5] Because of its importance, the decision problem 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 polynomial time algorithm for constraint solving [11] a polynomial time algorithm for solving constraints consisting of a single inequality [12] In resolution based theorem ....

.... cations, we need to consider constraints which involve rst order quanti ers. Unfortunately the rst order theory of the recursive path orders is undecidable [20, 4] Only recently the decidability of the rst order theory of recursive path orders in the case of unary signatures has been proven [14]. A signature is called unary if it consists of unary function symbols and constants. In this paper we prove the decidability of the rst order theory of the KnuthBendix orders in the case of unary signatures. Our decision procedure uses interpretation of unary terms as trees and uses ....

Narendran and Rusinowitch. The theory of total unary rpo is decidable. In First International Conference on Computational Logic, volume 1861 of Lecture Notes in Computer Science, pages 660-672, 2000.

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