Kathrin Konczak, Thomas Linke, Torsten Schaub  Home/Search
Context Related
| cs.unipotsdam.de/wv/p...kolisch03a.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 investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. We start from a characterization of answer sets in terms of totally colored dependency graphs. To a turn, we develop a series of operational characterizations of answer sets in terms of operators on partial colorings. In analogy to the notion of a derivation in proof theory, our operational characterizations are expressed as (non-deterministically formed)... (Update)
Cited by: More
Graphs and Colorings for Answer Set Programming with.. - Konczak, Schaub, Linke (2003) (Correct)
Graphs and Colorings for Answer Set Programming with.. - Konczak, Schaub, Linke (2003) (Correct)
Using Nested Logic Programs for Answer Set Programming - Linke (2003) (Correct)
Active bibliography (related documents): More All
1.6: Graphs and Colorings for Answer Set Programming: Abridged.. - Konczak, Linke, Schaub (2003) (Correct)
0.9: Suitable Graphs for Answer Set Programming - Linke (2003) (Correct)
0.4: Graph Theoretical Characterization and Computation of Answer Sets - Linke (2001) (Correct)
Similar documents based on text: More All
0.4: Query-answering in Reiter's Default Logic (Extended Abstract) - Linke, Schaub (Correct)
0.3: Alternative foundations for Reiter's default logic - Linke, Schaub (2000) (Correct)
0.3: An approach to query-answering in Reiter's default logic and.. - Linke, Schaub (1998) (Correct)
Related documents from co-citation: More All
4: Graph theoretical characterization and computation of answer sets - Linke - 2001
4: noMoRe: Non-monotonic reasoning with logic programs - Anger, Konczak et al. - 2002
4: Characterizing and computing stable models of logic programs: the non-stratified.. - Brignoli, Costantini et al. - 1999
BibTeX entry: (Update)
K. Konczak, T. Linke and T. Schaub. Graphs and colorings for answer set programming: Abridged Report, 2003. To appear. http://citeseer.ist.psu.edu/article/konczak03graphs.html More
@misc{ konczak03graphs,
author = "K. Konczak and T. Linke and T. Schaub",
title = "Graphs and colorings for answer set programming: Abridged Report",
text = "K. Konczak, T. Linke and T. Schaub. Graphs and colorings for answer set
programming: Abridged Report, 2003. To appear.",
year = "2003",
url = "citeseer.ist.psu.edu/article/konczak03graphs.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
435 Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1987
234 The well-founded semantics for general logic programs - van Gelder, Ross et al. - 1991
64 A deductive system for nonmonotonic reasoning - Eiter, Leone et al. - 1997
60 Efficient implementation of the well-founded and stable mode.. - Niemela, Simons - 1996
54 Consistency of clark's completion and the existence of stabl.. - Fages - 1994
46 Fixpoint semantics for logic programming a survey - Fitting - 2002
24 Classical negation in logic programs and deductive databases (context) - Gelfond, Lifschitz - 1991
17 Graph theoretical structures in logic programs and default t.. (context) - Dimopoulos, Torres - 1996
12 Graph theoretical characterization and computation of answer.. - Linke - 2001
12 Default theories that always have extensions (context) - Papadimitriou, Sideri - 1994
10 Characterizing and computing stable models of logic programs.. - Brignoli, Costantini et al.
8 noMoRe: Non-monotonic reasoning with logic programs - Anger, Konczak et al. - 2002
7 More on noMoRe - Linke, Anger et al. - 2002
7 Alternative foundations for Reiter's default logic - Linke, Schaub - 2000
4 Graphs and colorings for answer set programming (context) - Linke, Konczak et al. - 2003
4 An approach to query-answering in Reiter's default logic and.. - Linke, Schaub - 1998
4 Using nested logic programs for answer set programming - Linke - 2003
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