Results 1  10
of
10,199
Dynamic Logic
 Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract

Cited by 1012 (7 self)
 Add to MetaCart
ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possible values a 2 N. This operation becomes explicit in DL in the form of the program x := ?, called a nondeterministic or wildcard assignment. This is a rather unconventional program, since it is not effective; however, it is quite useful as a descriptive tool. A more conventional way to obtain a square root of y, if it exists, would be the program x := 0 ; while x < y do x := x + 1: (1) In DL, such programs are firstclass objects on a par with formulas, complete with a collection of operators for forming compound programs inductively from a basis of primitive programs. To discuss the effect of the execution of a program on the truth of a formula ', DL uses a modal construct <>', which
Dynamic Logic
"... We propose a firstorder dynamic logic for reasoning about hybrid systems. As a uniform model for discrete and continuous evolutions in hybrid systems, we introduce hybrid programs with differential actions. Our logic can be used to specify and verify correctness statements about hybrid programs, wh ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We propose a firstorder dynamic logic for reasoning about hybrid systems. As a uniform model for discrete and continuous evolutions in hybrid systems, we introduce hybrid programs with differential actions. Our logic can be used to specify and verify correctness statements about hybrid programs
Dynamic Predicate Logic
, 1990
"... This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of firstorder predicate logic. The resulting system, which will be referred to as `dynamic predicate logic', is intended as a first step towards a compositional, nonrepresentational ..."
Abstract

Cited by 462 (2 self)
 Add to MetaCart
This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of firstorder predicate logic. The resulting system, which will be referred to as `dynamic predicate logic', is intended as a first step towards a compositional, non
GOLOG: A Logic Programming Language for Dynamic Domains
, 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract

Cited by 628 (74 self)
 Add to MetaCart
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world
Dynamic Logic
"... this paper I shall develop a dynamic variant of formal logic. The motivation for this is the need for a logic that can describe processes. In fact, the present work originally had a very practical purpose, namely to construct a logic that would be helpful in designing interactive multimedia systems ..."
Abstract
 Add to MetaCart
this paper I shall develop a dynamic variant of formal logic. The motivation for this is the need for a logic that can describe processes. In fact, the present work originally had a very practical purpose, namely to construct a logic that would be helpful in designing interactive multimedia systems
Towards Intuitionistic Dynamic Logic
, 2006
"... We propose the beginnings of an intuitionistic propopsitional dynamic logic, and describe some open problems. 1 ..."
Abstract
 Add to MetaCart
We propose the beginnings of an intuitionistic propopsitional dynamic logic, and describe some open problems. 1
Frame problem in dynamic logic
"... ABSTRACT. This paper provides a formal analysis on the solutions of the frame problem by using dynamic logic. We encode Pednault’s syntaxbased solution, Baker’s stateminimization policy, and Gelfond & Lifchitz’s Action Language A in the propositional dynamic logic (PDL). The formal relationshi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
ABSTRACT. This paper provides a formal analysis on the solutions of the frame problem by using dynamic logic. We encode Pednault’s syntaxbased solution, Baker’s stateminimization policy, and Gelfond & Lifchitz’s Action Language A in the propositional dynamic logic (PDL). The formal
The gamut of dynamic logics
 Handbook of the History of Logic
, 2006
"... Dynamic logic, broadly conceived, is the logic that analyses change by decomposing actions into their basic building blocks and by describing the results of performing actions in given states of the world. The actions studied by dynamic logic can be of various kinds: actions on the memory state of a ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Dynamic logic, broadly conceived, is the logic that analyses change by decomposing actions into their basic building blocks and by describing the results of performing actions in given states of the world. The actions studied by dynamic logic can be of various kinds: actions on the memory state
Dynamic Logic Programming
 LINKÖPING ELECTRONIC ARTICLES IN COMPUTER AND INFORMATION SCIENCE
, 1997
"... ..."
Dynamic Logic for Belief Revision
 JOURNAL OF APPLIED NONCLASSIC LOGICS
, 2007
"... We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dyn ..."
Abstract

Cited by 71 (11 self)
 Add to MetaCart
in the dynamicepistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms postulates for belief revision can be analyzed by standard modal frame correspondences for modelchanging operations.
Results 1  10
of
10,199