Display Calculi for Logics with Relative Accessibility Relations

Authors:
Stéphane Demri;Rajeev Goré
Affiliations:
Laboratoire LEIBNIZ – C.N.R.S., 46 Avenue Félix Viallet, 38031 Grenoble, France (E-mail: demri@imag.fr);Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra ACT 0200, Australia (E-mail: rpg@arp.anu.edu.au)
Venue:
Journal of Logic, Language and Information
Year:
2000

Citing 10
Cited 1

DAL—a logic for data analysis

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

COLOG-88 Proceedings of the international conference on Computer logic
An essay in combinatory dynamic logic

Information and Computation
Modal logics for knowledge representation systems

Theoretical Computer Science
Reasoning about knowledge

Reasoning about knowledge
A class of decidable information logics

MFCS '96 Selected papers from the 21st symposium on Mathematical foundations of computer science
Displaying modal logic

Displaying modal logic
A Logic with Relative Knowledge Operators

Journal of Logic, Language and Information
Relational proof systems for some AI logics

FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Cut-free Display Calculi for Relation Algebras

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic

Logics from Galois connections

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define cut-free display calculi for knowledge logics wherean indiscernibility relation is associated to each set of agents, andwhere agents decide the membership of objects using thisindiscernibility relation. To do so, we first translate the knowledgelogics into polymodal logics axiomatised by primitive axioms and thenuse Kracht's results on properly displayable logics to define thedisplay calculi. Apart from these technical results, we argue thatDisplay Logic is a natural framework to define cut-free calculi for manyother logics with relative accessibility relations.