We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
In this paper we propose a logic programming language which supports hypothetical updates together with integrity constraints. The language allows sequences of updates by sets of a...
Dov M. Gabbay, Laura Giordano, Alberto Martelli, N...
Abstract. We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supp...