Computing Generalized Specificity

Journal of Applied Non-Classical Logics 13 (1):87-113 (2003)
  Copy   BIBTEX

Abstract

Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i. e., preference among defeasible rules is determined dynamically during the dialectical analysis.We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rulebased formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Maxwell's demon and computation.Richard Laing - 1974 - Philosophy of Science 41 (2):171-178.
Computing mechanisms.Gualtiero Piccinini - 2007 - Philosophy of Science 74 (4):501-526.
Recent Computability Models Inspired from Biology: DNA and Membrane Computing.Gheorghe Păun & Mario J. Pérez-Jiménez - 2010 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 18 (1):71-84.
Generalized Halfspaces in the Mixed-Integer Realm.Philip Scowcroft - 2009 - Notre Dame Journal of Formal Logic 50 (1):43-51.

Analytics

Added to PP
2014-01-21

Downloads
87 (#177,873)

6 months
3 (#439,386)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

References found in this work

Argument-based extended logic programming with defeasible priorities.Henry Prakken & Giovanni Sartor - 1997 - Journal of Applied Non-Classical Logics 7 (1-2):25-75.
Foundations of Logic Programming.J. W. Lloyd - 1987 - Journal of Symbolic Logic 52 (1):288-289.
Abstract argumentation systems.Gerard A. W. Vreeswijk - 1997 - Artificial Intelligence 90 (1-2):225-279.
Self-defeating arguments.John L. Pollock - 1991 - Minds and Machines 1 (4):367-392.

View all 7 references / Add more references