Ontologies can be used to provide an enriched vocabulary for the formulation of queries over instance data. We identify query emptiness and predicate emptiness as two central reas...
Franz Baader, Meghyn Bienvenu, Carsten Lutz, Frank...
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
Raphael A. Finkel, Victor W. Marek, Neil Moore, Mi...
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...