Restricted Access Logics for Inconsistent Information

摘要: For practical reasoning with classically inconsistent information, desiderata for an appropriate logic L could include (1) it is extension of classical — in the sense that all tautologies are theorems L, and (2) contradictions do not trivialize ex falso quodlibet does hold. Two ways realizing second desideratum, any database may be inconsistent, (A) take weaker than proof rules, but use data, or (B) restrict access data to rules. The problem adopting option desideratum then realizable. In this paper, we pursue by adding extra conditions on rules stop certain subsets using To facilitate presentation, approach Labelled Deductive Systems formulae labelled, defined manipulate both labels. terms This gives us a class logics, called restricted meet above.