Extending and implementing the stable model semantics
Reads0
Chats0
TLDR
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes which offers a competitive implementation of the stable model semantics for normal programs and attractive performance for problems where the new types of rules provide a compact representation.About:
This article is published in Artificial Intelligence.The article was published on 2002-06-01 and is currently open access. It has received 1019 citations till now. The article focuses on the topics: Well-founded semantics & Stable model semantics.read more
Citations
More filters
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Journal ArticleDOI
The DLV system for knowledge representation and reasoning
Nicola Leone,Gerald Pfeifer,Wolfgang Faber,Thomas Eiter,Georg Gottlob,Simona Perri,Francesco Scarcello +6 more
TL;DR: The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration, and the main international projects investigating the potential of the system for industrial exploitation are described.
Book ChapterDOI
Bounded Model Checking
TL;DR: This article surveys a technique called Bounded Model Checking (BMC), which uses a propositional SAT solver rather than BDD manipulation techniques, and is widely perceived as a complementary technique to BDD-based model checking.
Bounded Model Checking.
TL;DR: This article surveys a technique called Bounded Model Checking (BMC), which uses a propositional SAT solver rather than BDD manipulation techniques, and is widely perceived as a complementary technique to BDD-based model checking.
Journal ArticleDOI
Potassco: The Potsdam Answer Set Solving Collection
Martin Gebser,Benjamin Kaufmann,Roland Kaminski,Max Ostrowski,Torsten Schaub,Marius Schneider +5 more
TL;DR: This paper gives an overview of the open source project Potassco, the Potsdam Answer Set Solving Collection, bundling tools for Answer Set Programming developed at the University ofPotsdam.
References
More filters
Journal ArticleDOI
A logic for default reasoning
TL;DR: This paper proposes a logic for default reasoning, develops a complete proof theory and shows how to interface it with a top down resolution theorem prover, and provides criteria under which the revision of derived beliefs must be effected.
Proceedings Article
The stable model semantics for logic programming
TL;DR: This paper introduces a succinct abstract representation of constraint atoms in which a constraint atom is represented compactly and shows that this representation provides a means to characterize dependencies of atoms in a program with constraint atoms, so that some standard characterizations and properties relying on these dependencies in the past for logic programs with ordinary atoms can be extended.
Book
A machine program for theorem-proving
TL;DR: The programming of a proof procedure is discussed in connection with trial runs and possible improvements.
Journal ArticleDOI
A truth maintenance system
TL;DR: The need of problem solvers to choose between alternative systems of beliefs is stressed, and a mechanism by which a problem solver can employ rules guiding choices of what to believe, what to want, and what to do is outlined.
Journal ArticleDOI
The well-founded semantics for general logic programs
TL;DR: It is shown that the class of programs possessing a total well-founded model properly includes previously studied classes of "stratified" and "locally stratified" programs, and is compared with other proposals in the literature.