Abstract
This paper gives an overview of two methods for automatically or semi-automatically generating deduction calculi from the semantic specification of a logic. One approach is based on simulating deduction approaches with techniques of automated reasoning and first-order resolution. The second approach synthesises sound, complete and terminating tableau calculi directly from the semantic specification of a logic. © 2010 Elsevier B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 221-229 |
Number of pages | 8 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 262 |
DOIs | |
Publication status | Published - May 2010 |
Keywords
- Decidability
- Deduction calculus synthesis
- Non-classical logic
- Resolution
- Tableaux