A proof theory for tractable approximations of propositional reasoning

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

© 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.
Original languageEnglish
Title of host publicationAI*IA 97: Advances in Artificial Intelligence - 5th Congress of the Italian Association for Artificial Intelligence, Proceedings
EditorsM. Lenzerini
PublisherSpringer Verlag
Pages219-230
DOIs
Publication statusPublished - 1997
Externally publishedYes
Event5th Congress of the Italian Association for Artificial Intelligence, AI*IA 1997 - Rome, Italy
Duration: 17 Sep 199719 Sep 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Congress of the Italian Association for Artificial Intelligence, AI*IA 1997
Country/TerritoryItaly
CityRome
Period17/09/9719/09/97

Fingerprint

Dive into the research topics of 'A proof theory for tractable approximations of propositional reasoning'. Together they form a unique fingerprint.

Cite this