- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Foundations of instance level updates in expressive description logics
Artificial Intelligence 175 (18):2170-2197 (2011)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
A tableau decision algorithm for modalized ALC with constant domains.Carsten Lutz, Holger Sturm, Frank Wolter & Michael Zakharyaschev - 2002 - Studia Logica 72 (2):199-232.
An overview of tableau algorithms for description logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
Tense Logic Without Tense Operators.Frank Wolter - 1996 - Mathematical Logic Quarterly 42 (1):145-171.
Superintuitionistic companions of classical modal logics.Frank Wolter - 1997 - Studia Logica 58 (2):229-259.
A Correspondence between Temporal Description Logics.Alessandro Artale & Carsten Lutz - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):209-233.
Expressive probabilistic description logics.Thomas Lukasiewicz - 2008 - Artificial Intelligence 172 (6-7):852-883.
Towards ABox modularization of semi-expressive description logics.Sebastian Wandelt & Ralf Möller - 2012 - Applied ontology 7 (2):133-167.
Deciding Unifiability and Computing Local Unifiers in the Description Logic $mathcal{E!L}$ without Top Constructor.Franz Baader, Nguyen Thanh Binh, Stefan Borgwardt & Barbara Morawska - 2016 - Notre Dame Journal of Formal Logic 57 (4):443-476.
The Expressive Unary Truth Functions of n -valued Logic.Stephen Pollard - 2005 - Notre Dame Journal of Formal Logic 46 (1):93-105.
Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog.Shqiponja Ahmetaj, Magdalena Ortiz & Mantas Šimkus - 2020 - Artificial Intelligence 280 (C):103220.
Specification of nonmonotonic reasoning.Joeri Engelfriet & Jan Treur - 2000 - Journal of Applied Non-Classical Logics 10 (1):7-26.
Reflexive Intermediate First-Order Logics.Nathan C. Carter - 2008 - Notre Dame Journal of Formal Logic 49 (1):75-95.
Handling database updates in two-dimensional temporal logic.Marcelo Finger - 1992 - Journal of Applied Non-Classical Logics 2 (2):201-224.
Term-modal logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
Description Logics with Concrete Domains- A Survey.Carsten Lutz - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 265-296.
Analytics
Added to PP
2020-12-22
Downloads
4 (#1,628,455)
6 months
2 (#1,206,802)
2020-12-22
Downloads
4 (#1,628,455)
6 months
2 (#1,206,802)
Historical graph of downloads
Author's Profile
Citations of this work
On the succinctness of some modal logics.Tim French, Wiebe van der Hoek, Petar Iliev & Barteld Kooi - 2013 - Artificial Intelligence 197 (C):56-85.
Query inseparability for ALC ontologies.Elena Botoeva, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter & Michael Zakharyaschev - 2019 - Artificial Intelligence 272 (C):1-51.
References found in this work
On the complexity of propositional knowledge base revision, updates, and counterfactuals.Thomas Eiter & Georg Gottlob - 1992 - Artificial Intelligence 57 (2-3):227-270.
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
On the relative expressiveness of description logics and predicate logics.Alex Borgida - 1996 - Artificial Intelligence 82 (1-2):353-367.
The size of a revised knowledge base.Marco Cadoli, Francesco M. Donini, Paolo Liberatore & Marco Schaerf - 1999 - Artificial Intelligence 115 (1):25-64.
Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity.Daniele Mundici - 1984 - Annals of Pure and Applied Logic 27 (3):265-273.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5ff6c685cb-9vkzx uwo