The nomore++ approach to answer set solving

Authors:
Christian Anger;Martin Gebser;Thomas Linke;André Neumann;Torsten Schaub
Affiliations:
Institut für Informatik, Universität Potsdam, Potsdam;Institut für Informatik, Universität Potsdam, Potsdam;Institut für Informatik, Universität Potsdam, Potsdam;Institut für Informatik, Universität Potsdam, Potsdam;Institut für Informatik, Universität Potsdam, Potsdam
Venue:
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2005

Citing 10
Cited 16

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation

Information and Computation
Fixpoint semantics for logic programming a survey

Theoretical Computer Science
Extending and implementing the stable model semantics

Artificial Intelligence
NoMoRe: A System for Non-Monotonic Reasoning under Answer Set Semantics

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Pushing Goal Derivation in DLP Computations

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Tight logic programs

Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
The nomore++ system

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning

Enhancing DLV instantiator by backjumping techniques

Annals of Mathematics and Artificial Intelligence
Experimenting with parallelism for the instantiation of ASP programs

Journal of Algorithms
Justifications for logic programs under answer set semantics

Theory and Practice of Logic Programming
Extended asp tableaux and rule redundancy in normal logic programs1

Theory and Practice of Logic Programming
On the relation among answer set solvers

Annals of Mathematics and Artificial Intelligence
What's a head without a body?

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Experiences Running a Parallel Answer Set Solver on Blue Gene

Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Extended ASP tableaux and rule redundancy in normal logic programs

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Advanced techniques for answer set programming

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Testing and debugging techniques for answer set solver development

Theory and Practice of Logic Programming
Semantics and complexity of recursive aggregates in answer set programming

Artificial Intelligence
The third answer set programming competition: preliminary report of the system competition track

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Tableau calculi for answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Justifications for logic programs under answer set semantics

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Conflict-driven answer set solving: From theory to practice

Artificial Intelligence
Tableau Calculi for Logic Programs under Answer Set Semantics

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new answer set solver, called nomore++, along with its underlying theoretical foundations. A distinguishing feature is that it treats heads and bodies equitably as computational objects. Apart from its operational foundations, we show how it improves on previous work through its new lookahead and its computational strategy of maintaining unfounded-freeness. We underpin our claims by selected experimental results.