Twenty-Five Years of Preferred Subtheories
Lang, Jérôme (2015), Twenty-Five Years of Preferred Subtheories, in Eiter, Thomas; Strass, Hannes; Truszczyński, Mirosław; Woltran, Stefan, Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday, Springer International Publishing : Cham, p. 157-172. 10.1007/978-3-319-14726-0_11
Book titleAdvances in Knowledge Representation, Logic Programming, and Abstract Argumentation Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday
Book authorEiter, Thomas; Strass, Hannes; Truszczyński, Mirosław; Woltran, Stefan
Series titleLecture Notes in Computer Science (n°9060)
Number of pages359
MetadataShow full item record
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)In the seminal paper , 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.
Subjects / KeywordsKnowledge representation; Computer Science; Artificial Intelligence
Showing items related by title and author.