6554 search results - page 244 / 1311 » Constraint Logic Programming |
142
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
We pursue a representation of logic programs as classical first-order sentences. Different semantics for logic programs can then be expressed by the way in which they are wrapped...
165
click to vote
NMR
2004
Springer
15 years 12 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.
160
click to vote
FUIN
2006
15 years 6 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...
196
click to vote
CADE
2003
Springer
16 years 6 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...
145
click to vote
ICLP
1995
Springer
15 years 10 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...