Pawel Cholewinski, Miroslaw Truszczynski  Home/Search
Context
Related
| uky.edu/cs/manuscr...nspermutations.ps 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: uky.edu/~mirek/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we analyze an algorithm for generating extensions of a default theory. This algorithm considers all permutations (orderings) of defaults. For each permutation, it constructs a tentative extension incrementally, in each step firing the first applicable default, where the applicability of a default is defined with respect to the part of a tentative extension constructed so far. When no more defaults can be fired, an a posteriori consistency check is performed to test whether... (Update)
Active bibliography (related documents): More All
1.0: Towards Programming in Default Logic - Cholewinski (Correct)
0.3: Computing With Default Logic - Cholewinski, Marek (1999) (Correct)
0.2: Skeptical Rational Extensions - Mikitiuk, Truszczynski (1995) (Correct)
Similar documents based on text: More All
0.2: Unfolding Partiality and Disjunctions in Stable Model.. - Janhunen, Niemelä, Simons (2000) (Correct)
0.1: Default Reasoning System DeReS - Cholewinski, Marek, al. (1996) (Correct)
0.1: Experimenting with Nonmonotonic Reasoning - Cholewinski, Marek, Mikitiuk.. (1995) (Correct)
BibTeX entry: (Update)
@misc{ cholewinski-minimal,
author = "Pawel Cholewinski and Miroslaw Truszczynski",
title = "Minimal Number of Permutations Sufficient to Compute All Extensions a Finite
Default Theory",
url = "citeseer.ist.psu.edu/250371.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
850 A logic for default reasoning (context) - Reiter - 1980
193 Extremal Graph Theory (context) - Bollob'as - 1978
159 the acceptability of arguments and its fundamental role in n.. - Dung - 1993
59 context-dependent reasoning (context) - Marek, Truszczy'nski - 1993
50 An assumption-based framework for non-monotonic reasoning - Bondarenko, Toni et al. - 1993
40 On representatives of subsets (context) - Hall - 1935
20 Towards efficient default reasoning - Niemela - 1995
17 Evaluating an algorithm for default reasoning - Niemela, Simmons - 1995
13 Constrained and rational default logics - Mikitiuk, Truszczy'nski - 1995
9 Rational default logic and disjunctive logic programming (context) - Mikitiuk, Truszczy'nski - 1993
4 New proofs in default logic theory (context) - Antoniou, Langetepe et al. - 1994
3 Default reasoning system --- an implementation of default re.. (context) - Cholewi'nski, Marek et al. - 1995
3 well-orderings and forward chaining (context) - Marek, Nerode et al. - 1995
Documents on the same site (http://www.cs.engr.uky.edu/~mirek/papers.html): More
Skeptical Rational Extensions - Mikitiuk, Truszczynski (1995) (Correct)
Nonmonotonic Reasoning is Sometimes Simpler! - Schwarz, Truszczynski (1993) (Correct)
Extremal Problems in Logic Programming and Stable Model.. - Cholewinski, Truszczynski (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