scholarly journals Multiagent Only Knowing in Dynamic Systems

2014 ◽  
Vol 49 ◽  
pp. 363-402 ◽  
Author(s):  
V. Belle ◽  
G. Lakemeyer
Keyword(s):  
Dynamic Systems ◽  
Single Agent ◽  
Modal Language ◽  
De Re ◽  
First Order ◽  
Dynamic Reasoning ◽  
Knowledge Based ◽  
Knowing That ◽  
Quantifying In ◽  
Reasoning About Knowledge

The idea of "only knowing" a collection of sentences, as proposed by Levesque, has been previously shown to be very useful in characterizing knowledge-based agents: in terms of a specification, a precise and perspicuous account of the beliefs and non-beliefs is obtained in a monotonic setting. Levesque's logic is based on a first-order modal language with quantifying-in, thus allowing for de re versus de dicto distinctions, among other things. However, the logic and its recent dynamic extension only deal with the case of a single agent. In this work, we propose a first-order multiagent framework with knowledge, actions, sensing and only knowing, that is shown to inherit all the features of the single agent version. Most significantly, we prove reduction theorems by means of which reasoning about knowledge and actions in the framework simplifies to non-epistemic, non-dynamic reasoning about the initial situation.

Motion Planning for Dynamic Systems Using First-Order Logic

2002 ◽  
Author(s):  
Lei Yan ◽  
K. Krishnamurthy
Keyword(s):  
Motion Planning ◽  
Dynamic Systems ◽  
Initial Conditions ◽  
Search Space ◽  
Order Logic ◽  
First Order Logic ◽  
Knowledge Representation And Reasoning ◽  
Know How ◽  
First Order ◽  
Knowledge Based

The problem of motion planning for a class of dynamic systems is considered in this study. A knowledge-based approach is used to determine the initial conditions that will yield a certain desired state of the dynamic system. The search space is limited by using a set of rules because reasoning about dynamic systems is basically searching an infinite space. In this study, first-order logic is used for knowledge representation and reasoning. The methodology is applied to playing a pool game. The dynamics of the motion of the balls are complicated and significant expertise is required to know how to strike the balls. Simulated results presented show how the rules help in finding the appropriate strategies for playing the game.

scholarly journals Strategically knowing how

2017 ◽  
Author(s):  
Raul Fervari ◽  
Andreas Herzig ◽  
Yanjun Li ◽  
Yanjing Wang
Keyword(s):  
Epistemic Logic ◽  
Single Agent ◽  
Knowing How ◽  
Knowing That ◽  
Reasoning About Knowledge

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 phi means that there exists a (uniform) strategy such that the agent knows that it can make sure phi. We give an intuitive axiomatisation 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 and reasoning about knowledge-how.

Direct Differentiation Methods for the Design Sensitivity of Multibody Dynamic Systems

1996 ◽  
Author(s):  
Radu Serban ◽  
Jeffrey S. Freeman
Keyword(s):  
Sensitivity Analysis ◽  
Dynamic Systems ◽  
Design Sensitivity ◽  
Differential Algebraic Equations ◽  
Mechanism Analysis ◽  
Algebraic Equations ◽  
First Order ◽  
Direct Differentiation ◽  
Multibody Dynamic ◽  
Standard Techniques

Abstract Methods for formulating the first-order design sensitivity of multibody systems by direct differentiation are presented. These types of systems, when formulated by Euler-Lagrange techniques, are representable using differential-algebraic equations (DAE). The sensitivity analysis methods presented also result in systems of DAE’s which can be solved using standard techniques. Problems with previous direct differentiation sensitivity analysis derivations are highlighted, since they do not result in valid systems of DAE’s. This is shown using the simple pendulum example, which can be analyzed in both ODE and DAE form. Finally, a slider-crank example is used to show application of the method to mechanism analysis.

Using Object-Oriented Frame Language for Realizing Discrete Event Simulation

1996 ◽  
Author(s):  
Ming Dong ◽  
Jianzhong Cha ◽  
Mingcheng E
Keyword(s):  
Knowledge Base ◽  
Discrete Event Simulation ◽  
Discrete Event ◽  
Object Oriented ◽  
Simulation Models ◽  
Activity Cycle ◽  
Event Simulation ◽  
Knowledge Based ◽  
Inference Engines ◽  
Reasoning About Knowledge

Abstract In this paper, we realize knowledge-based discrete event simulation model’s representation, reasoning and implementation by means of object-oriented(OO) frame language. Firstly, a classes library of simulation models is built by using the OO frame language. And then, behaviours of simulation models can be generated by inference engines reasoning about knowledge base. Lastly, activity cycle diagrams can be used to construct simulation network logic models by connecting the components classes of simulation models. This kind of knowledge-based simulation models can effectively solve the modeling problems of complex and ill-structure systems.

KK Compatibilism

2021 ◽  
pp. 40-54
Author(s):  
Mona Simion
Keyword(s):  
Higher Order ◽  
Second Order ◽  
High Stakes ◽  
Proper Action ◽  
First Order ◽  
Knowing That

According to KK Compatibilism, the unassertability in the high-stakes contextualist cases can be explained in terms of the subjects lack of higher-order knowledge: although, strictly speaking, all that is needed for proper action—assertion included—is first-order knowledge, when the stakes are high, we tend to find people who act without knowing that they meet the condition for proper action blameworthy for so doing. This chapter argues that (1) the view misidentifies the epistemic deficit that is explanatorily salient in contextualist cases, in that the absence of second-order knowledge is not a difference maker, and (2) on closer look, the account requires normative finessing for extensional adequacy.

scholarly journals Characterizing Boundedness in Chase Variants

2020 ◽  
Vol 21 (1) ◽  
pp. 51-79
Author(s):  
STATHIS DELIVORIAS ◽  
MICHEL LECLÈRE ◽  
MARIE-LAURE MUGNIER ◽  
FEDERICO ULLIANA
Keyword(s):  
Knowledge Bases ◽  
Order Logic ◽  
First Order Logic ◽  
First Order ◽  
Universal Models ◽  
Knowing That ◽  
Significant Interest ◽  
Horn Rules ◽  
Boundedness Problem ◽  
Undecidable Problem

AbstractExistential rules are a positive fragment of first-order logic that generalizes function-free Horn rules by allowing existentially quantified variables in rule heads. This family of languages has recently attracted significant interest in the context of ontology-mediated query answering. Forward chaining, also known as the chase, is a fundamental tool for computing universal models of knowledge bases, which consist of existential rules and facts. Several chase variants have been defined, which differ on the way they handle redundancies. A set of existential rules is bounded if it ensures the existence of a bound on the depth of the chase, independently from any set of facts. Deciding if a set of rules is bounded is an undecidable problem for all chase variants. Nevertheless, when computing universal models, knowing that a set of rules is bounded for some chase variant does not help much in practice if the bound remains unknown or even very large. Hence, we investigate the decidability of the k-boundedness problem, which asks whether the depth of the chase for a given set of rules is bounded by an integer k. We identify a general property which, when satisfied by a chase variant, leads to the decidability of k-boundedness. We then show that the main chase variants satisfy this property, namely the oblivious, semi-oblivious (aka Skolem), and restricted chase, as well as their breadth-first versions.

scholarly journals Knowledge Based Dialogue for Dynamic Systems

1987 ◽  
Vol 20 (5) ◽  
pp. 327-336 ◽  
Author(s):  
J.L. Alty ◽  
G. Johannsen
Keyword(s):  
Dynamic Systems ◽  
Knowledge Based
Sign in / Sign up

Export Citation Format

Share Document