193 search results - page 18 / 39 » On the Progression Semantics and Boundedness of Answer Set P... |
CORR
2002
Springer
14 years 9 months ago
2002
Springer
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
LPNMR
2004
Springer
15 years 2 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 ...
118
Voted
ICLP
1994
Springer
15 years 1 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...
126
click to vote
LOPSTR
2009
Springer
15 years 4 months ago
2009
Springer
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...