Logics for qualitative inductive generalization

The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attention is also paid to ways of handling background knowledge, introducing mere conjectures, and the research guiding capabilities of the logics

Two new strategies for inconsistency-adaptive logics

In this paper I present two new strategies for inconsistency adaptive logics: the reliable sufficient information strategy of ACLuN3 and the minimally abnormal sufficient information strategy of ACLuN4. I give proof theory and semantics for both ACLuN3 and ACLuN4. I also compare them with the well-known inconsistency-adaptive logics ACLuN1 and ACLuN2

Адаптивные дескрипционные динамические доксастические логики вопросов

Basic ideas of adaptive logics are described. Incorporation problems of the data adaptation into the systems of epistemic and doxastic logics are analysed. An idea to combine tools of dynamic doxastic and adaptive logics to extend description logics is proposed.Описаны базовые идеи адаптивной логики. Проанализированы трудности применения инструментария адаптации данных в рамках доксастических и эпистемических логик. Сформулирована идея комбинирования аппарата динамических доксастических и адаптивных логик для расширения аппарата дескрипционных логик

On a Partial Decision Method for Dynamic Proofs

This paper concerns a goal directed proof procedure for the propositional fragment of the adaptive logic ACLuN1. At the propositional level, it forms an algorithm for final derivability. If extended to the predicative level, it provides a criterion for final derivability. This is essential in view of the absence of a positive test. The procedure may be generalized to all flat adaptive logics.Comment: 18 pages. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/

Adaptive logic characterizations of input/output logic

We translate unconstrained and constrained input/output logics as introduced by Makinson and van der Torre to modal logics, using adaptive logics for the constrained case. The resulting reformulation has some additional benefits. First, we obtain a proof-theoretic (dynamic) characterization of input/output logics. Second, we demonstrate that our framework naturally gives rise to useful variants and allows to express important notions that go beyond the expressive means of input/output logics, such as violations and sanctions

Towards the unification of inconsistency handling mechanisms

It is shown that the (flat) consequence relations defined from the Rescher-Manor Mechanism (that is: in terms of maximal consistent subsets of the premises) are all inconsistency-adaptive logics combined with a specific interpretation schema for the premises. Each of the adaptive logics is obtained by applying a suitable adaptive strategy to the paraconsistent logic CLuN.This result provides all those consequence relations with a (dynamic) proof theory and with a static (as well as a dynamic) semantics.