443 search results - page 41 / 89 » SAT-Based Answer Set Programming |
AI
2011
Springer
13 years 2 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
ICLP
1994
Springer
13 years 12 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
nlp is a compiler for nested logic programming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets ...