@inbook{32be3c7e1e3b4c5d878d213ff0124b77,

title = "Getting possibilities from the impossible",

abstract = "Abduction is often constructed as a consistent expansion of a database, i.e. abduction demands that a database Δ expanded by an explanation ε is not inconsistent ; Δ∪ε|≠⊥. The constraint is sensible if we stay within classical logic. Without it we end up with every formula inconsistent with Δ being an explanation for any other formula. But what if Δ is inconsistent itself? Then consistent abduction battles like Don Quixote against windmills. All we want from abduction is that it does not introduce inconsistency into a set Δ. This article proposes a proof theory for abduction that can be applied to inconsistent databases by demanding that an abductively derived formula must be from the intersection of all maximal consistent subsets of the database. ",

author = "C. Elsenbroich and Gabbay, {D. M.} and O. Rodrigues",

year = "2006",

language = "English",

series = "IFI Technical Report Series",

publisher = "Institut fur Informatik",

pages = "505--513",

editor = "Jurgen Dix and Anthony Hunter",

booktitle = "Proceedings of the 11th Workshop on Nonmonotic Reasoning",

}