Searching for authors named "Thomas Linke" – sorted by Relevance.
14 documents found, showing 1 through 10.
Next 10 →
-
Graph Theoretical Characterization and Computation of Answer Sets
- …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 …
- Cited by 13 (8 self) – Add To MetaCart
-
Using Nested Logic Programs for Answer Set Programming
- …We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs.…
- Cited by 5 (3 self) – Add To MetaCart
-
Suitable Graphs for Answer Set Programming
- …Often graphs are used to investigate properties of logic programs.…
- Cited by 5 (2 self) – Add To MetaCart
-
Alternative foundations for Reiter's default logic
- …We introduce an alternative conceptual basis for default reasoning in Reiter's default logic. In fact, most formal or computational treatments of default logic suffer from the necessity of exhaustive consistency checks with respect to the finally resulting set of conclusions; often this so-called ex…
- Cited by 4 (2 self) – Add To MetaCart
-
An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem
- …. We introduce new concepts for default reasoning in the context of query-answering in regular default logic. For this purpose, we develop a prooforiented approach for deciding whether a default theory has an extension containing a given query. The inherent problem in Reiter's default logic is that …
- Cited by 1 (1 self) – Add To MetaCart
-
NoMoRe: Non-Monotonic Reasoning with Logic Programs
- …Introduction The non-monotonic reasoning system noMoRe [2] implements answer set semantics for normal logic programs. It realizes a novel, rule-based paradigm to compute answer sets by computing non-standard graph colorings of the block graph associated with a given logic program (see [6, 8, 7] for…
- Cited by 9 (6 self) – Add To MetaCart
-
More on noMoRe
- …This paper focuses on the efficient computation of answer sets for normal logic programs. It concentrates on a recently proposed rule-based method (implemented in the noMoRe system) for computing answer sets. We show how noMoRe and its underlying method can be improved tremendously by extending the…
- Cited by 6 (4 self) – Add To MetaCart
-
T.: Profiling answer set programming: The visualization component of thenoMoRe system
- …Abstract. Standard debugging techniques, like sequential tracing, fail in answer set programming due to its purely declarative approach. We address this problem by means of the graph-oriented computational model underlying the noMoRe system. Although this is no generic solution, it offers a way to m…
- Cited by 2 (1 self) – Add To MetaCart
-
Graphs and Colorings for Answer Set Programming: Abridged Report
- …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…
- Cited by 7 (5 self) – Add To MetaCart
-
Graphs and Colorings for Answer Set Programming with Preferences: Preliminary Report
- …The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from non-preferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling st…
- Cited by 3 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
