15 search results - page 1 / 3 » The Decidability of the First-Order Theory of Knuth-Bendix O... |
CADE
2005
Springer
14 years 4 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
FROCOS
2009
Springer
13 years 11 months ago
2009
Springer
DLOG
2009
13 years 2 months ago
2009
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...
LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...