Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
- 1 April 2004
- journal article
- research article
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 14 (2), 179-204
- https://doi.org/10.1093/logcom/14.2.179
Abstract
Real agents (natural or artificial) are limited in their reasoning capabilities. In this paper, we present a general framework for modelling limited reasoning based on approximate reasoning and discuss its properties. We start from Cadoli and Schaerf's approximate entailment. We first extend their system to deal with the full language of propositional logic. A tableau inference system is proposed for the extended system together with a subclassical semantics; it is shown that this new approximate reasoning system is sound and complete with respect to this semantics. We show how this system can be incrementally used to move from one approximation to the next until the reasoning limitation is reached. We also present a sound and complete axiomatization of the extended system. We note that although the extension is more expressive than the original system, it offers less control over the approximation process. We then propose a more general system and show that it keeps the increased expressivity and recovers the control. A sound and complete formulation for this new system is given and its expressivity and control advantages are formally proved.Keywords
This publication has 3 references indexed in Scilit:
- Labelled natural deduction for substructural logicsLogic Journal of the IGPL, 1999
- A generalization of analytic deduction via labelled deductive systems. Part I: Basic substructural logicsJournal of Automated Reasoning, 1994
- A semantical analysis of the calculi ${\bf C}_n$.Notre Dame Journal of Formal Logic, 1977