Logic programs with classical negation
Logic programming
Nonmonotonic reasoning: logical foundations of common sense
Nonmonotonic reasoning: logical foundations of common sense
Default theories that always have extensions
Artificial Intelligence
Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
Alternative foundations for Reiter's default logic
Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
On the equivalence and range of applicability of graph-based representations of logic programs
Information Processing Letters
NoMoRe: Non-monotonic Reasoning with Logic Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Answer Set Programming by Ant Colony Optimization
JELIA '02 Proceedings of the European Conference on Logics in 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
NoMoRe: A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Graphs and colorings for answer set programming with preferences
Fundamenta Informaticae
Graphs and colorings for answer set programming
Theory and Practice of Logic Programming
On the existence of stable models of non-stratified logic programs
Theory and Practice of Logic Programming
Conflict, consistency and truth-dependencies in graph representations of answer set logic programs
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Graphs and Colorings for Answer Set Programming with Preferences
Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
| Hi-index | 0.00 |
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-standard graph coloring of so-called block graphs of logic programs. This leads us to an alternative implementation paradigm to compute answer sets, by computing non-standard graph colorings. Our approach is rule-based and not atom-based like most of the currently known methods. We present an implementation for computing answer sets which works on polynomial space.