AI
2008
Springer
13 years 3 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
ATVA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
AAAI
2008
13 years 6 months ago
2008
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...
RTA
1998
Springer
13 years 8 months ago
1998
Springer
The system FT
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...
POPL
2002
ACM
14 years 4 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...