86 search results - page 12 / 18 » Translating Preferred Answer Set Programs to Propositional L... |
ASP
2005
Springer
14 years 1 months ago
2005
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...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
LOGCOM
2010
13 years 6 months ago
2010
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
LPNMR
2005
Springer
14 years 1 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...