229 search results - page 9 / 46 » On Reductive Semantics of Aggregates in Answer Set Programmi... |
FOIKS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
102
Voted
JAIR
2012
12 years 12 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
LPNMR
2005
Springer
15 years 3 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 ...
AMAI
2006
Springer
14 years 9 months ago
2006
Springer
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...