58 search results - page 1 / 12 » Ordered Completion for First-Order Logic Programs on Finite ... |
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
2007
IEEE
13 years 10 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
SEMWEB
2009
Springer
13 years 11 months ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
IJCAI
2007
13 years 6 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...