86 search results - page 9 / 18 » Translating Preferred Answer Set Programs to Propositional L... |
AUSAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
ASP
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
BIRTHDAY
2005
Springer
14 years 1 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
14 years 1 months ago
2004
Springer
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...