149 search results - page 1 / 30 » Encoding Planning Problems in Nonmonotonic Logic Programs |
ECP
1997
Springer
13 years 9 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
ASP
2001
Springer
13 years 8 months ago
2001
Springer
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...