Sciweavers

884 search results - page 36 / 177
» Using Nested Logic Programs for Answer Set Programming
Sort
View
CORR
2002
Springer
106views Education» more  CORR 2002»
13 years 7 months ago
Domain-Dependent Knowledge in Answer Set Planning
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
Tran Cao Son, Chitta Baral, Tran Hoai Nam, Sheila ...
LPNMR
2005
Springer
14 years 1 months ago
On Modular Translations and Strong Equivalence
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Paolo Ferraris
CORR
2011
Springer
187views Education» more  CORR 2011»
12 years 11 months ago
Backdoors to Tractable Answer-Set Programming
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
Johannes Klaus Fichte, Stefan Szeider
ICLP
2009
Springer
14 years 8 months ago
Modular Nonmonotonic Logic Programming Revisited
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
ICLP
2007
Springer
14 years 1 months ago
Generic Tableaux for Answer Set Programming
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
Martin Gebser, Torsten Schaub