Results 1  10
of
137,410
Dynamic termmodal logic
 In A Meeting of the Minds
, 2007
"... abstract. A firstorder dynamic epistemic logic is developed where the names of the agents are also terms in the sense of firstorder logic. Consequently one can quantify over epistemic modalities. Using constructs from dynamic logic one can express many interesting concepts. Firstorder update mode ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
abstract. A firstorder dynamic epistemic logic is developed where the names of the agents are also terms in the sense of firstorder logic. Consequently one can quantify over epistemic modalities. Using constructs from dynamic logic one can express many interesting concepts. Firstorder update
TermModal Logic and Quantifierfree Dynamic Assignment Logic
, 2000
"... Thalmann, Lars 2000: TermModal Logic and Quantierfree Dynamic Assignment Logic. Uppsala Theses in Computing Science 34. 140 pp. Uppsala. ISSN 0283359X, ISBN 9150614436. In this dissertation, we present two new sorts of computer science logics. Many powerful logics exist today for reasoning a ..."
Abstract
 Add to MetaCart
Thalmann, Lars 2000: TermModal Logic and Quantierfree Dynamic Assignment Logic. Uppsala Theses in Computing Science 34. 140 pp. Uppsala. ISSN 0283359X, ISBN 9150614436. In this dissertation, we present two new sorts of computer science logics. Many powerful logics exist today for reasoning
Specification with MultiModal Logics Language Summary
, 2004
"... ModalCASL extends CASL by modal operators. Syntax for ordinary modalities, multimodal logics as well as termmodal logic (also covering dynamic logic) is provided. Specific modal logics can be obtained via restrictions to sublanguages. This document provides a detailed definition of the ModalCASL s ..."
Abstract
 Add to MetaCart
ModalCASL extends CASL by modal operators. Syntax for ordinary modalities, multimodal logics as well as termmodal logic (also covering dynamic logic) is provided. Specific modal logics can be obtained via restrictions to sublanguages. This document provides a detailed definition of the Modal
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 1008 (7 self)
 Add to MetaCart
the effect of the execution of a program on the truth of a formula ', DL uses a modal construct <>', which
Description Logic Programs: Combining Logic Programs with Description Logic
, 2003
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract

Cited by 532 (45 self)
 Add to MetaCart
We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
Light Linear Logic
"... The abuse of structural rules may have damaging complexity effects. ..."
Abstract

Cited by 810 (4 self)
 Add to MetaCart
The abuse of structural rules may have damaging complexity effects.
Separation Logic: A Logic for Shared Mutable Data Structures
, 2002
"... In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about lowlevel imperative programs that use shared mutable data structure. ..."
Abstract

Cited by 948 (6 self)
 Add to MetaCart
In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about lowlevel imperative programs that use shared mutable data structure.
Results 1  10
of
137,410