Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
RESOLUTION FOR SYNCHRONY AND NO LEARNING C. NALON, C. DIXON, AND M. FISHER
 

Summary: RESOLUTION FOR SYNCHRONY AND NO LEARNING
C. NALON, C. DIXON, AND M. FISHER
ABSTRACT. We present a clausal resolution­based method for temporal logics of knowledge with
synchrony and no learning. This and related logics admit axioms which include operators from
both the temporal and epistemic logics, which enable the description of how knowledge evolves
over time. Instead of proposing new resolution rules, further information is added to the set of
clauses in order to deal with this particular interaction. We give outline of the proofs of soundness,
termination, and completeness.
1. INTRODUCTION
Logics have been used in Computer Science for many years as a natural way for describing
properties of complex systems. More recently, there has been an increasing interest in combined
modal logics, as different logical languages are more suitable to specify different properties within
a system. Typical examples are the specification and verification of distributed systems [5] and the
specification of agent­based systems [11, 12]. Given such logical characterisation of a system, it
is then desirable to have the appropriate tools in order to verify whether a particular property holds
for this system. By verifying that a property holds, we mean to prove that the property is a logical
consequence of the specification.
There is a wide range of logics that could be chosen in order to model and characterise such
complex systems. Moreover, there is a variety of ways of combining the chosen logics. In the
following, we concentrate on a particular combination that has been proved useful in modelling

  

Source: Ayala-Rincón, Mauricio - Departamento de Matemática, Universidade de Brasília

 

Collections: Mathematics