567 search results - page 16 / 114 » Probabilistic Reasoning With Answer Sets |
ASP
2001
Springer
14 years 3 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
NMR
2004
Springer
14 years 4 months ago
2004
Springer
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
LPNMR
2005
Springer
14 years 4 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
ASP
2005
Springer
14 years 4 months ago
2005
Springer
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
AUSAI
2006
Springer
14 years 2 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...