Sciweavers

AAAI
2006
14 years 27 days 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
LPNMR
2005
Springer
14 years 5 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
LPNMR
2005
Springer
14 years 5 months ago
The nomore++ System
Abstract. We present a new answer set solver nomore++. Distinguishing features include its treatment of heads and bodies equitably as computational objects and a new hybrid lookahe...
Christian Anger, Martin Gebser, Thomas Linke, Andr...
ASP
2005
Springer
14 years 5 months ago
A Preliminary Report on Integrating of Answer Set and Constraint Solving
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
ICTAI
2007
IEEE
14 years 5 months ago
Adaptive Lookahead for Answer Set Computation
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
Guohua Liu, Jia-Huai You
ICLP
2009
Springer
15 years 3 days ago
Finding Similar or Diverse Solutions in Answer Set Programming
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...
Thomas Eiter, Esra Erdem, Halit Erdogan, Michael F...