I. Nemeti. Decidable versions of first order predicate logic and cylindric relativized set algebras. In L. Csirmaz, D. Gabbay, and M. De Rijke, editors, Logic Colloquium'92. CSLI Publications, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Description Logics - Wolter, Zakharyaschev (2000) (3 citations) (Correct)
....model property, their hybrid defined above does not enjoy it: as follows from [23] there is a PDLC formula satisfiable in an infinite model but not in finite ones. The satisfiability checking algorithm we are going to construct in Section 4 is based on a variant of the mosaic technique (see e.g. [12]) and the representation of models in the form of quasimodels. 3 Quasimodels The aim of this section is to show that modulo a given formula every PDLC model can be represented as a structure, called a quasimodel, every state in which is finite. Let us fix a PDLC formula and denote by sub , ....
I. Nemeti. Decidable versions of first order predicate logic and cylindric relativized set algebras. In L. Csirmaz, D. Gabbay, and M. De Rijke, editors, Logic Colloquium'92. CSLI Publications, 1995.
The product of converse PDL and polymodal K - Wolter (1999) (10 citations) (Correct)
No context found.
I. Nemeti. Decidable versions of first order predicate logic and cylindric relativized set algebras. In L. Csirmaz, D. Gabbay, and M. De Rijke, editors, Logic Colloquium 92. CSLI Publications, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC