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...
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...
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...
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...
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