• Corpus ID: 7420390

A Composable Language for Action Models

@inproceedings{French2014ACL,
  title={A Composable Language for Action Models},
  author={Tim French and James Hales and Edwin Tay},
  booktitle={Advances in Modal Logic},
  year={2014}
}
Action models are semantic structures similar to Kripke models that represent a change in knowledge in an epistemic setting. Whereas the language of action model logic [8,7] embeds the semantic structure of an action model directly within the language, this paper introduces a language that represents action models using syntactic operators inspired by relational actions [11,12,13]. This language admits an intuitive description of the action models it represents, and we show in several settings… 

Representing and Reasoning with Event Models for Epistemic Planning

This work combines the representation of event models with a description language for finitary initial epistemic theories, and shows how this allows us to reason about the effects of a sequence of actions in a multi-agent epistemic domain by updating a single multi-pointed epistemic model.

Copy and remove as dynamic operators

In this article, we present a modal logic that extends the basic modal logic with two dynamic operators: copy ( ), which replicates the current model, labelling each copy with a different

Arrow Update Synthesis

Relation-changing modal operators

The basic modal language is extended with modalities that are able to delete, add or swap an edge between pairs of elements of the domain and a generic framework is defined to characterize this kind of operations.

Logics of knowledge and action: critical analysis and challenges

  • A. Herzig
  • Computer Science, Philosophy
    Autonomous Agents and Multi-Agent Systems
  • 2014
The most prominent logics of knowledge and action that were proposed and studied in the multiagent systems literature are overviewed and a distinction between individual knowledge and group knowledge is introduced, and between a nonstrategic an a strategic interpretation of action operators are introduced.

Announcements to Attentive Agents

This work proposes a version of public announcement logic wherein it is encoded in the states of the epistemic model which agents pay attention to the announcement, and gives an axiomatization of the logic and proves that complexity of satisfiability is the same as that of public announcements logic, and therefore lower than that of action model logic.

Dynamic epistemic logics: promises, problems, shortcomings, and perspectives

  • A. Herzig
  • Philosophy
    J. Appl. Non Class. Logics
  • 2017
The present paper briefly summarises the existing body of literature on dynamic epistemic logics, discusses some problems and shortcomings, and proposes some avenues for future research.

Private Announcements on Topological Spaces

A complete axiomatization of the logic of knowledge and change of knowledge interpreted on topological structures is provided, and two detailed examples of situations with agents learning information through semi-private announcements are given.

Questions in logic

This dissertation pursues two tightly interwoven goals: to bring out the relevance of questions for the field of logic, and to establish a solid theory of the logic of questions within a classical

Quantifying over epistemic updates

Logics for quantifying over very general forms of epistemic updates are considered: arbitrary action model logic, which quantifies over action models; and refinement modal logic, whose results have a partial correspondence with the results of action models, but are more general.

References

SHOWING 1-10 OF 24 REFERENCES

Logics for Epistemic Programs

The construction of logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting by defining a notion of epistemic program, which is a Kripke model of ‘actions’, representing the agents' uncertainty about the current action in a similar way that Kripkel models are commonly used in epistemic logic.

Refinement Quantified Logics of Knowledge and Belief for Multiple Agentsc

A sound and complete axiomatisation for the refinement modal logic over the class of unrestricted Kripke models, for a single agent and a provably correct translations to their underlying modal logics, corollaries of which are expressivity and decidability results.

Descriptions of Game Actions

An epistemic language with dynamic operators for actions to describe simultaneous knowledge updates for different subgroups and two crucial action constructors are learning and local choice is proposed.

Future Event Logic - Axioms and Complexity

This paper presents a sound and complete axiomatization of future event logic, a logic that generalizes a number of dynamic epistemic logics, by using a new operator that acts as a quantifier over the set of all refinements of a given model.

Refinement modal logic

Simulation and Information: Quantifying over Epistemic Events

A multi-agent logic of knowledge with time where F? stands for "there is an informative event after which ?" and the former provides a correspondence with bisimulation quantifiers in a setting with epistemic operators.

Refinement Quantified Logics of Knowledge

Dynamic epistemic logic

A semantics and a deduction system for a multi-agent modal language extended with a repertoire of programs that describe information change, designed in such a way that everything that is expressible in the object language can be known or learned by each of the agents.

Refinement Quantifiers for Logics of Belief and Knowledge

Modal logics are extensions of propositional logic, with which one can qualify the truth of statements with operators known as modalities. Epistemic logic is a variant of modal logic, commonly known

Undecidability in Epistemic Planning

It is shown that multi-agent planning is robustly undecidable if the authors assume that agents can reason with an arbitrary nesting of beliefs about beliefs, and a corollary showing undecidability of the DEL model checking problem with the star operator on actions (iteration).