Prioritizing Default Logic: Abridged Report
نویسندگان
چکیده
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and show that all existing approaches fail to satisfy them. We develop a new approach which does not suffer from these shortcomings. We start with the simplest case, supernormal default theories, where preferences are handled in a straightforward manner. The generalization to prerequisite-free default theories is based on an additional fixed point condition for extensions. The full generalization to arbitrary default theories uses a reduction of default theories to prerequisite-free theories. The reduction can be viewed as dual to the Gelfond/Lifschitz reduction used in logic programming for the definition of answer sets. We finally show how preference information can be represented in the logical language.
منابع مشابه
A Non-monotonic Goal Specification Language for Planning with Preferences
This paper introduces a default logic based approach to defining goal specification languages that can be non-monotonic and allow for the specification of inconsistencies and priorities among goals. The paper starts by presenting a basic goal specification language for planning with preferences. It then defines goal default theories (resp. with priorities) by embedding goal formulae into defaul...
متن کاملdl2asp: Implementing Default Logic via Answer Set Programming
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formulas in a default theory. Based on this idea, we implement a new default logic solver dl2asp. We report some experimental results, in particular the application of dl2asp for solving the fair division problem in social cho...
متن کاملConstraints in Nonmonotonic Reasoning
We report on the use of constraints to govern partial models of rst-order logic. These models are constructed using systems of default rules, as in the default logic of Reiter, but where Reiter's rules build logical theories, our rules build models. Our approach takes advantage of domain-theoretic notions. A system of default rules is a straightforward generalization of Scott's notion of inform...
متن کاملOn Relevance in Non-monotonic Reasoning: Some Empirical Studies
We report empirical results on factors that influence human default reasoning, both in feature-inheritance type problems and in problems that specify information about exceptions to default rules. These factors include similarity between instances that are reasoned about and whether the classes of the instances are naturallyoccurring or classes of artifacts. While in classical deductive logic, ...
متن کاملKSP: A Resolution-based Prover for Multimodal K, Abridged Report
We briefly describe an implementation of a hyperresolution-based calculus for the propositional basic multimodal logic, Kn. The prover, KSP, which allows for both local and global reasoning, is designed to support experimentation with different combinations of refinements for its basic calculus. We present an experimental evaluation that compares KSP with a range of existing reasoners for Kn.
متن کامل