|
|||||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||||
ABSTRACT
In this paper, we present sound and complete deduction systems for propositional BDI logics by using Gentzen's sequent calculus. In these systems, we can construct the proof of a formula by using an extension of Wang's algorithm. Therefore, these systems are suitable for applications such as automatic proving and specification checking in BDI logics. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
Additional Classification:
General Terms:
Keywords:
|
|||||||||||||||||||||||||||||||||||||