aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentic...
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir