Twenty-Five Years of Preferred Subtheories

In the seminal paper [6], Gerd Brewka argued that ranking a set of default rules without prerequisites, and selecting extensions according to a lexicographic refinement of the inclusion ordering proves to be a natural, simple and efficient way of dealing with the multiple extension (or “subtheories”...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Knowledge Representation, Logic Programming, and Abstract Argumentation pp. 157 - 172
Main Author Lang, Jérôme
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2015
SeriesLecture Notes in Computer Science
Subjects
Belief Base
Default Logic
Default Rule
Default Theory
Judgment Aggregation
Online AccessGet full text
ISBN9783319147253
3319147250
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-14726-0_11

Cover

More Information
Summary:In the seminal paper [6], Gerd Brewka argued that ranking a set of default rules without prerequisites, and selecting extensions according to a lexicographic refinement of the inclusion ordering proves to be a natural, simple and efficient way of dealing with the multiple extension (or “subtheories”) problem. This natural idea has been reused, discussed, revisited, reinvented, adapted many times in the AI community and beyond. Preferred subtheories do not only have an interest in default reasoning, but also in reasoning about time, reasoning by analogy, reasoning with compactly represented preferences, judgment aggregation, and voting. They have several variants (but arguably not so many). In this short paper I will say as much as I can about preferred subtheories in sixteen pages.
ISBN:9783319147253
3319147250
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-14726-0_11