4370 search results - page 185 / 874 » Algebra of Logic Programming |
NMR
2004
Springer
14 years 4 months ago
2004
Springer
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
FUIN
2006
13 years 10 months ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
ICLP
1995
Springer
14 years 2 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
JELIA
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...