Title of article :
Clausal resolution in a logic of rational agency Original Research Article
Author/Authors :
Clare Dixon، نويسنده , , Michael Fisher، نويسنده , , Alexander Bolotov، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
43
From page :
47
To page :
89
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.
Keywords :
automated deduction , Resolution , Temporal logics , Modal logics , Verification , Rational agents
Journal title :
Artificial Intelligence
Serial Year :
2002
Journal title :
Artificial Intelligence
Record number :
1207146
Link To Document :
بازگشت