Where fail-safe default logics fail

Paolo Liberatore · ACM Transactions on Computational Logic · 2007

Reiter's original definition of default logic allows for the application of a default that contradicts one previously applied. We call this condition failure . The possibility of generating failures has been in the past considered a semantical problem, and variants have been proposed to solve it. We show that it is instead a computational feature that is needed to encode some domains into default logic.

Read the paper · More papers on PaperTik