7456 search results - page 207 / 1492 » Parallelism in Logic Programming |
193
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
161
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
151
click to vote
LPNMR
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We describe the development of a constraint logic programming based system, called CPP, which is capable of generating most preferred plans with respect to a user’s pre...
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...