Semantical considerations on nonmonotonic logic
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
The mathematics of inheritance systems
The mathematics of inheritance systems
A first-order conditional logic for prototypical properties
Artificial Intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
On the declarative semantics of logic programs with negation
Readings in nonmonotonic reasoning
A logical framework for default reasoning
Artificial Intelligence
On the declarative semantics of logic programs with negation
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
An algorithm to compute circumscription
Artificial Intelligence
A circumscriptive theorem prover
Artificial Intelligence
New results on semantical non-monotonic reasoning
Proceedings of the 2nd international workshop on Non-monotonic reasoning
On theorem provers for circumscription
Proceedings of the eighth biennial conference of the Canadian Society for Computational Studies of Intelligence on CSCSI-90
A knowledge level analysis of belief revision
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Approximate inference in default logic and circumscription
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Updating and structure in non-monotonic theories
Updating and structure in non-monotonic theories
Reasoning about priorities in default logic
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Default Reasoning: Causal and Conditional Theories
Default Reasoning: Causal and Conditional Theories
System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
A theorem prover for prioritized circumscription
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Preferred subtheories: an extended logical framework for default reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Skeptical inheritance: computing the intersection of credulous extensions
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Query answering in circumscription
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
An approach to default reasoning based on a first-order conditional logic
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
The complexity of propositional default logics
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Hi-index | 0.00 |
We show how to transform any set of prioritized propositional defaults into an equivalent set of parallel (i.e., unprioritized) defaults, in circumscription. We give an algorithm to implement the transform. We show how to use the transform algorithm as a generator of a whole family of inferencing algorithms for circumscription. The method is to employ the transform algorithm as a front end to any inferencing algorithm, e.g., one of the previously available, that handles the parallel (empty) case of prioritization. Our algorithms provide not just coverage of a new expressive class, but also alternatives to previous algorithms for implementing the previously covered class (layered) of prioritization. In particular, we give a new query-answering algorithm for prioritized cirumscription which is sound and complete for the full expressive class of unrestricted finite prioritization partial orders, for propositional defaults (or minimized predicates). By contrast, previous algorithms required that the prioritization partial order be layered, i.e., structured similar to the system of rank in the military. Our algorithm enables, for the first time, the implementation of the most useful class of prioritization: non-layered prioritization partial orders. Default inheritance, for example, typically requires non-layered prioritization to represent specificity adequately. Our algorithm enables not only the implementation of default inheritance (and specificity) within prioritized circumscription, but also the extension and combination of default inheritance with other kinds of prioritized default reasoning, e.g.: with stratified logic programs with negation-as-failure. Such logic programs are previously known to be representable equivalently as layered-priority predicate circumscriptions. Worst-case, the transform increases the number of defaults exponentially. We discuss how inferencing is practically implementable nevertheless in two kinds of situations: general expressiveness but small numbers of defaults, or expressive special cases with larger numbers of defaults. One such expressive special case is non-top-heaviness of the prioritization partial order. In addition to its direct implementation, the transform can also be exploited analytically to generate special case algorithms, e.g., a tractable transform for a class within default inheritance (detailed in another, forthcoming paper). We discuss other aspects of the significance of the fundamental result. One can view the transform as reducing n degrees of partially ordered belief confidence to just 2 degrees of confidence: for-sure and (unprioritized) default. Ordinary, parallel default reasoning, e.g., in parallel circumscription or Poole's Theorist, can be viewed in these terms as reducing 2 degrees of confidence to just 1 degree of confidence: that of the non-monotonic theory's conclusions. The expressive reduction's computational complexity suggests that prioritization is valuable for its expressive conciseness, just as defaults are for theirs. For Reiter's Default Logic and Poole's Theorist, the transform implies how to extend those formalisms so as to equip them with a concept of prioritization that is exactly equivalent to that in circumscription. This provides an interesting alternative to Brewka's approach to equipping them with prioritization-type precedence. A longer version of this paper, including the proof of the central transform result, will soon be available as an IBM Research Report.