425,415 research outputs found
A Logic of Knowing How
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 know how to guarantee phi given psi" with a semantics not based on standard
epistemic models but labelled transition systems that represent the agent's
knowledge of his own abilities. A sound and complete proof system is given to
capture the valid reasoning patterns about "knowing how" where the most
important axiom suggests its compositional nature.Comment: 14 pages, a 12-page version accepted by LORI
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
Tableaux for the Logic of Strategically Knowing How
The logic of goal-directed knowing-how extends the standard epistemic logic
with an operator of knowing-how. The knowing-how operator is interpreted as
that there exists a strategy such that the agent knows that the strategy can
make sure that p. This paper presents a tableau procedure for the multi-agent
version of the logic of strategically knowing-how and shows the soundness and
completeness of this tableau procedure. This paper also shows that the
satisfiability problem of the logic can be decided in PSPACE.Comment: In Proceedings TARK 2023, arXiv:2307.0400
Achieving while maintaining:A logic of knowing how with intermediate constraints
In this paper, we propose a ternary knowing how operator to express that the
agent knows how to achieve given while maintaining
in-between. It generalizes the logic of goal-directed knowing how proposed by
Yanjing Wang 2015 'A logic of knowing how'. We give a sound and complete
axiomatization of this logic.Comment: appear in Proceedings of ICLA 201
Strategically knowing how
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 achieve φ means that there exists a (uniform) strategy such that the agent knows that it can make sure φ. We give an intuitive axiomatization of our logic and prove the soundness, completeness, and decidability of the logic. The crucial axioms relating knowing that and knowing how illustrate our understanding of knowing how in this setting. This logic can be used in representing both knowledge-that and knowledge-how
Managing LTL properties in Event-B refinement
Refinement in Event-B supports the development of systems via proof based
step-wise refinement of events. This refinement approach ensures safety
properties are preserved, but additional reasoning is required in order to
establish liveness and fairness properties.
In this paper we present results which allow a closer integration of two
formal methods, Event-B and linear temporal logic. In particular we show how a
class of temporal logic properties can carry through a refinement chain of
machines. Refinement steps can include introduction of new events, event
renaming and event splitting. We also identify a general liveness property that
holds for the events of the initial system of a refinement chain. The approach
will aid developers in enabling them to verify linear temporal logic properties
at early stages of a development, knowing they will be preserved at later
stages. We illustrate the results via a simple case study
Group announcement logic
AbstractTwo currently active strands of research on logics for multi-agent systems are dynamic epistemic logic, focusing on the epistemic consequences of actions, and logics of coalitional ability, focusing on what coalitions of agents can achieve by cooperating strategically. In this paper we bridge these topics by considering the question: “what can a coalition achieve by making public announcements?”. We propose an extension of public announcement logic with constructs of the form 〈G〉ϕ, where G is a group of agents, with the intuitive meaning that G can jointly execute a publicly observable action such that ϕ will be true afterwards. Actions here are taken to be truthful public announcements, but turn out also to include sequences of such joint actions as well as protocols with alternating actions by different agents, in response to the actions of others. We also study in detail the difference between ‘knowing how’ (knowing de re) and ‘knowing that’ (knowing de dicto) in our framework: both can elegantly be expressed in the single-agent case. We present several meta-logical properties of this Group Announcement Logic, including a sound and complete axiomatization, expressivity and the complexity of model checking
- …