Clausal resolution in a logic of rational agency

Authors:
Clare Dixon;Michael Fisher;Alexander Bolotov
Affiliations:
Department of Computer Science, University of Liverpool, Liverpool, UK;Department of Computer Science, University of Liverpool, Liverpool, UK;Harrow School of Computer Science, University of Westminster, Harrow, UK
Venue:
Artificial Intelligence
Year:
2002

Citing 29
Cited 5

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
The complexity of reasoning about knowledge and time

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Modal theorem proving

Proc. of the 8th international conference on Automated deduction
Temporal-logic theorem proving

Temporal-logic theorem proving
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
Modal resolution in clausal form

Theoretical Computer Science
Gentzen-type systems and resolution rules. Part I. Propositional logic

COLOG-88 Proceedings of the international conference on Computer logic
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Reasoning about knowledge

Reasoning about knowledge
Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
Combinations of Modal Logics

Artificial Intelligence Review
Temporal resolution using a breadth-first search

Annals of Mathematics and Artificial Intelligence
A Decision Procedure for a Temporal Belief Logic

ICTL '94 Proceedings of the First International Conference on Temporal Logic
Normal Forms and Proofs in Combined Modal and Temporal Logics

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
A Decision Method for Temporal Logic Based on Resolution

Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
The FaCT System

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
A Decision Method for Linear Temporal Logic

Proceedings of the 7th International Conference on Automated Deduction
A Resolution Calculus for Modal Logics

Proceedings of the 9th International Conference on Automated Deduction
Resolution-Based Calculi for Modal and Temporal Logics

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Tableaux for Temporal Description Logic with Constant Domains

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Search Strategies for Resolution in Temporal Logics

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A resolution method for CTL branching-time temporal logic

TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
Resolution-Based Proof for Multi-Modal Temporal Logics of Knowledge

TIME '00 Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'00)
Resolution for Branching Time Temporal Logics: Applying the Temporal Resolution Rule

TIME '00 Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'00)
Reasoning about Agents in the KARO Framework

TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Implementing BDI-like systems by direct execution

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Towards formal methods for agent-based systems

1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods

Temporal Development Methods for Agent-Based

Autonomous Agents and Multi-Agent Systems
Clausal resolution for normal modal logics

Journal of Algorithms
CTL-RP: A computation tree logic resolution prover

AI Communications - Practical Aspects of Automated Reasoning
A multi-agent framework based on communication and concurrency

IWDC'04 Proceedings of the 6th international conference on Distributed Computing
A resolution calculus for the branching-time temporal logic CTL

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A resolution based proof system for a Temporal Logic of Possible Belief is presented. This logic is the combination of the branching-time temporal logic CTL (representing change over time) with the modal logic KD45 (representing belief). Such combinations of temporal or dynamic logics and modal logics are useful for specifying complex properties of multi-agent systems. Proof methods are important for developing verification techniques for these complex multi-modal logics. Soundness, completeness and termination of the proof method are shown and simple examples illustrating its use are given.