Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Formalising abilities and opportunities of agents
Fundamenta Informaticae
ACM Transactions on Computational Logic (TOCL)
Resolution Methods for the Decision Problem
Resolution Methods for the Decision Problem
Decidability by Resolution for Propositional Modal Logics
Journal of Automated Reasoning
Using Resolution for Testing Modal Satisfiability and Building Models
Journal of Automated Reasoning
Gentzen-type systems and resolution rules. Part I. Propositional logic
COLOG '88 Proceedings of the International Conference on Computer Logic
Normal Forms and Proofs in Combined Modal and Temporal Logics
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Combining Hilbert Style and Semantic Reasoning in a Resolution Framework
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Dynamic logic for reasoning about actions and agents
Logic-based artificial intelligence
Theories of intentions in the framework of situation calculus
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
Hi-index | 0.00 |
This paper discusses automated reasoning in the KARO framework. The KARO framework accommodates a range of expressive modal logics for describing the behaviour of intelligent agents. We concentrate on a core logic within this framework, in particular, we describe two new methods for providing proof methods for this core logic, discuss some of the problems we have encountered in their design, and present an extended example of the use of the KARO framework and the two proof methods.