Sciweavers

ASP
2003
Springer
13 years 9 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke
ASP
2003
Springer
13 years 9 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
AGP
2003
IEEE
13 years 10 months ago
An Evolving Agent with EVOLP
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. Evolving Logic Programs (EVOLP) has been recent...
José Júlio Alferes, Antonio Brogi, J...
PPDP
2004
Springer
13 years 10 months ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey
NMR
2004
Springer
13 years 10 months ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski
NMR
2004
Springer
13 years 10 months ago
On acyclic and head-cycle free nested logic programs
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
Thomas Linke, Hans Tompits, Stefan Woltran
NMR
2004
Springer
13 years 10 months ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...
LPNMR
2004
Springer
13 years 10 months ago
Simplifying Logic Programs Under Uniform and Strong Equivalence
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
LPNMR
2004
Springer
13 years 10 months ago
Semantics for Dynamic Logic Programming: A Principle-Based Approach
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
José Júlio Alferes, Federico Banti, ...
LPAR
2004
Springer
13 years 10 months ago
Nonmonotonic Description Logic Programs: Implementation and Experiments
Abstract. The coupling of description logic reasoning systems with other reasoning formalisms (possibly over the Web) is becoming an important research issue and calls for advanced...
Thomas Eiter, Giovambattista Ianni, Roman Schindla...