TY - GEN
T1 - A proof theory for tractable approximations of propositional reasoning
AU - Massacci, F.
PY - 1997
Y1 - 1997
N2 - © 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.
AB - © 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.
U2 - 10.1007/3-540-63576-9_110
DO - 10.1007/3-540-63576-9_110
M3 - Conference contribution
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 219
EP - 230
BT - AI*IA 97: Advances in Artificial Intelligence - 5th Congress of the Italian Association for Artificial Intelligence, Proceedings
A2 - Lenzerini, M.
PB - Springer Verlag
T2 - 5th Congress of the Italian Association for Artificial Intelligence, AI*IA 1997
Y2 - 17 September 1997 through 19 September 1997
ER -