24,714 research outputs found
Changing Observations in Epistemic Temporal Logic
We study dynamic changes of agents' observational power in logics of
knowledge and time. We consider CTL*K, the extension of CTL* with knowledge
operators, and enrich it with a new operator that models a change in an agent's
way of observing the system. We extend the classic semantics of knowledge for
perfect-recall agents to account for changes of observation, and we show that
this new operator strictly increases the expressivity of CTL*K. We reduce the
model-checking problem for our logic to that for CTL*K, which is known to be
decidable. This provides a solution to the model-checking problem for our
logic, but its complexity is not optimal. Indeed we provide a direct decision
procedure with better complexity
Hidden protocols: Modifying our expectations in an evolving world
When agents know a protocol, this leads them to have expectations about future observations. Agents can update their knowledge by matching their actual observations with the expected ones. They eliminate states where they do not match. In this paper, we study how agents perceive protocols that are not commonly known, and propose a semantics-driven logical framework to reason about knowledge in such scenarios. In particular, we introduce the notion of epistemic expectation models and a propositional dynamic logic-style epistemic logic for reasoning about knowledge via matching agentsÊ expectations to their observations. It is shown how epistemic expectation models can be obtained from epistemic protocols. Furthermore, a characterization is presented of the effective equivalence of epistemic protocols. We introduce a new logic that incorporates updates of protocols and that can model reasoning about knowledge and observations. Finally, the framework is extended to incorporate fact-changing actions, and a worked-out example is given. © 2013 Elsevier B.V
Reasoning about Knowledge and Strategies under Hierarchical Information
Two distinct semantics have been considered for knowledge in the context of
strategic reasoning, depending on whether players know each other's strategy or
not. The problem of distributed synthesis for epistemic temporal specifications
is known to be undecidable for the latter semantics, already on systems with
hierarchical information. However, for the other, uninformed semantics, the
problem is decidable on such systems. In this work we generalise this result by
introducing an epistemic extension of Strategy Logic with imperfect
information. The semantics of knowledge operators is uninformed, and captures
agents that can change observation power when they change strategies. We solve
the model-checking problem on a class of "hierarchical instances", which
provides a solution to a vast class of strategic problems with epistemic
temporal specifications on hierarchical systems, such as distributed synthesis
or rational synthesis
A Temporal Logic for Hyperproperties
Hyperproperties, as introduced by Clarkson and Schneider, characterize the
correctness of a computer program as a condition on its set of computation
paths. Standard temporal logics can only refer to a single path at a time, and
therefore cannot express many hyperproperties of interest, including
noninterference and other important properties in security and coding theory.
In this paper, we investigate an extension of temporal logic with explicit path
variables. We show that the quantification over paths naturally subsumes other
extensions of temporal logic with operators for information flow and knowledge.
The model checking problem for temporal logic with path quantification is
decidable. For alternation depth 1, the complexity is PSPACE in the length of
the formula and NLOGSPACE in the size of the system, as for linear-time
temporal logic
Belief Revision in Science: Informational Economy and Paraconsistency
In the present paper, our objective is to examine the application of belief revision models to scientific rationality. We begin by considering the standard model AGM, and along the way a number of problems surface that make it seem inadequate for this specific application. After considering three different heuristics of informational economy that seem fit for science, we consider some possible adaptations for it and argue informally that, overall, some paraconsistent models seem to better satisfy these principles, following Testa (2015). These models have been worked out in formal detail by Testa, Cogniglio, & Ribeiro (2015, 2017)
- …