Affiliation:
1. CNRS and Laboratoire de Recherche en Informatique Bat. 490, Université de Paris Sud, 91405 ORSAY cedex, France
Abstract
We show how to solve boolean combinations of inequations s>t in the Herbrand Universe, assuming that ≥ is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a total precedence is decidable.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献