67 research outputs found
A Closeness- and Priority-Based Logical Study of Social Network Creation
This paper is part of an on-going programme on the study of the logical aspects of social network formation. It recalls the so-called social network model, discussing the properties of a notion of closeness between agents (in terms of the number of traits they have in common); then introduces an extended social network model in which different agents might assign different values to different traits, discussing the properties of the notion of weighted closeness that arises. These notions are used to define social network creation operations by means of a threshold strategy. The paper studies the properties of the social networks the updates create, providing sound and complete axiom systems for formal languages describing these updatesâ effects.publishedVersio
On the Impact of Modal Depth in Epistemic Planning (Extended Version)
Epistemic planning is a variant of automated planning in the framework of dynamic epistemic logic. In recent works, the epistemic planning problem has been proved to be undecidable when preconditions of events can be epistemic formulas of arbitrary complexity , and in particular arbitrary modal depth. It is known however that when preconditions are propositional (and there are no postconditions), the problem is between Pspace and Expspace. In this work we bring two new pieces to the picture. First, we prove that the epistemic planning problem with propositional preconditions and without postconditions is in Pspace, and is thus Pspace-complete. Second, we prove that very simple epistemic preconditions are enough to make the epistemic planning problem undecidable: preconditions of modal depth at most two suffice
Planning Over Multi-Agent Epistemic States: A Classical Planning Approach
Many AI applications involve the interaction of multiple autonomous agents, requiring those agents to reason about their own beliefs, as well as those of other agents. However, planning involving nested beliefs is known to be computationally challenging. In this work, we address the task of synthesizing plans that necessitate reasoning about the beliefs of other agents. We plan from the perspective of a single agent with the potential for goals and actions that involve nested beliefs, non-homogeneous agents, co-present observations, and the ability for one agent to reason as if it were another. We formally characterize our notion of planning with nested belief, and subsequently demonstrate how to automatically convert such problems into problems that appeal to classical planning technology. Our approach represents an important first step towards applying the well-established field of automated planning to the challenging task of planning involving nested beliefs of multiple agents
A Semantic Approach to Decidability in Epistemic Planning (Extended Version)
The use of Dynamic Epistemic Logic (DEL) in multi-agent planning has led to a
widely adopted action formalism that can handle nondeterminism, partial
observability and arbitrary knowledge nesting. As such expressive power comes
at the cost of undecidability, several decidable fragments have been isolated,
mainly based on syntactic restrictions of the action formalism. In this paper,
we pursue a novel semantic approach to achieve decidability. Namely, rather
than imposing syntactical constraints, the semantic approach focuses on the
axioms of the logic for epistemic planning. Specifically, we augment the logic
of knowledge S5 and with an interaction axiom called (knowledge)
commutativity, which controls the ability of agents to unboundedly reason on
the knowledge of other agents. We then provide a threefold contribution. First,
we show that the resulting epistemic planning problem is decidable. In doing
so, we prove that our framework admits a finitary non-fixpoint characterization
of common knowledge, which is of independent interest. Second, we study
different generalizations of the commutativity axiom, with the goal of
obtaining decidability for more expressive fragments of DEL. Finally, we show
that two well-known epistemic planning systems based on action templates, when
interpreted under the setting of knowledge, conform to the commutativity axiom,
hence proving their decidability
Coalition logic with individual, distributed and common knowledge
Coalition logic is currently one of the most popular logics for multi-agent systems. While logics combining coalitional and epistemic operators have received considerable attention, completeness results for epistemic extensions of coalition logic have so far been missing. In this paper we provide several such results and proofs.We prove completeness for epistemic coalition logic with common knowledge, with distributed knowledge, and with both common and distributed knowledge, respectively. Furthermore, we completely characterise the complexity of the satisfiability problem for each of the three logics. We also study logics with interaction axioms connecting coalitional ability and knowledge
Efficient Multi-agent Epistemic Planning: Teaching Planners About Nested Belief
Many AI applications involve the interaction of multiple autonomous agents, requiring those agents to reason about their own beliefs, as well as those of other agents. However, planning involving nested beliefs is known to be computationally challenging. In this work, we address the task of synthesizing plans that necessitate reasoning about the beliefs of other agents. We plan from the perspective of a single agent with the potential for goals and actions that involve nested beliefs, non-homogeneous agents, co-present observations, and the ability for one agent to reason as if it were another. We formally characterize our notion of planning with nested belief, and subsequently demonstrate how to automatically convert such problems into problems that appeal to classical planning technology for solving efficiently. Our approach represents an important step towards applying the well-established field of automated planning to the challenging task of planning involving nested beliefs of multiple agents
- âŠ