© Springer-Verlag Berlin Heidelberg 1997.This paper proposes an uniform framework for the proof theory of tractable approximations of propositional reasoning. The key idea is the introduction of approximate proofs. This makes possible the development of an approximating sequent calculus for propositional deduction where proofs can be sound, complete or multi-directional approximations of classical logic. We show how this calculus subsumes existing approaches to approximation such as the BCP - k family of anytime reasoners by Dalal and S - 1, S - 3 entailments by Cadoli and Schaerf.
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||5th Congress of the Italian Association for Artificial Intelligence, AI*IA 1997|
|Period||17/09/97 → 19/09/97|