The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
In this paper, I will show how a controlled natural language can be used to describe knowledge for the Semantic Web and discuss the formal properties of this language. At the firs...
This paper discusses the background, algorithms and implementation techniques to support programmers in ‘debugging’ logic programs under the answer set semantics. We first inv...
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
Pedro Cabalar, David Pearce, Panos Rondogiannis, W...
Logic Programs with Annotated Disjunctions and CP-logic are two different but related languages for expressing probabilistic information in logic programming. The paper presents a...
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...