English
Related papers

Related papers: Tableaux for the Logic of Strategically Knowing Ho…

200 papers

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. The semantics of the new operator is based on the idea that knowing how to…

Artificial Intelligence · Computer Science 2017-05-16 Raul Fervari , Andreas Herzig , Yanjun Li , Yanjing Wang

Various planning-based know-how logics have been studied in the recent literature. In this paper, we use such a logic to do know-how-based planning via model checking. In particular, we can handle the higher-order epistemic planning…

Artificial Intelligence · Computer Science 2021-06-23 Yanjun Li , Yanjing Wang

In this paper, we propose a single-agent modal logic framework for reasoning about goal-direct "knowing how" based on ideas from linguistics, philosophy, modal logic and automated planning. We first define a modal language to express "I…

Artificial Intelligence · Computer Science 2015-07-10 Yanjing Wang

We develop an incremental-tableau-based decision procedure for the multi-agent epistemic logic MAEL(CD) (aka S5_n (CD)), whose language contains operators of individual knowledge for a finite set Ag of agents, as well as operators of…

Logic in Computer Science · Computer Science 2016-11-17 Valentin Goranko , Dmitry Shkatov

This paper presents an extension of temporal epistemic logic with operators that quantify over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitly encode…

Logic in Computer Science · Computer Science 2018-07-13 Xiaowei Huang , Ron van der Meyden

The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by…

Logic in Computer Science · Computer Science 2014-04-04 Xiaowei Huang , Ron van der Meyden

We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi-agent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents…

Logic in Computer Science · Computer Science 2016-11-27 Mai Ajspur , Valentin Goranko , Dmitry Shkatov

We introduce a new semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in…

Logic in Computer Science · Computer Science 2021-06-23 Carlos Areces , Raul Fervari , Andrés R. Saravia , Fernando R. Velázquez-Quesada

We study the multiagent epistemic logic CMAELCD with operators for common and distributed knowledge for all coalitions of agents. We introduce Hintikka structures for this logic and prove that satisfiability in such structures is equivalent…

Logic in Computer Science · Computer Science 2009-02-13 Valentin Goranko , Dmitry Shkatov

We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics based on linear plans. Our main result shows that satisfiability…

Logic in Computer Science · Computer Science 2026-05-20 Carlos Areces , Pablo Barceló , Valentin Cassano , Pablo F. Castro , Stéphane Demri , Raul Fervari

We introduce a novel semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in…

Logic in Computer Science · Computer Science 2023-04-04 Carlos Areces , Raul Fervari , Andrés R. Saravia , Fernando R. Velázquez-Quesada

Epistemic logic is known as a logic that captures the knowledge and beliefs of agents and has undergone various developments since Hintikka (1962). In this paper, we propose a new logic called agent-knowledge logic by taking the product of…

Logic · Mathematics 2025-01-03 Yuki Nishimura

Standard epistemic logic studies propositional knowledge, yet many other types of knowledge such as "knowing whether", "knowing what", "knowing how" are frequently and widely used in everyday life as well as academic fields. In…

Logic in Computer Science · Computer Science 2016-11-28 Yifeng Ding

The existence of a coalition strategy to achieve a goal does not necessarily mean that the coalition has enough information to know how to follow the strategy. Neither does it mean that the coalition knows that such a strategy exists. The…

Artificial Intelligence · Computer Science 2017-06-19 Pavel Naumov , Jia Tao

The existence of a coalition strategy to achieve a goal does not necessarily mean that the coalition has enough information to know how to follow the strategy. Neither does it mean that the coalition knows that such a strategy exists. The…

Artificial Intelligence · Computer Science 2017-07-28 Pavel Naumov , Jia Tao

As the interest in Artificial Intelligence continues to grow it is becoming more and more important to investigate formalization and tools that allow us to exploit logic to reason about the world. In particular, given the increasing number…

Artificial Intelligence · Computer Science 2019-09-19 Francesco Fabiano

We develop an incremental tableau-based decision procedures for the Alternating-time temporal logic ATL and some of its variants. While running within the theoretically established complexity upper bound, we claim that our tableau is…

Logic in Computer Science · Computer Science 2008-09-09 Valentin Goranko , Dmitry Shkatov

There has been considerable work on reasoning about the strategic ability of agents under imperfect information. However, existing logics such as Probabilistic Strategy Logic are unable to express properties relating to information…

Artificial Intelligence · Computer Science 2025-01-07 Chunyan Mu , Nima Motamed , Natasha Alechina , Brian Logan

We propose a multi-agent epistemic logic capturing reasoning with degrees of plausibility that agents can assign to a given statement, with $1$ interpreted as "entirely plausible for the agent" and $0$ as "completely implausible" (i.e., the…

Logic · Mathematics 2025-12-18 Marta Bílková , Thomas Ferguson , Daniil Kozhemiachenko

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…

Logic in Computer Science · Computer Science 2018-09-05 Bastien Maubert , Aniello Murano
‹ Prev 1 2 3 10 Next ›