Switch to: References

Add citations

You must login to add citations.
  1. A refined architecture for terminological systems: Terminology = Schema + Views.M. Buchheit, F. M. Donini, W. Nutt & A. Schaerf - 1998 - Artificial Intelligence 99 (2):209-260.
    Download  
     
    Export citation  
     
    Bookmark  
  • “Reducing” classic to practice: Knowledge representation theory meets reality.Ronald J. Brachman, Deborah L. McGuinness, Peter F. Patel-Schneider & Alex Borgida - 1999 - Artificial Intelligence 114 (1-2):203-237.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Extending the description logic EL with threshold concepts induced by concept measures.Franz Baader & Oliver Fernández Gil - 2024 - Artificial Intelligence 326 (C):104034.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computing the least common subsumer w.r.t. a background terminology.Franz Baader, Baris Sertkaya & Anni-Yasmin Turhan - 2007 - Journal of Applied Logic 5 (3):392-420.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An overview of tableau algorithms for description logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
    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 decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of programs (such as propositional dynamic logic), for which (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Tractable reasoning via approximation.Marco Schaerf & Marco Cadoli - 1995 - Artificial Intelligence 74 (2):249-310.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Attributive concept descriptions with complements.Manfred Schmidt-Schauß & Gert Smolka - 1991 - Artificial Intelligence 48 (1):1-26.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Planning from second principles.Jana Koehler - 1996 - Artificial Intelligence 87 (1-2):145-186.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An empirical analysis of terminological representation systems.Jochen Heinsohn, Daniel Kudenko, Bernhard Nebel & Hans-Jürgen Profitlich - 1994 - Artificial Intelligence 68 (2):367-397.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Human Rationality Challenges Universal Logic.Brian R. Gaines - 2010 - Logica Universalis 4 (2):163-205.
    Tarski’s conceptual analysis of the notion of logical consequence is one of the pinnacles of the process of defining the metamathematical foundations of mathematics in the tradition of his predecessors Euclid, Frege, Russell and Hilbert, and his contemporaries Carnap, Gödel, Gentzen and Turing. However, he also notes that in defining the concept of consequence “efforts were made to adhere to the common usage of the language of every day life.” This paper addresses the issue of what relationship Tarski’s analysis, and (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services.Jon Doyle & Ramesh S. Patil - 1991 - Artificial Intelligence 48 (3):261-297.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • The complexity of existential quantification in concept languages.Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Bernhard Hollunder, Werner Nutt & Alberto Marchetti Spaccamela - 1992 - Artificial Intelligence 53 (2-3):309-327.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • An epistemic operator for description logics.F. M. Donini, M. Lenzerini, D. Nardi, W. Nutt & A. Schaerf - 1998 - Artificial Intelligence 100 (1-2):225-274.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics.Daniel Gorín & Lutz Schröder - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. CSLI Publications. pp. 254-273.
    Download  
     
    Export citation  
     
    Bookmark