7167 search results - page 82 / 1434 » Answer Set Programming |
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some an...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a new answer set solver nomore++. Distinguishing features include its treatment of heads and bodies equitably as computational objects and a new hybrid lookahe...
CPAIOR
2009
Springer
14 years 2 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...