Sciweavers

308 search results - page 20 / 62
» Answer Set Programming Based on Propositional Satisfiability
Sort
View
FLAIRS
2009
14 years 9 months ago
A Knowledge Compilation Technique for ALC Tboxes
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered ef...
Ulrich Furbach, Heiko Günther, Claudia Oberma...
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
Cause Clue Clauses: Error Localization using Maximum Satisfiability
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
Manu Jose, Rupak Majumdar
ICLP
2003
Springer
15 years 4 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
AI
2006
Springer
14 years 11 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
CPAIOR
2011
Springer
14 years 3 months ago
Optimization Methods for the Partner Units Problem
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
Markus Aschinger, Conrad Drescher, Gerhard Friedri...