Sciweavers

580 search results - page 28 / 116
» On the Foundations of Answer Set Programming
Sort
View
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
ECAI
2010
Springer
13 years 8 months ago
On Testing Answer-Set Programs
Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support...
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch...
ECAI
2010
Springer
13 years 8 months ago
On Semantic Update Operators for Answer-Set Programs
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
Martin Slota, João Leite
ICLP
2010
Springer
13 years 11 months ago
Methods and Methodologies for Developing Answer-Set Programs - Project Description
Answer-set programming (ASP) is a well-known formalism for declarative problem solving, enjoying a continuously increasing number of diverse applications. However, arguably one of ...
Johannes Oetsch, Jörg Pührer, Hans Tompi...
KR
2010
Springer
14 years 9 days ago
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
Reinhard Pichler, Stefan Rümmele, Stefan Szei...