A General Framework for Reasoning about Inconsistency - Archive ouverte HAL
Communication Dans Un Congrès Année : 2007

A General Framework for Reasoning about Inconsistency

Résumé

Numerous logics have been developed for reasoning about inconsistency which differ in (i) the logic to which they apply, and (ii) the criteria used to draw inferences. In this paper, we propose a general framework for reasoning about inconsistency in a wide variety of logics including ones for which inconsistency resolution methods have not yet been studied (e.g. various temporal and epistemic logics). We start with Tarski and Scott’s axiomatization of logics, but drop their monotonicity requirements that we believe are too strong for AI. For such a logic L, we define the concept of an option. Options are sets of formulas in L that are closed and consistent according to the notion of consequence and consistency in L. We show that by defining an appropriate preference relation on options, we can capture several existing works such as Brewka’s subtheories. We also provide algorithms to compute most preferred options.
Fichier principal
Vignette du fichier
095.pdf (142.57 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04315672 , version 1 (30-11-2023)

Identifiants

  • HAL Id : hal-04315672 , version 1

Citer

Leila Amgoud, Venkatramanan Siva Subrahmanian. A General Framework for Reasoning about Inconsistency. 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), Jan 2007, Hyderabad, India. pp.599--604. ⟨hal-04315672⟩
28 Consultations
24 Téléchargements

Partager

More