Results 51 to 60 of about 25,998 (197)

Explicit Evidence Systems with Common Knowledge

, 2010
Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge.
Alberucci L., Antonakos E., Artemov S. N., Artemov S. N., Artemov S. N., Artemov S. N., Artemov S. N., Blass A., Brünnler K., Brünnler K., Bucheli S., Bucheli S., Fagin R., Fitting M., Fitting M., Jäger G., Kuznets R., McCarthy J., Mkrtychev A., Nonaka I., Plaza J., Renne B., Renne B., Roman Kuznets, Samuel Bucheli, Thomas Studer, Yavorskaya (Sidon) T.   +26 more
core   +5 more sources

Refinement Modal Logic

, 2013
In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied.
Aczel, Alur, Alur, Antonik, Arnold, Aucher, Aucher, Balbiani, Baltag, Bilkova, Blackburn, Bozzelli, Browne, Clarke, d'Agostino, d'Agostino, d'Agostino, Economou, Fagin, Feuillade, Fine, French, French, Gerbrandy, Hales, Hales, Hales, Hales, Hans van Ditmarsch, Harel, James Hales, Janin, Janin, Kooi, Kupferman, Kupke, Küsters, Larsen, Laura Bozzelli, Lomuscio, Mazala, Miller, Morgan, Parikh, Pauly, Plaza, Raclet, Raclet, Raclet, Ramadge, Riedweg, Ryan, Sistla, Sophie Pinchinat, Tim French, Tsitsoklis, van Benthem, van Benthem, van Ditmarsch, van Ditmarsch, van Ditmarsch, van Ditmarsch, Walukiewicz, Wen, Wilke, Woodcock   +65 more
core   +3 more sources

Relation-changing modal operators [PDF]

, 2015
We study dynamic modal operators that can change the accessibility relation of a model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to delete, add or swap an edge between pairs of ...
Areces, Carlos Eduardo, Fervari, Raul Alberto, Hoffmann, Guillaume Emmanuel   +2 more
core   +2 more sources

Epistemic Quantified Boolean Logic: Expressiveness and Completeness Results [PDF]

, 2015
We introduce epistemic quantified boolean logic (EQBL), an extension of propositional epistemic logic with quantification over propositions. We show that EQBL can express relevant properties about agents’ knowledge in multi-agent contexts, such as “agent

core   +2 more sources

REASONING ABOUT THE GAME „CLUE“ BY USING OTTER

Journal of Information and Organizational Sciences, 2006
In this article the possibilities of reasoning about the card version of the game Clue by using OTTER - system for automatic theorem proving have been presented.
Marko Maliković
doaj  

The theorem on ontological randomness of possible worlds: in defence of relativism towards possible worlds ontology

Cхід, 2014
The article deals with the ontology of the possible worlds in possible world semantics. Possible worlds are considered from instrumentalist point of view (according to which we have no need in regulating of the relation of possible world to actual world
Mstislav Kazakov
doaj   +1 more source

Epistemic Equilibrium Logic [PDF]

, 2015
International audienceWe add epistemic modal operators to the language of here-and-there logic and define epistemic here-and-there models.We then successively define epistemic equilibrium models and autoepistemic equilibrium models.
Fariñas del Cerro, Luis, Herzig, Andreas, Su, Ezgi Iraz   +2 more
core   +1 more source

A Characterization Theorem for a Modal Description Logic

, 2017
Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents.
Schröder, Lutz, Wild, Paul
core   +1 more source

Offline and online data: on upgrading functional information to knowledge [PDF]

, 2012
This paper addresses the problem of upgrading functional information to knowledge. Functional information is defined as syntactically well-formed, meaningful and collectively opaque data.
Primiero, Giuseppe
core   +2 more sources

Knowability as Continuity: A Topological Account of Informational Dependence

Logics
We study knowable informational dependence between empirical questions, modeled as continuous functional dependence between variables in a topological setting. We also investigate epistemic independence in topological terms and show that it is compatible
Alexandru Baltag, Johan van Benthem
doaj   +1 more source