Sciweavers

LPNMR
2007
Springer
13 years 11 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
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...
LPNMR
2007
Springer
13 years 11 months ago
An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment
Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible Logic ...
Edgardo Ferretti, Marcelo Errecalde, Alejandro Jav...
LPNMR
2007
Springer
13 years 11 months ago
A Preference-Based Framework for Updating Logic Programs
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
James P. Delgrande, Torsten Schaub, Hans Tompits
LPNMR
2007
Springer
13 years 11 months ago
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
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...
LPNMR
2007
Springer
13 years 11 months ago
Debugging ASP Programs by Means of ASP
Answer-set programming (ASP) has become an important paradigm for declarative problem solving in recent years. However, to further improve the usability of answer-set programs, the...
Martin Brain, Martin Gebser, Jörg Pührer...
LPNMR
2007
Springer
13 years 11 months ago
Conditional Planning with External Functions
We introduce the logic-based planning language Kc as an extension of K [5]. Kc
Davy Van Nieuwenborgh, Thomas Eiter, Dirk Vermeir
LPNMR
2007
Springer
13 years 11 months ago
Using Answer Sets to Solve Belief Change Problems
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
Aaron Hunter, James P. Delgrande, Joel Faber
LPNMR
2007
Springer
13 years 11 months ago
On the Effectiveness of Looking Ahead in Search for Answer Sets
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
Guohua Liu, Jia-Huai You
LPNMR
2007
Springer
13 years 11 months ago
Semantics for Possibilistic Disjunctive Programs
In this paper by considering an answer set programming approach and some basic ideas from possibilistic logic, we introduce a possibilistic disjunctive logic programming approach t...
Juan Carlos Nieves, Mauricio Osorio, Ulises Cort&e...
LPNMR
2007
Springer
13 years 11 months ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele