Description logics
Publisher Summary This chapter discusses description logics (DLs), which are a family of
logic-based knowledge representation languages that can be used to represent the …
logic-based knowledge representation languages that can be used to represent the …
An overview of tableau algorithms for description logics
Abstract Description logics are a family of knowledge representation formalisms that are
descended from semantic networks and frames via the system Kl-one. During the last …
descended from semantic networks and frames via the system Kl-one. During the last …
Temporal and modal logic
EA Emerson - Formal Models and Semantics, 1990 - Elsevier
Publisher Summary This chapter discusses temporal and modal logic. The chapter
describes a multiaxis classification of systems of temporal logic. The chapter describes the …
describes a multiaxis classification of systems of temporal logic. The chapter describes the …
Dynamic logic
Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …
[LIVRE][B] Dynamic epistemic logic
Dynamic Epistemic Logic is the logic of knowledge change. This is not about one logical
system, but about a whole family of logics that allows us to specify static and dynamic …
system, but about a whole family of logics that allows us to specify static and dynamic …
[LIVRE][B] Handbook of knowledge representation
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Decision procedures and expressiveness in the temporal logic of branching time
EA Emerson, JY Halpern - Proceedings of the fourteenth annual ACM …, 1982 - dl.acm.org
In this paper we consider the Computation Tree Logic (CTL) proposed in [CE] which extends
the Unified Branching Time Logic (UB) of [BMP] by adding an until operator. We establish …
the Unified Branching Time Logic (UB) of [BMP] by adding an until operator. We establish …
[LIVRE][B] A correspondence theory for terminological logics: Preliminary report
K Schild - 1991 - Citeseer
We show that the terminological logic ACC comprising Boolean operations on concepts and
value restrictions is a notational variant of the propositional modal logic K (m)-To …
value restrictions is a notational variant of the propositional modal logic K (m)-To …
[LIVRE][B] Description logics
In this chapter, we explain what description logics are and why they make good ontology
languages. In particular, we introduce the description logic SHIQ, which has formed the …
languages. In particular, we introduce the description logic SHIQ, which has formed the …
Automata theoretic techniques for modal logics of programs
We present a new technique for obtaining decision procedures for modal logics of programs.
The technique centers around a new class of finite automata on infinite trees for which the …
The technique centers around a new class of finite automata on infinite trees for which the …