- A Description Logic of Change Alessandro Artale University of Bolzano, Italy artale@inf.unibz.it
- Rewriting in Description Logics Using Terminologies Franz Baader and Ralf Molitor
- Logical Methods in Computer Science Vol. 2 (2:5) 2006, pp. 1--41
- Matching in Description Logics with Existential Restrictions Franz Baader and Ralf Kusters
- Dresden University of Technology Institute for Theoretical Computer Science
- Matching in Description Logics with Existential Restrictions Franz Baader and Ralf Kusters
- Dresden University of Technology Institute for Theoretical Computer Science
- Optimisation Techniques for Combining Constraint Solvers
- E#cient Reasoning in EL + Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn
- Automata-based Pinpointing for DLs Rafael Pe~naloza
- Unification in the Description Logic EL without the Top Concept
- Are Fuzzy Description Logics with General Concept Inclusion Axioms Decidable?
- Query and Predicate Emptiness in Description Logics Franz Baader
- SAT Encoding of Unification in EL Franz Baader and Barbara Morawska
- Axiom Pinpointing in General Tableaux Franz Baader
- An Approach to Exploring Description Logic Knowledge Bases
- Correcting Access Restrictions to a Consequence Martin Knechtel1
- Role-depth Bounded Least Common Subsumers by Completion for EL-and Prob-EL-TBoxes
- Reasoning and Explanation in EL and in Expressive Description Logics
- Description Logics Franz Baader
- Runtime Verification Using a Temporal Description Logic
- Matching Trace Patterns With Regular Policies Franz Baader1
- Exploring Finite Models in the Description Logic ELgfp
- Putting ABox Updates into Action Conrad Drescher, Hongkai Liu, Franz Baader, Peter Steinke, Michael Thielscher
- A Platform to Automatically Generate and Incorporate Documents into an Ontology-Based Content Repository
- Reasoning With Weighted Ontologies Rafael Pe~naloza
- Using Tableaux and Automata for Pinpointing Rafael Pe~naloza
- OntoComP: A Protege Plugin for Completing OWL Ontologies
- OntoComP System Description Baris Sertkaya
- LTL over Description Logic Axioms Franz Baader , Silvio Ghilardi, and Carsten Lutz
- LTL over Description Logic Axioms Franz Baader
- Automata Can Show PSpace Results for Description Logics
- Complexity of Abduction in the EL Family of Lightweight Description Logics
- Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
- Access restriction inside ontologies Extended abstract
- Explaining User Errors in Description Logic Knowledge Base Completion
- Empirical evaluation of reasoning in lightweight DLs on life science ontologies
- A Modularization-Based Approach to Finding All Justifications for OWL DL Entailments
- Completing Description Logic Knowledge Bases using Formal Concept Analysis
- Pinpointing in the Description Logic EL+ Franz Baader1
- Computing the Least Common Subsumer w.r.t. a Background Terminology 1
- Inverse Roles Make Conjunctive Queries Hard Carsten Lutz
- Conservative Extensions in Expressive Description Logics Carsten Lutz1
- Conservative Extensions in the Lightweight Description Logic EL
- Planning in Action Formalisms based on DLs: First Results
- Speeding up Approximation with nicer Concepts Anni-Yasmin Turhan and Yusri Bong
- CEL--A Polynomial-time Reasoner for Life Science Ontologies
- Complexity of language equations with one-sided concatenation and all Boolean operations
- A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability
- Description Logics with Circumscription Piero Bonatti
- Did I Damage my Ontology? A Case for Conservative Extensions in Description Logic
- DL Actions with GCIs: a Pragmatic Approach , M. Milicic1
- Reasoning about Actions using Description Logics with general TBoxes
- Updating Description Logic ABoxes Hongkai Liu1
- Complexity and Succinctness of Public Announcement Carsten Lutz
- A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes
- Pushing the EL Envelope Franz Baader and Sebastian Brandt and Carsten Lutz
- A Description Logic Based Approach to Reasoning about Web Services
- Integrating Description Logics and Action Formalisms: First Results
- Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice?
- A Generator for Description Logic Formulas Theoretical Computer Science, TU Dresden
- A Tableau Algorithm for DLs with Concrete Domains and GCIs
- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific
- A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability
- Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and--What Else?
- Spinoza's Ontology hladik@tcs.inf.tu-dresden.de
- Tableau Systems for SHIO and SHIQ , Jorg Model
- Sonic --System Description Anni-Yasmin Turhan and Christian Kissig
- Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles
- Decidability of with Complex Role Inclusion Axioms
- "!#$"%'&)(10 2 345687'9@A9@B CEDGFIHQPSRUTWVYXa`cb RdFfe gihaDSbpRGqsrHtFauwv
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Faculty of Computer Science Institute of Theoretical Computer Science, Chair of Automata Theory Martin Knechtel
- Action, Time and Space in Description Logics
- On the Computation of Common Subsumers in Description Logics
- The Complexity of Description Logics with Concrete Domains
- Unterstutzung der Modellierung verfahrenstechnischer Prozesse durch
- Query-Based Access Control for Ontologies Martin Knechtel1
- A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes
- ATL Satisfiability is Indeed ExpTime-Complete Dirk Walther1
- Automata-Based Axiom Pinpointing Franz Baader1,
- A Finite Basis for the Set of EL-Implications Holding in a Finite Model
- Description Logic reasoning for Semantic web ontologies Extended abstract
- Dresden University of Technology Institute for Theoretical Computer Science
- A Data Warehouse Conceptual Data Model for Multidimensional Aggregation
- Combining Interval-based Temporal Reasoning with General TBoxes
- Knowledge representation in process engineering Franz Baader and Ulrike Sattler
- Dresden University of Technology Institute for Theoretical Computer Science
- LTCS--Report Aachen University of Technology
- LTCS{Report Aachen University of Technology
- A Tableau Algorithm for the Clique Guarded Fragment Extended Abstract
- A Scheme for Integrating Concrete Domains into Concept Languages
- Dresden University of Technology Institute for Theoretical Computer Science
- PSPACE Reasoning for Graded Modal Logics Stephan Tobies
- Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL
- Dresden University of Technology Institute for Theoretical Computer Science
- Reasoning in ELH w.r.t. General Concept Inclusion Axioms
- PSpace Reasoning with the Description Logic ALCF(D)
- Connecting many-sorted theories Franz Baader 1 and Silvio Ghilardi 2
- Kombination freier Strukturen Diplomarbeit
- LTCS--Report Aachen University of Technology
- LTCS--Report Aachen University of Technology
- Computing the Least Common Subsumer w.r.t. a Background Terminology
- Fusions of Description Logics Franz Baader and Carsten Lutz
- Combination of Compatible Reduction Orderings that are Total on Ground Terms
- Unification Theory --An Introduction \Lambda Franz Baader
- A Novel Architecture for Situation Awareness Systems Franz Baader1, Andreas Bauer2,3, Peter Baumgartner2,3,
- Prime Implicate Normal Form for ALC Concepts Meghyn Bienvenu
- Pushing the EL Envelope Further Franz Baader1
- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Speci c
- Combining Decision Procedures for Positive Theories Sharing Constructors
- Computing the Least Common Subsumer w.r.t. a Background Terminology ?
- A PSpace Algorithm for Graded Modal Logic Stephan Tobies ?
- A NExpTimecomplete Description Logic Strictly Contained in C 2
- A.1 Semantische Integration und Wiederverwendung von Produktontologien fr offene Marktpltze im
- Dresden University of Technology Institute for Theoretical Computer Science
- Speeding up Approximation with nicer Concepts AnniYasmin Turhan # and Yusri Bong
- A Generic Approach for Correcting Access Restrictions to a Consequence
- MODDO -A TAILORED DOCUMENTATION SYSTEM FOR MODEL-DRIVEN SOFTWARE DEVELOPMENT
- Computing a Minimal Representation of the Subsumption Lattice of All Conjunctions of Concepts Defined in a
- Dresden University of Technology Institute for Theoretical Computer Science
- Terminological Knowledge Representation: A Proposal for a Terminological Logic
- Technical Reports Lehrstuhl fur Automatentheorie
- LTCS--Report Aachen University of Technology
- ``What's not in a name?'' Initial Explorations of a Structural Approach to Integrating Large
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Data Complexity in the EL family of DLs Adila Krisnadhi1
- Least common subsumer computation w.r.t. cyclic ALN terminologies Franz Baader and Ralf Kusters
- NExpTime-complete Description Logics with Concrete Domains
- On the Complexity of Counting in Description Logics Stephan Tobies
- Journal of Arti cial Intelligence Research 12 (2000) Submitted 12/1999; published 5/2000 The Complexity of Reasoning with Cardinality Restrictions
- Description Logics as Ontology Languages for the Semantic Web
- Computing least common subsumers for FLE + Sebastian Brandt and AnniYasmin Turhan #
- A Description Logic with Transitive and Inverse Roles and Role Hierarchies Ian Horrocks \Lambda
- Representing and Reasoning on Conceptual Queries Over Image Databases
- LTCS--Report Aachen University of Technology
- LTCS--Report Aachen University of Technology
- Modal Logics of Topological Relations Carsten Lutz
- Keys, Nominals, and Concrete Domains Carsten Lutz 1 Carlos Areces 2 Ian Horrocks 3 Ulrike Sattler 1
- LTCS{Report Aachen University of Technology
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Semantic Modularity and Module Extraction in Description Logics
- SI! Automata Can Show PSpace Results for Description Logics
- Computing the Least Common Subsumer w.r.t. a Background Terminology 1
- The Hybrid -Calculus Ulrike Sattler 1? and Moshe Y. Vardi 2
- TBoxes do not yield a compact representation of least common subsumers
- Characterizing the semantics of terminological cycles with the help of finite automata
- Concrete Domains and Nominals United Carlos Areces
- E-connections of Description Logics Oliver Kutz
- Dresden University of Technology Institute for Theoretical Computer Science
- LTCS--Report Aachen University of Technology
- Adding Numbers to the SHIQ Description Logic|First Results Carsten Lutz
- PDL with Intersection and Converse is Carsten Lutz
- Subsumption in EL w.r.t. hybrid TBoxes Sebastian Brandt and Jorg Model
- Implementing Matching in ALN Sebastian Brandt
- Description Logics as Ontology Languages for the Semantic Web
- Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice?
- The Complexity of Enriched -Calculi Piero A. Bonatti1
- Dresden University of Technology Institute for Theoretical Computer Science
- Applying Formal Concept Analysis to Description Logics
- Uni cation Theory Franz Baader
- LTCS{Report Aachen University of Technology
- Intervalbased Temporal Reasoning with General TBoxes Carsten Lutz
- Reasoning about concepts and similarity Carsten Lutz, Frank Wolter and Michael Zakharyaschev
- A Finite Basis for the Set of ELImplications Holding in a Finite Model
- Dresden University of Technology Institute for Theoretical Computer Science
- A concept language extended with different kinds of transitive roles Ulrike Sattler
- Hardness of Enumerating PseudoIntents in the Lectic Order
- Computing the least common subsumer in the description logic EL w.r.t. terminological cycles
- Computing the least common subsumer in the description logic EL w.r.t. terminological cycles
- Debugging Snomed ct Using Axiom Pinpointing in the Description Logic EL+
- BioMed Central Page 1 of 6
- Reintroducing CEL as an OWL 2 EL Reasoner Julian Mendez and Boontawee Suntisrivaraporn
- A New n-ary Existential Quantifier in Description Logics
- Sonic --Non-standard Inferences go OilEd Anni-Yasmin Turhan and Christian Kissig
- Reasoning with Axioms: Theory and Practice Ian Horrocks
- Dresden University of Technology Institute for Theoretical Computer Science
- A Concept Language for an engineering application with part--whole Ulrike Sattler \Lambda
- What's in an Attribute? Consequences for the Least Common Subsumer \Lambda
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Quantitative Temporal Logics: PSPACE and below Carsten Lutz1
- Two Upper Bounds for Conjunctive Query Answering in SHIQ
- Data Complexity in the EL family of Description Logics Adila Krisnadhi1
- LTCS{Report Aachen University of Technology
- Towards Approximative Most Specific Concepts by Completion for EL with Subjective Probabilities
- Complexity Results and Practical Algorithms for Logics in Knowledge Representation
- Charakterisierung der Semantik terminologischer Zyklen
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Pushing Doors for Modeling Contexts with OWL DL --a Case Study AnniYasmin Turhan ? and Thomas Springer ?? and Michael Berger y
- Unterst utzung der Modellierung verfahrenstechnischer Prozesse durch
- LTCS--Report Aachen University of Technology
- Dresden University of Technology Institute for Theoretical Computer Science
- Bibliography Lehrstuhl fur Automatentheorie
- Embedding Defaults into Terminological Knowledge Representation Formalisms
- Dresden University of Technology Institute for Theoretical Computer Science
- Matching under Side Conditions in Description Logics
- Reasoning in ELH w.r.t. General Concept Inclusion Axioms
- Connecting many-sorted structures and theories through adjoint functions
- A Proposal for Describing Services with DLs Carsten Lutz and Ulrike Sattler
- LTCS{Report Aachen University of Technology
- A RuleBased Language for Ordered Multidimensional Databases \Lambda
- Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice?
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- The Inverse Method Implements the Automata Approach for Modal Satis ability
- On the problem of computing small representations of least common subsumers
- A Correspondence between Temporal Description Logics Alessandro Artale
- On Subsumption and Instance Problem in ELH w.r.t. General TBoxes
- The Projection Problem for EL Actions Hongkai Liu , Carsten Lutz, Maja Milicic
- A Terminological Knowledge Representation System with Complete Inference Algorithms
- LTCS--Report Aachen University of Technology
- Dresden University of Technology Institute for Theoretical Computer Science
- SI! Automata Can Show PSpace Results for Description Logics
- A Tableau Algorithm for the Clique Guarded Fragment
- Using SumsofProducts for Nonstandard Rafael Penaloza
- A Tableau System for the Description Logic SHIO
- LTCS{Report Aachen University of Technology
- Line Drawing, Leap Years, and Euclid MITCHELL A. HARRIS
- Complexity of Planning in Action Formalisms Based on Description Logics
- Unification of Concept Terms in Description Logics Franz Baader \Lambda
- Sonic | System Description Anni-Yasmin Turhan and Christian Kissig
- Combining Equational Theories Sharing NonCollapseFree Constructors
- A Translation of Looping Alternating Automata into Description Logics
- Combining Constraint Solving Franz Baader 1 & Klaus U. Schulz 2
- Tableaux for temporal description logic with constant domains
- Rewriting Concepts Using Terminologies Franz Baader, Ralf Kusters, and Ralf Molitor
- Description Logics with Aggregates and Concrete Domains F. Baader, U. Sattler, \Lambda
- The Journal of Symbolic Logic Volume 72, Number 2, June 2007
- Unification in the Description Logic EL Franz Baader and Barbara Morawska
- Dresden University of Technology Institute for Theoretical Computer Science
- Using OWL DL Reasoning to decide about authorization in RBAC
- PDL with Intersection and Converse is 2EXP-complete Stefan Goller1
- Ontology Reasoning in the SHOQ(D) Description Logic Ian Horrocks
- Dresden University of Technology Institute for Theoretical Computer Science
- A Correspondence between Temporal Descrip tion Logics
- PDL with Negation of Atomic Programs Carsten Lutz and Dirk Walther
- Uni cation in a Description Logic with Inconsistency and Transitive Closure of Roles
- Journal of Artificial Intelligence Research () Submitted ; published Keys, Nominals, and Concrete Domains
- The Complexity of the Graded Calculus Orna Kupferman 1 , Ulrike Sattler 2 , Moshe Y. Vardi 3?
- Forschungszentrum fr Knstliche
- The instance problem and the most speci c concept in the description logic EL w.r.t.
- A New n-ary Existential Quanti er in Description Logics
- A Generic Data Model for Video Content Based Retrieval Cyril Decleir 1 MohandSaid Hacid 2 Jacques Kouloumdjian 1
- Module Extraction and Incremental Classification: A Pragmatic Approach for EL+
- Towards Approximative Most Specific Concepts by Completion for EL with Subjective Probabilities
- Using Sums-of-Products for Non-standard Rafael Pe~naloza
- Computing the hierarchy of conjunctions of concept names and their negations in a
- LTCS--Report Aachen University of Technology
- LTCS--Report Aachen University of Technology
- Complexity of Terminological Reasoning Carsten Lutz
- Dresden University of Technology Institute for Theoretical Computer Science
- LTCS--Report Aachen University of Technology
- Dresden University of Technology Institute for Theoretical Computer Science
- Description Logics for Ontologies Ulrike Sattler
- Complexity of Axiom Pinpointing in the DL-Lite Family
- Pinpointing in the Description Logic EL Franz Baader1
- Hardness of Enumerating Pseudo-Intents in the Lectic Order
- Combination of Constraint Solving Techniques
- NExpTime-complete Description Logics with Concrete Domains
- A RuleBased Data Manipulation Language for OLAP Systems ?
- LTCS{Report Aachen University of Technology
- Description Logics with Concrete Domains|A Survey
- LTCS--Report Aachen University of Technology
- LTCS{Report Aachen University of Technology
- An Approach to Exploring Description Logic Knowledge Bases
- The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000
- Distributed Splicing of RE with 6 Test Tubes Monika Sturm and Thomas Hinze
- Completing Description Logic Knowledge Bases using Formal Concept Analysis Franz Baader,1
- Putting ABox Updates into Action Conrad Drescher, Hongkai Liu, Franz Baader, Steffen Guhlemann, Uwe
- The Complexity of Reasoning with Boolean Modal Logics
- Combining Equational Theories Sharing NonCollapseFree Constructors
- LTCS--Report Aachen University of Technology
- LTCS{Report Aachen University of Technology
- MAXPLANCKINSTITUT \Omega \Psi
- How to decide Query Containment under Constraints using a Description Logic
- DIG 2.0 --Towards a Flexible Interface for Description Logic Reasoners
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- PSpace Automata for Description Logics Rafael Pe~naloza
- Pushing the Sonic Border --Sonic 1.0 Anni-Yasmin Turhan
- Towards an invitro Implementation of a Universal Distributed Splicing Model for DNA Computation
- Universelle Modelle und ausgew ahlte Algorithmen des DNAComputing
- Design und Implementierung einer Plattform zur Verifikation
- Replacing SEPTriplets in SNOMED CT using Tractable Description Logic Operators
- Konsistenz von Wissensbasen in Beschreibungslogiken mit Rollenoperatoren
- Modeling and Querying Video Data: A Hybrid Approach \Lambda Cyril Decleir
- Dresden University of Technology Institute for Theoretical Computer Science
- How to decide Query Containment under Constraints using a Description Logic
- Dresden University of Technology Institute for Theoretical Computer Science
- A Practical Approach for Computing Generalization Inferences in EL
- Computing Updates in Description Logics
- Dresden University of Technology Institute for Theoretical Computer Science
- Computing the Least Common Subsumer w.r.t. a Background Terminology
- SNOMED CT's Problem List: Ontologists' and Logicians' Therapy Suggestions Stefan Schulza,b
- Complexity Results and Practical Algorithms for Logics in Knowledge Representation
- Dresden University of Technology Institute for Theoretical Computer Science
- Temporal Description Logics: A Survey Carsten Lutz
- Unification in the Union of Disjoint Equational Theories: Combining Decision
- LTCS--Report Aachen University of Technology
- LTCS--Report Aachen University of Technology
- Using lazy unfolding for the computation of least common subsumers
- A RuleBased Data Manipulation Language for OLAP Systems ?
- LTCS--Report Aachen University of Technology
- Description Logics and the Two-Variable Carsten Lutz y , Ulrike Sattler y , and Frank Wolter z
- A Semantic Modeling Approach for Video Retrieval by Content \Lambda Edoardo Ardizzone MohandSaid Hacid y
- Description Logics for the Representation of Aggregated Ulrike Sattler 1
- Optimisation Techniques for Combining Constraint Solvers
- Allgemeine ACUnifikation durch Variablenabstraktion
- Dresden University of Technology Institute for Theoretical Computer Science
- R. Kontchakov M.Zakharyaschev
- Vergleich zweier semantischer zur Unifikation
- Mona as a DL Reasoner Eldar Karabaev and Carsten Lutz
- Truth--A Platform for Verification of Distributed Systems
- The Complexity of Finite Model Reasoning in Description Logics
- Please cite this article in press as: S. Schulz, et al., SNOMED reaching its adolescence: Ontologists' and logicians' health check, Int. J. Med. Inform. (2008), doi:10.1016/j.ijmedinf.2008.06.004
- DIG 2.0 Towards a Flexible Interface for Description Logic Reasoners
- Logical Methods in Computer Science Vol. 6 (3:17) 2010, pp. 131
- A Description Logic with Concrete Domains and a Roleforming Predicate Operator #
- Unification of Concept Terms --Extended Abstract --
- Deciding the Word Problem in the Union of Equational Theories
- Unification in a Description Logic with Transitive Closure of Roles
- Using Non-standard Inferences in Description Logics|what does it buy me?
- Dresden University of Technology Institute for Theoretical Computer Science
- Practical Reasoning for Very Expressive Description Logics
- Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice?
- LTCS--Report Aachen University of Technology
- On the Complexity of Axiom Pinpointing in the EL Family of Description Logics Rafael Pe~naloza
- Formal Properties of Modularisation Boris Konev1
- Logical Difference and Module Extraction with CEX and MEX
- Conservative extensions in modal logic S. Ghilardi, C. Lutz, F. Wolter and M. Zakharyaschev
- Connecting many-sorted theories Franz Baader1
- Towards the Complexity of Recognizing Pseudo-intents
- LTCS--Report Aachen University of Technology
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- From Tableaux to Automata for Description Logics
- LTCS--Report Aachen University of Technology
- Modeling and Querying Video Databases \Lambda Cyril Decleir
- Pushing the Sonic Border | Sonic 1.0 ? Anni-Yasmin Turhan
- Finite Model Reasoning in ALCQI is ExpTime-complete
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- A Data Warehouse Conceptual Data Model for Multidimensional Aggregation
- Connecting many-sorted structures and theories through adjoint functions
- LTCS{Report Aachen University of Technology
- Implementierung eines Entscheidungsverfahrens
- A New n-ary Existential Quanti er in Description Logics
- Access Policy Design Supported by FCA Frithjof Dau and Martin Knechtel
- Conjunctive Query Answering for the Description Logic SHIQ Birte Glimm1
- Inhaltsverzeichnis 1 Einfuhrung 1
- Verifying Properties of Infinite Sequences of Description Logic Actions
- Non-standard Inferences in Description Logics: The Story So Far
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- Explaining User Errors in Knowledge Base Completion
- BDDBased Decision Procedures for K Guoqiang Pan 1? , Ulrike Sattler 2 , Moshe Y. Vardi 1?
- Practical Reasoning for Expressive Description Ian Horrocks 1 and Ulrike Sattler 2 and Stephan Tobies 2
- Dresden University of Technology Institute for Theoretical Computer Science
- On the Complexity of Computing Generators of Closed Sets
- CEX and MEX: Logical Diff and Semantic Module Extraction in a Fragment of OWL
- Replacing SEP-Triplets in SNOMED CT using Tractable Description Logic Operators
- Temporalising Tractable Description Logics A. Artale R. Kontchakov C. Lutz
- Description Logics over Lattices with Multi-valued Ontologies Stefan Borgwardt and Rafael Pe~naloza
- Access rights and collaborative ontology integration for reuse across security domains
- A New n-ary Existential Quantifier in Description Logics
- Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms
- Reasoning Support for Ontology Design Carsten Lutz, Franz Baader, Enrico Franconi, Domenico Lembo, Ralf Moller,
- Dresden University of Technology Institute for Theoretical Computer Science
- LTCS{Report Aachen University of Technology
- LTCS{Report Aachen University of Technology
- LTCS--Report Aachen University of Technology
- An Approach for Optimized Approximation Sebastian Brandt and Anni-Yasmin Turhan
- Building and Structuring Description Logic Knowledge Bases Using Least Common
- Mary Likes all Cats Carsten Lutz and Ulrike Sattler
- LTCS{Report Aachen University of Technology
- Dresden University of Technology Institute for Theoretical Computer Science
- The Complexity of Finite Model Reasoning in Description Logics 1
- LTCS--Report Aachen University of Technology
- Terminological knowledge representation systems in a process engineering application
- LTCS--Report Aachen University of Technology
- Knowledge representation in process engineering Ulrike Sattler
- DESCRIPTION LOGIC Franz Baader and Carsten Lutz
- Practical Reasoning for Description Logics with Functional Restrictions, Inverse and Transitive Roles, and Role Hierarchies \Lambda
- Reasoning with Concrete Domains Carsten Lutz
- Lehrstuhl f ur Prozetechnik Lehr und Forschungsgebiet Theoretische Informatik
- Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies
- An Overview of Tableau Algorithms for Description Logics Franz Baader (baader@cs.rwthaachen.de) and Ulrike Sattler
- Dresden University of Technology Institute for Theoretical Computer Science
- Optimised Reasoning for Ian Horrocks and Ulrike Sattler
- Axiom Pinpointing is Hard Rafael Pe~naloza and Baris Sertkaya
- Pushing Doors for Modeling Contexts with OWL DL a Case Study Anni-Yasmin Turhan and Thomas Springer and Michael Berger
- Blocking Automata for PSpace DLs Franz Baader1
- LTCS--Report Aachen University of Technology
- LTCS--Report Aachen University of Technology
- Forschungszentrum fr Knstliche
- Quantitative Temporal Logics over the Reals: PSpace and below
- Description Logics with Concrete Domains|A Survey
- Dresden University of Technology Institute for Theoretical Computer Science
- Description Logics with Symbolic Number Restrictions Franz Baader and Ulrike Sattler 1
- Optimised Reasoning for SHIQ Ian Horrocks 1 and Ulrike Sattler 2
- Dresden University of Technology Institute for Theoretical Computer Science
- A Suggestion for an nary Description Logic C. Lutz, U. Sattler, and S. Tobies
- Dresden University of Technology Institute for Theoretical Computer Science
- Tractable and Decidable Fragments of Conceptual Graphs ?
- Description Logics with Concrete Domains and Functional Dependencies
- Description Logics with Concrete Domains and Aggregation
- LTCS{Report Aachen University of Technology
- The Complexity of Description Logics with Concrete Domains
- [SS89] M. SchmidtSchau, ``Unification in a combination of arbitrary dis joint equational theories,'' J. Symbolic Computation 8, pp.51--99,
- http://www.lsv.ens-cachan.fr/Publis/ To appear in Fundamenta Informaticae.
- LTCS--Report Aachen University of Technology
- LTCS{Report Aachen University of Technology
- Small is Again Beautiful in Description Logics Franz Baader, Carsten Lutz, Anni-Yasmin Turhan
- Polynomial-Time Reasoning Support for Design and Maintenance of
- The Inclusion Problem for Weighted Automata on Infinite Trees
- Restricted role-value-maps in a description logic with existential restrictions and terminological cycles
- Computing the Least Common Subsumer w.r.t. a Background Terminology
- Dresden University of Technology Institute for Theoretical Computer Science
- Econnections of abstract description systems Oliver Kutz a , Carsten Lutz b , Frank Wolter a ,
- LTCS--Report Aachen University of Technology
- Journal of Arti cial Intelligence Research 16 (2002) 1-58 Submitted 7/01; published 1/02 Fusions of Description Logics and Abstract Description
- A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability
- Logicbased Knowledge Representation ? Franz Baader
- LTCS--Report Aachen University of Technology
- Expressive number restrictions in Description Logics \Lambda Franz Baader and Ulrike Sattler
- PDL with negation of atomic programs Carsten Lutz y ---Dirk Walther z
- Dresden University of Technology Institute for Theoretical Computer Science
- Fundamenta Informaticae 57 (2003) 1--33 1 From Tableaux to Automata for
- Journal of Artificial Intelligence Research 31 (2008) 157-204 Submitted 06/07; published 01/08 Conjunctive Query Answering for the Description Logic
- Propositional Dynamic Logic with Recursive Christof Loding
- The Complexity of Query Containment in Expressive Fragments of XPath 2.0
- RBAC AUTHORIZATION DECISION WITH DL Martin Knechtel, Jan Hladik
- Computing the hierarchy of conjunctions of concept names and their negations in a
- Integrating Description Logics and Action Formalisms: First Results Franz Baader1
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Some Computational Problems Related to Pseudo-Intents
- Efficient Reasoning in EL+ Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn
- %' )!0$1%'23%4 567(%41 Dissertation
- Dresden University of Technology Institute for Theoretical Computer Science
- Reasoning with Individuals for the Description Logic Ian Horrocks 1 , Ulrike Sattler 2 , and Stephan Tobies 2
- Implementing the n-ary Description Logic GF1 LuFG Theoretical Computer Science, RWTH Aachen, Germany
- Description Logics with Aggregates and Concrete Domains
- Implementation and Evaluation of a Tableau Algorithm
- Reasoning about Nominals with FaCT and Racer
- Dresden University of Technology Institute for Theoretical Computer Science
- Optimisation of Terminological Reasoning Ian Horrocks Stephan Tobies
- CEL---A Polynomialtime Reasoner for Life Science Ontologies #
- Sonic | Non-standard Inferences go OilEd Anni-Yasmin Turhan and Christian Kissig ?
- Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL
- Usability Issues in Description Logic Knowledge Base Completion
- Dresden University of Technology Institute for Theoretical Computer Science
- Unification in the Description Logic EL without the Top Concept
- On the Undecidability of Fuzzy Description Logics with GCIs and Product t-norm
- Correcting Access Restrictions to a Consequence More Flexibly
- Fuzzy Ontologies over Lattices with T-norms Stefan Borgwardt and Rafael Pe~naloza
- Dresden University of Technology Institute for Theoretical Computer Science
- GCIs Make Reasoning in Fuzzy DL with the Product T-norm Undecidable
- How should parthood relations be expressed in Franz Baader,1
- Fast Computation of Proper Premises Uwe Ryssel1
- Dresden University of Technology Institute for Theoretical Computer Science
- Learning Description Logic Knowledge Bases from Data
- Some Complexity Results about Essential Closed Sets
- Implementing completion-based inferences for the EL-family
- Foundations of Instance Level Updates in Expressive Description Logics
- Dresden University of Technology Institute for Theoretical Computer Science
- Finite Lattices Do Not Make Reasoning In ALCI Harder
- Dresden University of Technology Institute for Theoretical Computer Science
- Undecidability of Fuzzy Description Logics Stefan Borgwardt
- Mining of EL-GCIs Daniel Borchmann and Felix Distel
- Context-Dependent Views to Axioms and Consequences of Semantic Web Ontologies Franz Baadera
- Finding Finite Herbrand Models Stefan Borgwardt and Barbara Morawska
- Dresden University of Technology Institute for Theoretical Computer Science
- Dresden University of Technology Institute for Theoretical Computer Science
- Solving language equations and disequations with applications to disunification in description
