Sciweavers

443 search results - page 37 / 89
» SAT-Based Answer Set Programming
Sort
View
ECAI
2008
Springer
13 years 9 months ago
Advanced Preprocessing for Answer Set Solving
Abstract. We introduce the first substantial approach to preprocessing in the context of answer set solving. The idea is to simplify a logic program while identifying equivalences ...
Martin Gebser, Benjamin Kaufmann, André Neu...
LPNMR
2005
Springer
14 years 1 months ago
Loops: Relevant or Redundant?
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
Martin Gebser, Torsten Schaub
KR
2004
Springer
14 years 1 months ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka
ICLP
2009
Springer
14 years 8 months ago
Constraint Answer Set Solving
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithm...
Martin Gebser, Max Ostrowski, Torsten Schaub
AAAI
2006
13 years 9 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez