Reasoning in Basic Description Logics and Description Logics with Modal Operators
Milenko Mosurović, Tatjana Stojanović, Ana Kaplarević-Mališić (2009)
Zbornik Radova
Similarity:
Milenko Mosurović, Tatjana Stojanović, Ana Kaplarević-Mališić (2009)
Zbornik Radova
Similarity:
Eugénie Foustoucos, Irène Guessarian (2009)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [16]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data...
Božić, Milan (1985)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Krister Segerberg (1982)
Banach Center Publications
Similarity:
Johan van Benthem (2007)
Publications de l'Institut Mathématique
Similarity:
Daishi Yazaki (2019)
Bulletin of the Section of Logic
Similarity:
The main purpose of this paper is to give alternative proofs of syntactical and semantical properties, i.e. the subformula property and the nite model property, of the sequent calculi for the modal logics K4.3, KD4.3, and S4.3. The application of the inference rules is said to be acceptable, if all the formulas in the upper sequents are subformula of the formulas in lower sequent. For some modal logics, Takano analyzed the relationships between the acceptable inference rules and semantical...
Dale Jacquette (2005)
Philosophia Scientiae
Similarity:
Jan Štěpán (1989)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity: