Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Franz Baader
2010 – today
- 2013
[j50]Franz Baader, Alexander Okhotin: On Language Equations with One-sided Concatenation. Fundam. Inform. 126(1): 1-35 (2013)
[c145]Franz Baader, Stefan Borgwardt, Marcel Lippmann: Temporalizing Ontology-Based Data Access. CADE 2013: 330-344
[c144]Franz Baader, Oliver Fernandez Gil, Barbara Morawska: Hybrid EL-Unification is NP-complete. Description Logics 2013: 29-40
[c143]Franz Baader, Benjamin Zarrieß: Verification of Golog Programs over Description Logic Actions. FroCos 2013: 181-196
[c142]Franz Baader, Oliver Fernandez Gil, Barbara Morawska: Hybrid Unification in the Description Logic. FroCos 2013: 295-310- 2012
[j49]
[j48]Franz Baader, Silvio Ghilardi, Carsten Lutz: LTL over description logic axioms. ACM Trans. Comput. Log. 13(3): 21 (2012)
[j47]Franz Baader, Martin Knechtel, Rafael Peñaloza: Context-dependent views to axioms and consequences of Semantic Web ontologies. J. Web Sem. 12: 22-40 (2012)
[c141]Franz Baader, Stefan Borgwardt, Barbara Morawska: Computing Minimal EL-unifiers is Hard. Advances in Modal Logic 2012: 18-35
[c140]Franz Baader, Stefan Borgwardt, Barbara Morawska: A Goal-Oriented Algorithm for Unification in $\mathcal{ELH}_{R+}$ w.r.t. Cycle-Restricted Ontologies. Australasian Conference on Artificial Intelligence 2012: 493-504
[c139]Franz Baader, Stefan Borgwardt, Barbara Morawska: SAT Encoding of Unification in $\mathcal{ELH}_{{R}^+}$ w.r.t. Cycle-Restricted Ontologies. IJCAR 2012: 30-44
[c138]Franz Baader, Julian Mendez, Barbara Morawska: UEL: Unification Solver for the Description Logic $\mathcal{EL}$ - System Description. IJCAR 2012: 45-51
[c137]Franz Baader, Stefan Borgwardt, Barbara Morawska: A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes. Description Logics 2012
[c136]Franz Baader, Stefan Borgwardt, Julian Mendez, Barbara Morawska: UEL: Unification Solver for EL. Description Logics 2012
[c135]Wael Yehia, Hongkai Liu, Marcel Lippmann, Franz Baader, Mikhail Soutchanski: Experimental Results on Solving the Projection Problem in Action Formalisms Based on Description Logics. Description Logics 2012
[c134]Franz Baader, Stefan Borgwardt, Barbara Morawska: Extending Unification in EL Towards General TBoxes. KR 2012
[c133]Franz Baader, Alexander Okhotin: Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints. LPAR 2012: 107-121- 2011
[j46]Franz Baader, Silvio Ghilardi: Unification in modal and description logics. Logic Journal of the IGPL 19(6): 705-730 (2011)
[j45]
[c132]Franz Baader, Thanh Binh Nguyen, Stefan Borgwardt, Barbara Morawska: Unification in the Description Logic EL without the Top Concept. CADE 2011: 70-84
[c131]Franz Baader, Thanh Binh Nguyen, Stefan Borgwardt, Barbara Morawska: Unification in the Description Logic EL without the Top Concept. Description Logics 2011
[c130]Franz Baader, Rafael Peñaloza: GCIs Make Reasoning in Fuzzy DL with the Product T-norm Undecidable. Description Logics 2011
[c129]Franz Baader, Rafael Peñaloza: On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm. FroCoS 2011: 55-70
[c128]Franz Baader, Rafael Peñaloza: Are fuzzy description logics with general concept inclusion axioms decidable? FUZZ-IEEE 2011: 1735-1742
[i2]Franz Baader, Carsten Lutz, Holger Sturm, Frank Wolter: Fusions of Description Logics and Abstract Description Systems. CoRR abs/1106.1802 (2011)- 2010
[j44]Franz Baader, Barbara Morawska: Unification in the Description Logic EL. Logical Methods in Computer Science 6(3) (2010)
[j43]Franz Baader, Bernhard Beckert, Tobias Nipkow: Deduktion: von der Theorie zur Anwendung. Informatik Spektrum 33(5): 444-451 (2010)
[j42]Franz Baader, Rafael Peñaloza: Automata-Based Axiom Pinpointing. J. Autom. Reasoning 45(2): 91-129 (2010)
[j41]Franz Baader, Carsten Lutz, Anni-Yasmin Turhan: Small is Again Beautiful in Description Logics. KI 24(1): 25-33 (2010)
[j40]Franz Baader, Rafael Peñaloza: Axiom Pinpointing in General Tableaux. J. Log. Comput. 20(1): 5-34 (2010)
[c127]Franz Baader, Hongkai Liu, Anees ul Mehdi: Verifying Properties of Infinite Sequences of Description Logic Actions. ECAI 2010: 53-58
[c126]Franz Baader, Meghyn Bienvenu, Carsten Lutz, Frank Wolter: Query and Predicate Emptiness in Description Logics. KR 2010
[c125]Franz Baader, Marcel Lippmann, Hongkai Liu: Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics. LPAR (Yogyakarta) 2010: 82-96
[c124]
2000 – 2009
- 2009
[c123]Franz Baader, Meghyn Bienvenu, Carsten Lutz, Frank Wolter: Query Answering over DL ABoxes: How to Pick the Relevant Symbols. Description Logics 2009
[c122]
[c121]Franz Baader, Andreas Bauer, Marcel Lippmann: Runtime Verification Using a Temporal Description Logic. FroCoS 2009: 149-164
[c120]Conrad Drescher, Hongkai Liu, Franz Baader, Steffen Guhlemann, Uwe Petersohn, Peter Steinke, Michael Thielscher: Putting ABox Updates into Action. FroCoS 2009: 214-229
[c119]Franz Baader, Baris Sertkaya: Usability Issues in Description Logic Knowledge Base Completion. ICFCA 2009: 1-21
[c118]
[c117]Franz Baader, Andreas Bauer, Alwen Tiu: Matching Trace Patterns with Regular Policies. LATA 2009: 105-116
[c116]
[c115]
[c114]Franz Baader, Martin Knechtel, Rafael Peñaloza: A Generic Approach for Large-Scale Ontological Reasoning in the Presence of Access Restrictions to the Ontology's Axioms. International Semantic Web Conference 2009: 49-64
[c113]Franz Baader, Andreas Bauer, Peter Baumgartner, Anne Cregan, Alfredo Gabaldon, Krystian Ji, Kevin Lee, David Rajaratnam, Rolf Schwitter: A Novel Architecture for Situation Awareness Systems. TABLEAUX 2009: 77-92- 2008
[j39]Franz Baader, Jan Hladik, Rafael Peñaloza: Automata can show PSpace results for description logics. Inf. Comput. 206(9-10): 1045-1056 (2008)
[c112]
[c111]Franz Baader, Silvio Ghilardi, Carsten Lutz: LTL over Description Logic Axioms. Description Logics 2008
[c110]Franz Baader, Novak Novakovik, Boontawee Suntisrivaraporn: A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes. Description Logics 2008
[c109]Franz Baader, Felix Distel: A Finite Basis for the Set of EL-Implications Holding in a Finite Model. ICFCA 2008: 46-61
[c108]
[c107]Franz Baader, Boontawee Suntisrivaraporn: Debugging SNOMED CT Using Axiom Pinpointing in the Description Logic EL+. KR-MED 2008
[e13]Franz Baader, Carsten Lutz, Boris Motik (Eds.): Proceedings of the 21st International Workshop on Description Logics (DL2008), Dresden, Germany, May 13-16, 2008. CEUR Workshop Proceedings 353, CEUR-WS.org 2008- 2007
[j38]Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan: Computing the least common subsumer w.r.t. a background terminology. J. Applied Logic 5(3): 392-420 (2007)
[j37]Franz Baader: Preface to Special Issue on Reasoning in Description Logics. J. Autom. Reasoning 39(3): 245-247 (2007)
[j36]
[c106]Boontawee Suntisrivaraporn, Franz Baader, Stefan Schulz, Kent A. Spackman: Replacing SEP-Triplets in SNOMED CT Using Tractable Description Logic Operators. AIME 2007: 287-291
[c105]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Executive Summary -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
[c104]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Abstracts Collection -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
[c103]Franz Baader, Jan Hladik, Rafael Peñaloza: Blocking Automata for PSPACE DLs. Description Logics 2007
[c102]Franz Baader, Rafael Peñaloza, Boontawee Suntisrivaraporn: Pinpointing in the Description Logic EL. Description Logics 2007
[c101]Franz Baader, Bernhard Ganter, Baris Sertkaya, Ulrike Sattler: Completing Description Logic Knowledge Bases Using Formal Concept Analysis. IJCAI 2007: 230-235
[c100]Franz Baader, Rafael Peñaloza, Boontawee Suntisrivaraporn: Pinpointing in the Description Logic EL+. KI 2007: 52-67
[c99]Franz Baader, Jan Hladik, Rafael Peñaloza: SI! Automata Can Show PSPACE Results for Description Logics. LATA 2007: 67-78
[c98]Stefan Schulz, Boontawee Suntisrivaraporn, Franz Baader: SNOMED CT's Problem List: Ontologists' and Logicians' Therapy Suggestions. MedInfo 2007: 802-806
[c97]Franz Baader, Bernhard Ganter, Ulrike Sattler, Baris Sertkaya: Completing Description Logic Knowledge Bases using Formal Concept Analysis. OWLED 2007
[c96]
[e12]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis (Eds.): Deduction and Decision Procedures, 30.09. - 05.10.2007. Dagstuhl Seminar Proceedings 07401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
[e11]Franz Baader (Ed.): Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings. Lecture Notes in Computer Science 4533, Springer 2007, ISBN 978-3-540-73447-5- 2006
[j35]Franz Baader, Silvio Ghilardi, Cesare Tinelli: A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Inf. Comput. 204(10): 1413-1452 (2006)
[c95]Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn: CEL - A Polynomial-Time Reasoner for Life Science Ontologies. IJCAR 2006: 287-291
[c94]Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn: Efficient Reasoning in EL+. Description Logics 2006
[c93]Carsten Lutz, Franz Baader, Enrico Franconi, Domenico Lembo, Ralf Möller, Riccardo Rosati, Ulrike Sattler, Boontawee Suntisrivaraporn, Sergio Tessaris: Reasoning Support for Ontology Design. OWLED 2006
[e10]Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, Andrei Voronkov (Eds.): Deduction and Applications, 23.-28. October 2005. Dagstuhl Seminar Proceedings 05431, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006- 2005
[j34]Franz Baader: 19th International Conference on Automated Deduction (CADE-19). Inf. Comput. 199(1-2): 1-2 (2005)
[c92]Franz Baader, Carsten Lutz, Maja Milicic, Ulrike Sattler, Frank Wolter: Integrating Description Logics and Action Formalisms: First Results. AAAI 2005: 572-577
[c91]Franz Baader, Ian Horrocks, Ulrike Sattler: Description Logics as Ontology Languages for the Semantic Web. Mechanizing Mathematical Reasoning 2005: 228-248
[c90]
[c89]Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, Andrei Voronkov: 05431 Executive Summary - Deduction and Applications. Deduction and Applications 2005
[c88]Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, Andrei Voronkov: 05431 Abstracts Collection - Deduction and Applications. Deduction and Applications 2005
[c87]Franz Baader, Carsten Lutz, Eldar Karabaev, Manfred Theißen: A new n-ary existential quantifier in description logics. Description Logics 2005
[c86]Franz Baader, Maja Milicic, Carsten Lutz, Ulrike Sattler, Frank Wolter: Integrating Description Logics and Action Formalisms: First Results. Description Logics 2005
[c85]Franz Baader, Silvio Ghilardi: Connecting Many-Sorted Structures and Theories Through Adjoint Functions. FroCoS 2005: 31-47
[c84]
[c83]Franz Baader, Eldar Karabaev, Carsten Lutz, Manfred Theißen: A New n-Ary Existential Quantifier in Description Logics. KI 2005: 18-33
[e9]Franz Baader, Andrei Voronkov (Eds.): Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings. Lecture Notes in Computer Science 3452, Springer 2005, ISBN 3-540-25236-3- 2004
[c82]Franz Baader, Silvio Ghilardi, Cesare Tinelli: A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics. IJCAR 2004: 183-197
[c81]Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan: Computing the Least Common Subsumer w.r.t. a Background Terminology. Description Logics 2004
[c80]Franz Baader, Baris Sertkaya: Applying Formal Concept Analysis to Description Logics. ICFCA 2004: 261-286
[c79]Franz Baader: Engineering of Logics for the Content-Based Representation of Information. JELIA 2004: 2-3
[c78]Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan: Computing the Least Common Subsumer w.r.t. a Background Terminology. JELIA 2004: 400-412
[c77]Franz Baader: A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. WG 2004: 177-188
[p4]
[i1]Franz Baader, Stephan Tobies: The Inverse Method Implements the Automata Approach for Modal Satisfiability. CoRR abs/cs/0412101 (2004)- 2003
[j33]Franz Baader, Jan Hladik, Carsten Lutz, Frank Wolter: From Tableaux to Automata for Description Logics. Fundam. Inform. 57(2-4): 247-279 (2003)
[j32]Franz Baader, Ulrike Sattler: Description logics with aggregates and concrete domains. Inf. Syst. 28(8): 979-1004 (2003)
[c76]Franz Baader: Restricted Role-value-maps in a Description Logic with Existential Restrictions and Terminological Cycles. Description Logics 2003
[c75]
[c74]Franz Baader, Ralf Küsters, Frank Wolter: Extensions to Description Logics. Description Logic Handbook 2003: 219-261
[c73]
[c72]Franz Baader: Computing the Least Common Subsumer in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics. ICCS 2003: 117-130
[c71]Franz Baader: Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles. IJCAI 2003: 319-324
[c70]Franz Baader: Terminological Cycles in a Description Logic with Existential Restrictions. IJCAI 2003: 325-330
[c69]Franz Baader: The Instance Problem and the Most Specific Concept in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics. KI 2003: 64-78
[c68]Franz Baader, Jan Hladik, Carsten Lutz, Frank Wolter: From Tableaux to Automata for Description Logics. LPAR 2003: 1-32
[e8]Franz Baader (Ed.): Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings. Lecture Notes in Computer Science 2741, Springer 2003, ISBN 3-540-40559-3
[e7]Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, Peter F. Patel-Schneider (Eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press 2003, ISBN 0-521-78176-0- 2002
[j31]Franz Baader, Cesare Tinelli: Deciding the Word Problem in the Union of Equational Theories. Inf. Comput. 178(2): 346-390 (2002)
[j30]Franz Baader, Carsten Lutz, Holger Sturm, Frank Wolter: Fusions of Description Logics and Abstract Description Systems. J. Artif. Intell. Res. (JAIR) 16: 1-58 (2002)
[j29]Franz Baader, Ian Horrocks, Ulrike Sattler: Description Logics for the Semantic Web. KI 16(4): 57-59 (2002)
[c67]Franz Baader, Anni-Yasmin Turhan: On the Problem of Computing Small Representations of Least Common Subsumers. KI 2002: 99-113
[c66]Franz Baader: Engineering of Logics for the Content-Based Representation of Information. RTA 2002: 23
[c65]Franz Baader, Cesare Tinelli: Combining Decision Procedures for Positive Theories Sharing Constructors. RTA 2002: 352-366- 2001
[j28]Dieter Fensel, Franz Baader, Marie-Christine Rousset, Holger Wache: Heterogeneous information resources need semantic access. Data Knowl. Eng. 36(3): 211-213 (2001)
[j27]Franz Baader, Paliath Narendran: Unification of Concept Terms in Description Logics. J. Symb. Comput. 31(3): 277-305 (2001)
[j26]Franz Baader, Ulrike Sattler: An Overview of Tableau Algorithms for Description Logics. Studia Logica 69(1): 5-40 (2001)
[c64]Franz Baader, Stephan Tobies: The Inverse Method Implements the Automata Approach for Modal Satisfiability. IJCAR 2001: 92-106
[c63]Franz Baader, Ralf Küsters: Unification in a Description Logic with Transitive Closure of Roles. Description Logics 2001
[c62]Franz Baader, Anni-Yasmin Turhan: TBoxes do not Yield a Compact Representation of Least Common Subsumers. Description Logics 2001
[c61]Franz Baader, Sebastian Brandt, Ralf Küsters: Matching under Side Conditions in Description Logics. IJCAI 2001: 213-218
[c60]Franz Baader, Ralf Küsters: Unification in a Description Logic with Transitive Closure of Roles. LPAR 2001: 217-232
[p3]
[e6]Franz Baader, Gerhard Brewka, Thomas Eiter (Eds.): KI 2001: Advances in Artificial Intelligence, Joint German/Austrian Conference on AI, Vienna, Austria, September 19-21, 2001, Proceedings. Lecture Notes in Computer Science 2174, Springer 2001, ISBN 3-540-42612-4- 2000
[c59]Franz Baader, Carsten Lutz, Holger Sturm, Frank Wolter: Fusions of Description Logics. Description Logics 2000: 21-30
[c58]Franz Baader, Cesare Tinelli: Combining Equational Theories Sharing Non-Collapse-Free Constructors. FroCoS 2000: 260-274
[c57]Franz Baader, Ralf Molitor: Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis. ICCS 2000: 292-305
[c56]Franz Baader, Ralf Küsters: Matching Concept Descriptions with Existential Restrictions. KR 2000: 261-272
[c55]
[c54]
[e5]Franz Baader, Ulrike Sattler (Eds.): Proceedings of the 2000 International Workshop on Description Logics (DL2000), Aachen, Germany, August 17-19, 2000. CEUR Workshop Proceedings 33, CEUR-WS.org 2000
1990 – 1999
- 1999
[j25]Franz Baader, Ulrike Sattler: Expressive Number Restrictions in Description Logics. J. Log. Comput. 9(3): 319-350 (1999)
[j24]Franz Baader, Ralf Küsters, Alexander Borgida, Deborah L. McGuinness: Matching in Description Logics. J. Log. Comput. 9(3): 411-447 (1999)
[c53]
[c52]Franz Baader, Ralf Küsters: Matching in Description Logics with Existential Restrictions. Description Logics 1999
[c51]Franz Baader, Ralf Molitor: Rewriting in Description Logics Using Terminologies. Description Logics 1999
[c50]Franz Baader, Ralf Molitor, Stephan Tobies: Tractable and Decidable Fragments of Conceptual Graphs. ICCS 1999: 480-493
[c49]Franz Baader, Ralf Küsters, Ralf Molitor: Computing Least Common Subsumers in Description Logics with Existential Restrictions. IJCAI 1999: 96-103
[c48]Franz Baader, Cesare Tinelli: Deciding the Word Problem in the Union of Equational Theories Sharing Constructors. RTA 1999: 175-189
[p2]- 1998
[b1]Franz Baader, Tobias Nipkow: Term rewriting and all that. Cambridge University Press 1998, ISBN 978-0-521-45520-6, pp. I-XII, 1-301
[j23]
[j22]Franz Baader, Klaus U. Schulz: Combination of Constraint Solvers for Free and Quasi-Free Structures. Theor. Comput. Sci. 192(1): 107-161 (1998)
[c47]Franz Baader, Alexander Borgida, Deborah L. McGuinness: Matching in Description Logics: Preliminary Results. Description Logics 1998
[c46]Franz Baader, Ralf Küsters: Least Common Subsumer Computation w.r.t. cyclic ALN-Terminologies. Description Logics 1998
[c45]Franz Baader, Ralf Küsters, Ralf Molitor: Structural Subsumption Considered from an Automata-Theoretic Point of View. Description Logics 1998
[c44]Franz Baader, Paliath Narendran: Unification of Concept Terms in Description Logics. ECAI 1998: 331-335
[c43]Franz Baader, Ulrike Sattler: Description Logics with Concrete Domains and Aggregation. ECAI 1998: 336-340
[c42]Franz Baader, Alexander Borgida, Deborah L. McGuinness: Matching in Description Logics: Preliminary Results. ICCS 1998: 15-34
[c41]Franz Baader, Ralf Küsters: Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions. KI 1998: 129-140- 1997
[j21]Franz Baader, Manfred A. Jeusfeld, Werner Nutt: Intelligent Access to Heterogeneous Information Sources: Report on the 4th Workshop on Knowledge Representation Meets Databases. SIGMOD Record 26(4): 44-48 (1997)
[c40]Franz Baader, Cesare Tinelli: A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method. CADE 1997: 19-33
[c39]Franz Baader, Paliath Narendran: Unification of Concept Terms in Description Logics. Description Logics 1997
[c38]Franz Baader, Ulrike Sattler: Description Logics with Aggregates and Concrete Domains. Description Logics 1997
[c37]Franz Baader: Combination of Compatible Reduction Orderings that are Total on Ground Terms. LICS 1997: 2-13
[e4]Franz Baader, Manfred A. Jeusfeld, Werner Nutt (Eds.): Intelligent Access to Heterogeneous Information, Proceedings of the 4th Workshop KRDB-97, Athens, Greece, August 30, 1997. CEUR Workshop Proceedings 8, CEUR-WS.org 1997- 1996
[j20]Franz Baader, Werner Nutt: Combination problems for commutative/monoidal theories or how algebra can help in equational unification. Appl. Algebra Eng. Commun. Comput. 7(4): 309-337 (1996)
[j19]Franz Baader, Martin Buchheit, Bernhard Hollunder: Cardinality Restrictions on Concepts. Artif. Intell. 88(1-2): 195-213 (1996)
[j18]Franz Baader: Using Automata Theory for Characterizing the Semantics of Terminological Cycles. Ann. Math. Artif. Intell. 18(2-4): 175-219 (1996)
[j17]Franz Baader, Klaus U. Schulz: Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. J. Symb. Comput. 21(2): 211-243 (1996)
[j16]
[j15]Franz Baader: A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages. J. Log. Comput. 6(1): 33-54 (1996)
[c36]Franz Baader, Ulrike Sattler: Number Restrictions on Complex Roles in Description Logics: A Preliminary Report. Description Logics 1996: 3-14
[c35]Franz Baader, Ulrike Sattler: Knowledge Representation in Process Engineering. Description Logics 1996: 74-78
[c34]Franz Baader, Ulrike Sattler: Description Logics with Symbolic Number Restrictions. ECAI 1996: 283-287
[c33]Franz Baader, Ulrike Sattler: Number Restrictions on Complex Roles in Description Logics: A Preliminary Report. KR 1996: 328-339
[e3]Franz Baader, Martin Buchheit, Manfred A. Jeusfeld, Werner Nutt (Eds.): Knowledge Representation Meets Databases, Proceedings of the 3rd Workshop KRDB'96, Budapest, Hungary, August 13, 1996. CEUR Workshop Proceedings 4, CEUR-WS.org 1996- 1995
[j14]Franz Baader, Hans Jürgen Ohlbach: A Multi-Dimensional Terminological Knowledge Representation Language. Journal of Applied Non-Classical Logics 5(2): 153-197 (1995)
[j13]Franz Baader, Bernhard Hollunder: Embedding Defaults into Terminological Knowledge Representation Formalisms. J. Autom. Reasoning 14(1): 149-180 (1995)
[j12]Franz Baader, Bernhard Hollunder: Priorities on Defaults with Prerequisites, and Their Application in Treating Specificity in Terminological Default Logic. J. Autom. Reasoning 15(1): 41-68 (1995)
[j11]Franz Baader, Klaus U. Schulz: Combination Techniques and Decision Problems for Disunification. Theor. Comput. Sci. 142(2): 229-255 (1995)
[c32]Franz Baader, Klaus U. Schulz: On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers. CP 1995: 380-397
[c31]
[c30]
[c29]Franz Baader, Klaus U. Schulz: Combination of Constraint Solving Techniques: An Algebraic POint of View. RTA 1995: 352-366
[e2]Franz Baader, Martin Buchheit, Manfred A. Jeusfeld, Werner Nutt (Eds.): KRDB-95: Reasoning about Structured Objects: Knowledge Representation Meets Databases, Proceedings of the 2nd Workshop KRDB'95, Bielefeld, Germany, Septtember 11-12, 1995. CEUR Workshop Proceedings 2, CEUR-WS.org 1995- 1994
[j10]Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jürgen Profitlich, Enrico Franconi: Am empirical analysis of optimization techniques for terminological representation systems. Appl. Intell. 4(2): 109-132 (1994)
[c28]Franz Baader, Martin Buchheit, Bernhard Hollunder: Cardinality Restrictions on Concepts. KI 1994: 51-62
[c27]Franz Baader, Martin Buchheit, Manfred A. Jeusfeld, Werner Nutt: Reasoning about Structured Objects: Knowledge Representation Meets Databases - Overview. KRDB 1994
[p1]Franz Baader, Jörg H. Siekmann: Unification theory. Handbook of Logic in Artificial Intelligence and Logic Programming (2) 1994: 41-126
[e1]Franz Baader, Martin Buchheit, Manfred A. Jeusfeld, Werner Nutt (Eds.): Reasoning about Structured Objects: Knowledge Representation Meets Databases, Proceedings of 1st Workshop KRDB'94, Saarbrücken, Germany, September 20-22, 1994. CEUR Workshop Proceedings 1, CEUR-WS.org 1994- 1993
[j9]Franz Baader: Unification in Commutative Theories, Hilbert's Basis Theorem, and Gröbner Bases. J. ACM 40(3): 477-503 (1993)
[j8]Franz Baader, Philipp Hanschke, Bernhard Hollunder, Bernhard Nebel, Werner Nutt: ``Third International Conference on Principles of Knowledge Representation and Reasoning (KR'92)'' - Tagungsbericht. KI 7(3): 24-25 (1993)
[c26]Franz Baader, Karl Schlechta: A Semantics for Open Normal Defaults via a Modified Preferential Approach. ECSQARU 1993: 9-16
[c25]Franz Baader, Bernhard Hollunder: How to Prefer More Specific Defaults in Terminological Default Logic. IJCAI 1993: 669-675
[c24]Franz Baader, Klaus U. Schulz: Combination Techniques and Decision Problems for Disunification. RTA 1993: 301-315- 1992
[j7]Franz Baader, Hans-Jürgen Bürckert, Bernhard Hollunder, Armin Laux, Werner Nutt: Terminologische Logiken. KI 6(3): 23-33 (1992)
[c23]Franz Baader, Klaus U. Schulz: Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. CADE 1992: 50-65
[c22]Franz Baader, Werner Nutt: Are Complete an Expressiv Terminological Systems Feasible? Description Logics 1992: 1-5
[c21]Franz Baader, Bernhard Hollunder: Computing Extensions of Terminological Default Theories. ECAI Workshop on Knowledge Representation and Reasoning 1992: 30-52
[c20]Franz Baader, Philipp Hanschke: Extensions of Concept Languages for a Mechanical Engineering Application. GWAI 1992: 132-143
[c19]Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jürgen Profitlich, Enrico Franconi: An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On. KR 1992: 270-281
[c18]Franz Baader, Bernhard Hollunder: Embedding Defaults into Terminological Knowledge Representation Formalisms. KR 1992: 306-317- 1991
[j6]Franz Baader, Alfred Kobsa, Hans-Jürgen Profitlich: AAAI'91 Spring Symposium: Implemented Knowledge Representation and Reasoning Systems. KI 5(3): 24-25 (1991)
[j5]Franz Baader, Bernhard Hollunder: KRIS: Knowledge Representation and Inference System. SIGART Bulletin 2(3): 8-14 (1991)
[c17]Franz Baader: Cyclic, Transitive, and Concrete Extensions of Concept Languages. Description Logics 1991: 12-16
[c16]Franz Baader, Hans-Jürgen Bürckert, Jochen Heinsohn, Bernhard Hollunder, Jürgen Müller, Bernhard Nebel, Werner Nutt, Hans-Jürgen Profitlich: Terminological Knowledge Representation: A Proposal for a Terminological Logic. Description Logics 1991: 120-128
[c15]Franz Baader: Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles. IJCAI 1991: 446-451
[c14]Franz Baader, Philipp Hanschke: A Scheme for Integrating Concrete Domains into Concept Languages. IJCAI 1991: 452-457
[c13]
[c12]Bernhard Hollunder, Franz Baader: Qualifying Number Restrictions in Concept Languages. KR 1991: 335-346
[c11]Franz Baader, Bernhard Hollunder: A Terminological Knowledge Representation System with Complete Inference Algorithms. PDK 1991: 67-86
[c10]Franz Baader: Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems. RTA 1991: 86-97
[c9]Franz Baader, Werner Nutt: Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification. RTA 1991: 124-135- 1990
[c8]Franz Baader: Terminological Cycles in KL-ONE-based Knowledge Representation Languages. AAAI 1990: 621-626
[c7]
[c6]Jürgen Müller, Franz Baader, Bernhard Nebel, Werner Nutt, Gert Smolka: Tutorial on Reasoning and Representation with Concept Languages. CADE 1990: 681
[c5]Franz Baader: A Formal Definition for the Expressive Power of Knowledge Representation Languages. ECAI 1990: 53-58
[c4]
[c3]
1980 – 1989
- 1989
[j4]
[c2]Franz Baader: Unification Properties of Commutative Theories: A Categorical Treatment. Category Theory and Computer Science 1989: 273-299
[c1]- 1988
[j3]
[j2]Franz Baader, Wolfram Büttner: Unification in Commutative Idempotent Monoids. Theor. Comput. Sci. 56: 345-353 (1988)- 1986
[j1]Franz Baader: The Theory of Idempotent Semigroups is of Unification Type Zero. J. Autom. Reasoning 2(3): 283-286 (1986)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-15 21:39 CEST by the dblp team



