Skip to main navigation Skip to search Skip to main content

A resolution-based proof method for temporal logics of knowledge and belief

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

Abstract

In this paper we define two logics, KLn and BLn, and present resolution-based proof methods for both. KLn is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BLn is somewhat similar: it is a temporal logic that contains connectives for representing the beliefs of agents. The proof methods we present for these logics involve two key steps. First, a formula to be tested for unsatisfiability is translated into a normal form. Secondly, a family of resolution rules are used, to deal with the interactions between the various operators of the logics. In addition to a description of the normal form and the proof methods, we present some short worked examples and proposals for future work.
Original languageEnglish
Title of host publicationPractical Reasoning
Subtitle of host publicationInternational Conference on Formal and Applied Practical Reasoning, FAPR'96 Bonn, Germany, June 3–7, 1996 Proceedings
PublisherSpringer Nature
Pages178-192
Number of pages15
ISBN (Electronic)978-3-540-68454-1
ISBN (Print)978-3-540-61313-8
DOIs
Publication statusPublished - 1996
EventFAPR: International Conference on Formal and Applied Practical Reasoning - Bonn, Germany
Duration: 3 Jun 19967 Jun 1996

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume1085

Conference

ConferenceFAPR
Country/TerritoryGermany
CityBonn
Period3/06/967/06/96

Fingerprint

Dive into the research topics of 'A resolution-based proof method for temporal logics of knowledge and belief'. Together they form a unique fingerprint.

Cite this