AAAI
2010
13 years 6 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
PODS
2004
ACM
14 years 4 months ago
2004
ACM
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...