Search Results for author: Andreas Herzig

Found 6 papers, 0 papers with code

Solving Gossip Problems using Answer Set Programming: An Epistemic Planning Approach

no code implementations22 Sep 2020 Esra Erdem, Andreas Herzig

We investigate the use of Answer Set Programming to solve variations of gossip problems, by modeling them as epistemic planning problems.

Refining HTN Methods via Task Insertion with Preferences

no code implementations29 Nov 2019 Zhanhao Xiao, Hai Wan, Hankui Hankz Zhuo, Andreas Herzig, Laurent Perrussel, Peilin Chen

Hierarchical Task Network (HTN) planning is showing its power in real-world planning.

Relaxing Exclusive Control in Boolean Games

no code implementations27 Jul 2017 Francesco Belardinelli, Umberto Grandi, Andreas Herzig, Dominique Longin, Emiliano Lorini, Arianna Novaro, Laurent Perrussel

We introduce Concurrent Game Structures with Shared Propositional Control (CGS-SPC) and show that they ac- count for several classes of repeated games, including iterated boolean games, influence games, and aggregation games.

Strategically knowing how

no code implementations15 May 2017 Raul Fervari, Andreas Herzig, Yanjun Li, Yanjing Wang

In this paper, we propose a single-agent logic of goal-directed knowing how extending the standard epistemic logic of knowing that with a new knowing how operator.

Simple epistemic planning: generalised gossiping

no code implementations10 Jun 2016 Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, Pierre Régnier

The gossip problem, in which information (known as secrets) must be shared among a certain number of agents using the minimum number of calls, is of interest in the conception of communication networks and protocols.

Tableaux for Dynamic Logic of Propositional Assignments

no code implementations9 Jun 2014 Tiago de Lima, Andreas Herzig

The Dynamic Logic for Propositional Assignments (DL-PA) has recently been studied as an alternative to Propositional Dynamic Logic (PDL).

Cannot find the paper you are looking for? You can Submit a new open access paper.