Computing Default Extensions by Reductions on O
نویسندگان
چکیده
Based on a set of simple logical equivalences we define a rewriting procedure that computes extensions in the propositional fragment of the logic of O introduced by Lakemeyer and Levesque. This logic is capable of representing default logic with the advantage of itself being monotonic, with a clearly defined semantics and a separation of the object level and the meta level. The procedure prepares the ground for efficient implementations as it clearly separates the SATsolving part of the reasoning problem from the modal aspects that are specifically caused by defaults. We sketch an extension of the logic to cover confidence levels and show that the resulting system can accommodate ordered default theories with a prescriptive interpretation of preference between defaults.
منابع مشابه
Computing Default Extensions by Reductions on OR
Based on a set of simple logical equivalences we define a rewriting procedure that computes extensions in the propositional fragment of the logic of O introduced by Lakemeyer and Levesque. This logic is capable of representing default logic with the advantage of itself being monotonic, with a clearly defined semantics and a separation of the object level and the meta level. The procedure prepar...
متن کاملComputing Default Extensions . a Heuristic Approach
Default logics represent a simple but a powerful class of nonmonotonic formalisms. The main computational problem specific to these logical systems is a search problem: finding all the extensions (sets of nonmonotonic theorems beliefs) of a default theory. GADEL is an automated system based on a heuristic approach of the classical default extension computing problem and applies the principles o...
متن کاملOn the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کامل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 extension is just about being constructed. On the theoretical side, this exhaustive approach is ref...
متن کاملDefault Reasoning Using Classical Logic
In this paper we show how propositional default theories can be characterized by classical propositional theories: for each nite default theory, we show a classical propositional theory such that there is a one-to-one correspondence between models for the latter and extensions of the former. This means that computing extensions and answering queries about coherence, set-membership and set-entai...
متن کامل