Switch to: References

Add citations

You must login to add citations.
  1. Tractable reasoning via approximation.Marco Schaerf & Marco Cadoli - 1995 - Artificial Intelligence 74 (2):249-310.
  • Tractable approximate deduction for OWL.Jeff Z. Pan, Yuan Ren & Yuting Zhao - 2016 - Artificial Intelligence 235 (C):95-155.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Inconsistency-tolerant description logic. Part II: A tableau algorithm for CALC C.S. P. Odintsov & H. Wansing - 2008 - Journal of Applied Logic 6 (3):343-360.
  • Terminological reasoning is inherently intractable.Bernhard Nebel - 1990 - Artificial Intelligence 43 (2):235-249.
  • Carnap, Goguen, and the hyperontologies: Logical pluralism and heterogeneous structuring in ontology design. [REVIEW]Dominik Lücke - 2010 - Logica Universalis 4 (2):255-333.
    This paper addresses questions of universality related to ontological engineering, namely aims at substantiating (negative) answers to the following three basic questions: (i) Is there a ‘universal ontology’?, (ii) Is there a ‘universal formal ontology language’?, and (iii) Is there a universally applicable ‘mode of reasoning’ for formal ontologies? To support our answers in a principled way, we present a general framework for the design of formal ontologies resting on two main principles: firstly, we endorse Rudolf Carnap’s principle of logical (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • A nonstandard approach to the logical omniscience problem.Ronald Fagin, Joseph Y. Halpern & Moshe Y. Vardi - 1995 - Artificial Intelligence 79 (2):203-240.
  • A comment on relevant truth table logic.Chris Brink - 1992 - Journal of Applied Non-Classical Logics 2 (2):243-246.