Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
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...
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
Abstract. Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarel...