Thomas Linke  Home/Search
Context Related
| cs.unipotsdam.de/wv/pdf...linke01a.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.unipotsdam.de/wv/publ...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Cited by: More
A possibilistic approach to restore consistency in.. - Nicolas, Garcia, Stephan (2004) (Correct)
Graphs and Colorings for Answer Set Programming: Abridged.. - Konczak, Linke, Schaub (2003) (Correct)
NoMoRe: Non-Monotonic Reasoning with Logic Programs - Anger, Konczak, Linke (2002) (Correct)
Active bibliography (related documents): More All
0.5: More on noMoRe - Linke, Anger, Konczak (2002) (Correct)
0.3: The Limits of Fixed-Order Computation - Sagonas, Swift, Warren (1996) (Correct)
0.2: Alternative foundations for Reiter's default logic - Linke, Schaub (2000) (Correct)
Similar documents based on text: More All
0.6: Query-answering in Reiter's Default Logic (Extended Abstract) - Linke, Schaub (Correct)
0.5: Graphs and Colorings for Answer Set Programming with.. - Konczak, Schaub, Linke (2003) (Correct)
0.3: Using Nested Logic Programs for Answer Set Programming - Linke (2003) (Correct)
Related documents from co-citation: More All
8: noMoRe: Non-monotonic reasoning with logic programs - Anger, Konczak et al. - 2002
8: Characterizing and computing stable models of logic programs: the non-stratified.. - Brignoli, Costantini et al. - 1999
7: Classical negation in logic programs and deductive databases (context) - Gelfond, Lifschitz - 1991
BibTeX entry: (Update)
Th. Linke. Graph theoretical characterization and computation of answer sets. In B. Nebel, editor, Proceedings of the IJCAI, pages 641645. Morgan Kaufmann Publishers, 2001. http://citeseer.ist.psu.edu/linke01graph.html More
@inproceedings{ linke01graph,
author = "Thomas Linke",
title = "Graph Theoretical Characterization and Computation of Answer Sets",
booktitle = "{IJCAI}",
pages = "641-648",
year = "2001",
url = "citeseer.ist.psu.edu/linke01graph.html" }
Citations (may not include all citations):858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
334 A truth maintenance system (context) - Doyle - 1979
270 Logic programs with classical negation (context) - Gelfond, Lifschitz - 1990
87 Nonmonotonic Reasoning: Logical Foundations of Commonsense (context) - Brewka - 1991
54 Encoding planning problems in non-monotonic logic programs - Dimopoulos, Nebel et al. - 1997
24 Classical negation in logic programs and deductive databases (context) - Gelfond, Lifschitz - 1991
19 Logic programming with stable model semantics as a constrain.. (context) - Niemela - 1999
17 Graph theoretical structures in logic programs and default t.. (context) - Dimopoulos, Torres - 1996
12 Default theories that always have extensions (context) - Papadimitriou, Sideri - 1994
10 Characterizing and computing stable models of logic programs.. - Brignoli, Costantini et al. - 1999
8 Experimenting with nonmonotonic reasoning - Cholewinski, Marek et al. - 1995
7 Alternative foundations for Reiter's default logic - Linke, Schaub - 2000
3 Fully local and efficient evaluation of alternating fixed po.. - Liu, Ramakrishnan et al. - 1998
1 ECLiPSe is available httpwww (context) - Chan, other et al. - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uni-potsdam.de/wv/publications/index.html): More
Significant Inferences: Preliminary Report - Besnard, Schaub (2000) (Correct)
A Top-down Procedure for Disjunctive Well-founded Semantics - Wang (2001) (Correct)
Graphs and Colorings for Answer Set Programming with.. - Konczak, Schaub, Linke (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC