Sciweavers

142 search results - page 9 / 29
» On the Existence of Answer Sets in Normal Extended Logic Pro...
Sort
View
RR
2010
Springer
13 years 6 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
ASP
2003
Springer
14 years 27 days ago
Translation of Aggregate Programs to Normal Logic Programs
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
IJCAI
2001
13 years 9 months ago
A Comparative Study of Logic Programs with Preference
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a s...
Torsten Schaub, Kewen Wang
LPNMR
2007
Springer
14 years 1 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
FOIKS
2006
Springer
13 years 11 months ago
Guarded Open Answer Set Programming with Generalized Literals
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...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir