Loading...
Please wait, while we are loading the content...
Similar Documents
Tableaux for Approximate Reasoning (2001)
| Content Provider | CiteSeerX |
|---|---|
| Author | Finger, Marcelo Wassermann, Renata |
| Description | In this paper, we show that inconsistency can be fruitfully used to approximate classical theorem proving. We extend Cadoli and Schaerf's Approximate Entailment, originally dened only for formulas in clausal form, to full classical propositional logic. To this end, we provide approximations to classical logic via a family of logics solidly based on formal semantics and a tableaux proof system. Soundness and completeness are shown for the tableaux calculus with respect to the given semantics. The tableaux system is then shown to provide a useful heuristics for the incremental approximation of classical logic, a feature that was lacking in existing proposals for approximate reasoning. By means of such incremental method, we can move from one logic to the next one in the family, aiming to show a classical theorem. Incrementality means that we can proceed with the proof in the latter logic from the point where it stopped in the former one, without doing any recomputation. 1 |
| File Format | |
| Language | English |
| Publisher Date | 2001-01-01 |
| Publisher Institution | IJCAI-2001 Workshop on Inconsistency in Data and Knowledge |
| Access Restriction | Open |
| Subject Keyword | Incremental Approximation Approximate Reasoning Useful Heuristic Tableau Calculus Clausal Form Incremental Method Latter Logic Approximate Entailment Classical Logic Tableau System Tableau Proof System Next One Classical Theorem Full Classical Propositional Logic Formal Semantics |
| Content Type | Text |
| Resource Type | Article |
