Linke, T., and Schaub, T. 2000. Alternative foundations for Reiter's default logic. Artificial Intelligence 124:31--86. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Representation of Incomplete Knowledge by Induction of.. - Nicolas, Duval (2001) (1 citation) (Correct)
....previous method [9] that concerned only Lukaszewicz default theories where the existence of an extension is guaranted. In Reiter s default logic, this point must be more carefully studied. Theorem 1. The algorithm DefaultLearning induces a default theory that has always an extension. Proof: In [14] it is shown that a Reiter s default theory has at least one extension if its block graph contains only even cycles. For a default theory (W; D) the block graph is a pair (D; A) The vertex set D contains all closed defaults obtained from D except those that are incompatible with W , ie: ....
T. Linke and T. Schaub. Alternative foundations for Reiter's default logic. Arti cial Intelligence, 124:3186, 2000.
New Generation Systems for Non Monotonic Reasoning - Nicolas, Saubion.. (2001) (Correct)
....its ability to do a kind of anytime reasoning since when the method stops without giving an extension, we get some approximate solution that can be useful. An interesting way to explore is to investigate how we could derive bene ts from the blocking set and supporting set structures introduced in [7]. It can be useful to de ne a more suitable neighborhood in the LS or to introduce a reparation mechanism in GA or to forbid some partial paths in ACO. Another question to deal with is the non existence of extension problem. Actually, if a default theory has no extension our systems stop after ....
....after having done their maximal number of iterations and we can not attest that there is an extension or not. But, the only way to assert that a general default theory (W; D) has no extension is to explore the whole set CGD = 2 and this is not practicable for non trivial cases. Nevertheless, [7] gives some su cient conditions of non existence that can be helpful in our work. ....
T. Linke and T. Schaub. Alternative foundations for Reiter's default logic. Arti cial Intelligence, 124:3186, 2000.
Graphs and Colorings for Answer Set Programming: Abridged.. - Konczak, Linke, Schaub (2003) Self-citation (Linke Schaub) (Correct)
No context found.
T. Linke and T. Schaub. Alternative foundations for Reiter's default logic. Artificial Intelligence, 124(1):31--86, 2000.
Graphs and Colorings for Answer Set Programming: Abridged.. - Konczak, Linke, Schaub (2003) Self-citation (Linke Schaub) (Correct)
No context found.
T. Linke and T. Schaub. Alternative foundations for Reiter's default logic. Artificial Intelligence, 124(1):31--86, 2000.
Graphs and Colorings for Answer Set Programming: Abridged.. - Konczak, Linke, Schaub (2003) Self-citation (Linke Schaub) (Correct)
No context found.
T. Linke and T. Schaub. Alternative foundations for Reiter's default logic. Artificial Intelligence, 124(1):31--86, 2000.
Graph Theoretical Characterization and Computation of Answer Sets - Linke (2001) (2 citations) Self-citation (Linke) (Correct)
No context found.
T. Linke and T. Schaub. Alternative foundations for Reiter's default logic. Artificial Intelligence, 124:31--86, 2000.
A possibilistic approach to restore consistency in.. - Nicolas, Garcia, Stephan (2004) (Correct)
No context found.
Linke, T., and Schaub, T. 2000. Alternative foundations for Reiter's default logic. Artificial Intelligence 124:31--86.
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