24,626 research outputs found
A Gentle Introduction to Epistemic Planning: The DEL Approach
Epistemic planning can be used for decision making in multi-agent situations
with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has
been shown to provide a very natural and expressive framework for epistemic
planning. In this paper, we aim to give an accessible introduction to DEL-based
epistemic planning. The paper starts with the most classical framework for
planning, STRIPS, and then moves towards epistemic planning in a number of
smaller steps, where each step is motivated by the need to be able to model
more complex planning scenarios.Comment: In Proceedings M4M9 2017, arXiv:1703.0173
A Logic for Reasoning about Group Norms
We present a number of modal logics to reason about group norms. As a preliminary
step, we discuss the ontological status of the group to which the norms are
applied, by adapting the classification made by Christian List of collective attitudes
into aggregated, common, and corporate attitudes. Accordingly, we shall introduce
modality to capture aggregated, common, and corporate group norms. We investigate
then the principles for reasoning about those types of modalities. Finally, we discuss
the relationship between group norms and types of collective responsibility
Refinement Modal Logic
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. Our logic contains a new operator 'all' in
addition to the standard modalities 'box' for each agent. The operator 'all'
acts as a quantifier over the set of all refinements of a given model. As a
variation on a bisimulation quantifier, this refinement operator or refinement
quantifier 'all' can be seen as quantifying over a variable not occurring in
the formula bound by it. The logic combines the simplicity of multi-agent modal
logic with some powers of monadic second-order quantification. We present a
sound and complete axiomatization of multi-agent refinement modal logic. We
also present an extension of the logic to the modal mu-calculus, and an
axiomatization for the single-agent version of this logic. Examples and
applications are also discussed: to software verification and design (the set
of agents can also be seen as a set of actions), and to dynamic epistemic
logic. We further give detailed results on the complexity of satisfiability,
and on succinctness
NEXP-completeness and Universal Hardness Results for Justification Logic
We provide a lower complexity bound for the satisfiability problem of a
multi-agent justification logic, establishing that the general NEXP upper bound
from our previous work is tight. We then use a simple modification of the
corresponding reduction to prove that satisfiability for all multi-agent
justification logics from there is hard for the Sigma 2 p class of the second
level of the polynomial hierarchy - given certain reasonable conditions. Our
methods improve on these required conditions for the same lower bound for the
single-agent justification logics, proven by Buss and Kuznets in 2009, thus
answering one of their open questions.Comment: Shorter version has been accepted for publication by CSR 201
Learning Action Models: Qualitative Approach
In dynamic epistemic logic, actions are described using action models. In
this paper we introduce a framework for studying learnability of action models
from observations. We present first results concerning propositional action
models. First we check two basic learnability criteria: finite identifiability
(conclusively inferring the appropriate action model in finite time) and
identifiability in the limit (inconclusive convergence to the right action
model). We show that deterministic actions are finitely identifiable, while
non-deterministic actions require more learning power-they are identifiable in
the limit. We then move on to a particular learning method, which proceeds via
restriction of a space of events within a learning-specific action model. This
way of learning closely resembles the well-known update method from dynamic
epistemic logic. We introduce several different learning methods suited for
finite identifiability of particular types of deterministic actions.Comment: 18 pages, accepted for LORI-V: The Fifth International Conference on
Logic, Rationality and Interaction, October 28-31, 2015, National Taiwan
University, Taipei, Taiwa
Comparing BDD and SAT based techniques for model checking Chaum's Dining Cryptographers Protocol
We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of a network of communicating automata and verify that the protocol meets the anonymity requirements specified. Two different model checking techniques (ordered binary decision diagrams and SAT-based bounded model checking) are evaluated and compared to verify the protocols
Multi-Agent Only-Knowing Revisited
Levesque introduced the notion of only-knowing to precisely capture the
beliefs of a knowledge base. He also showed how only-knowing can be used to
formalize non-monotonic behavior within a monotonic logic. Despite its appeal,
all attempts to extend only-knowing to the many agent case have undesirable
properties. A belief model by Halpern and Lakemeyer, for instance, appeals to
proof-theoretic constructs in the semantics and needs to axiomatize validity as
part of the logic. It is also not clear how to generalize their ideas to a
first-order case. In this paper, we propose a new account of multi-agent
only-knowing which, for the first time, has a natural possible-world semantics
for a quantified language with equality. We then provide, for the propositional
fragment, a sound and complete axiomatization that faithfully lifts Levesque's
proof theory to the many agent case. We also discuss comparisons to the earlier
approach by Halpern and Lakemeyer.Comment: Appears in Principles of Knowledge Representation and Reasoning 201
- …