Decidability of Class-Based Knowledge Representation Formalisms (1995)
Cached
Download Links
by
Giuseppe De Giacomo
| Citations: | 62 - 9 self |
BibTeX
@MISC{Giacomo95decidabilityof,
author = {Giuseppe De Giacomo},
title = {Decidability of Class-Based Knowledge Representation Formalisms},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 447 | A lattice-theoretical fixpoint theorem and its applications - Tarski - 1955 |
| 184 | P.: Automata-theoretic techniques for modal logics of programs - Vardi, Wolper - 1986 |
| 67 | An automata theoretic decision procedure for the propositional mucalculus - Streett, Emerson - 1989 |
| 28 | Logic of Transition Systems - Benthem, Bergstra - 1993 |
| 24 | On the semantics of graded modalities - Hoek - 1992 |
| 24 | A latticetheoretic xpoint theorem and its applications - Tarski - 1955 |
| 23 | Modal logic, transition systems and processes - Benthem, Eijck, et al. - 1994 |
| 15 | The taming of the converse: reasoning about two-way computations - Vardi - 1985 |
| 12 | The propositional mu-calculus is elementary - Streett, Emerson |
| 9 | der Hoek and M. de Rijke. Counting objects - van - 1995 |
| 3 | National Center for Health Statistics - States - 1996 |
| 1 | A note on model checking the modal -calculus - Winsket - 1989 |
