8 found
Sort by:
  1. Franz Baader, Stefan Borgwardt & Rafael Peñaloza (forthcoming). On the Decidability Status of Fuzzy A ℒ C with General Concept Inclusions. Journal of Philosophical Logic:1-30.
    The combination of Fuzzy Logics and Description Logics (DLs) has been investigated for at least two decades because such fuzzy DLs can be used to formalize imprecise concepts. In particular, tableau algorithms for crisp Description Logics have been extended to reason also with their fuzzy counterparts. It has turned out, however, that in the presence of general concept inclusion axioms (GCIs) this extension is less straightforward than thought. In fact, a number of tableau algorithms claimed to deal correctly with fuzzy (...)
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Franz Baader & Silvio Ghilardi (2007). Connecting Many-Sorted Theories. Journal of Symbolic Logic 72 (2):535 - 583.
    Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must behave like homomorphisms on the shared signature. We determine conditions under which decidability of the validity of universal formulae in the component theories transfers to their connection. In addition, we consider variants of the basic connection scheme. Our results can be seen as a generalization of the so-called E-connection approach for combining modal logics to an (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Franz Baader, Diego Calvanese, Deborah McGuinness & Daniele Nardi Y. Peter (2003). Libros recientes de pensamiento. Teorema 22 (1-3).
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  4. Franz Baader & Ulrike Sattler (2001). An Overview of Tableau Algorithms for Description Logics. 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 (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  5. Franz Baader & Cesare Tinelli (2000). Combining Equational Theories Sharing Non-Collapse-Free Constructors. In. In Dov M. Gabbay & Maarten de Rijke (eds.), Frontiers of Combining Systems. Research Studies Press. 260--274.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. Franz Baader & Hans Juürgen Ohlbach (1995). A Multi-Dimensional Terminological Knowledge Representation Language. Journal of Applied Non-Classical Logics 5 (2):153-197.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Franz Baader (1993). Hans-J Urgen B Urckert, Bernhard Nebel, Werner Nutt, and Gert Smolka. On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations. Journal of Logic, Language and Information 2:1-18.
     
    My bibliography  
     
    Export citation  
  8. Franz Baader, Hans-Jürgen Bürckert, Bernhard Nebel, Werner Nutt & Gert Smolka (1993). On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations. Journal of Logic, Language and Information 2 (1):1-18.
    Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional uncertainty construct needed for the description of long-distance dependencies and obtain the following results: satisfiability of feature terms is undecidable, sort equations can be internalized, consistency of sort equations is decidable if there is at least one atom, and consistency of sort equations is undecidable if there is no atom.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation