A number of generalizations of answer set programming have been proposed in the literature to deal with vagueness, uncertainty, and partial rule satisfaction. We introduce a unifyi...
Jeroen Janssen, Steven Schockaert, Dirk Vermeir, M...
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Abstract. Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rule...
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
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...