A Logic with Relative Knowledge Operators

Authors:
Stéphane Demri
Affiliations:
Laboratoire Leibniz – C.N.R.S., 46 Avenue Félix Viallet, 38031 Grenoble, France (E-mail: demri@imag.fr
Venue:
Journal of Logic, Language and Information
Year:
1999

Citing 4
Cited 4

A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
Modal logics for knowledge representation systems

Theoretical Computer Science
A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Reasoning about knowledge

Reasoning about knowledge

Display Calculi for Logics with Relative Accessibility Relations

Journal of Logic, Language and Information
Relative Similarity Logics are Decidable: Reduction to FO2 with Equality

JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Automata-Theoretic Decision Procedures for Information Logics

Fundamenta Informaticae
Automata-Theoretic Decision Procedures for Information Logics

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a knowledge logic that assumesthat to each set of agents, an indiscernibility relation is associated and theagents decide the membership of objects or states up to this indiscernibilityrelation. Its language contains a family of relative knowledge operators.We prove the decidability of the satisfiability problem,we show its EXPTIME-completeness and as a side-effect, we define a complete Hilbert-style axiomatization.