Abstract
The Local Computation Framework has been used to improve the efficiency of computation in various uncertainty formalisms. This paper shows how the framework can be used for the computation of logical deduction in two different ways; the first way involves embedding model structures in the framework; the second, and more direct, way involves embedding sets of formulae. This work can be applied to many of the logics developed for different kinds of reasoning, including predicate calculus, modal logics, possibilistic logics, probabilistic logics and non-monotonic logics.
| Original language | English |
|---|---|
| Pages (from-to) | 239-267 |
| Number of pages | 29 |
| Journal | Journal of Applied Non-Classical Logics |
| Volume | 11 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - 2001 |
| Externally published | Yes |
Keywords
- Circumscription
- Deduction
- Local Computation
- Modal and Conditional Logics
- Possibilistic Logic
- Theorem Proving