Carsten Lutz

Orcid: 0000-0002-8791-6702

Affiliations:
  • University of Leipzig, Germany
  • University of Bremen, Germany (former)


According to our database1, Carsten Lutz authored at least 221 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the non-efficient PAC learnability of conjunctive queries.
Inf. Process. Lett., January, 2024

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster.
CoRR, 2024

Logical Characterizations of Recurrent Graph Neural Networks with Reals and Floats.
CoRR, 2024

The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023
Fitting Algorithms for Conjunctive Queries.
SIGMOD Rec., December, 2023

Answer Counting under Guarded TGDs.
Log. Methods Comput. Sci., 2023

Extremal Fitting CQs do not Generalize.
CoRR, 2023

Extremal Fitting Problems for Conjunctive Queries.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Description Logics with Abstraction and Refinement.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Querying Circumscribed Description Logic Knowledge Bases.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Towards Ontology Construction with Language Models.
Proceedings of the Joint proceedings of the 1st workshop on Knowledge Base Construction from Pre-Trained Language Models (KBC-LM) and the 2nd challenge on Language Models for Knowledge Base Construction (LM-KBC) co-located with the 22nd International Semantic Web Conference (ISWC 2023), 2023

SAT-Based PAC Learning of Description Logic Concepts.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Querying Circumscribed Description Logic Knowledge Bases (Extended Abstract).
Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning (KR 2023 and NMR 2023)., 2023

SAT-based PAC Learning of Description Logic Concepts (Extended Abstract).
Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning (KR 2023 and NMR 2023)., 2023

Efficient Answer Enumeration in Description Logics with Functional Roles.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Efficient Answer Enumeration in Description Logics with Functional Roles - Extended Version.
CoRR, 2022

On the non-efficient PAC learnability of acyclic conjunctive queries.
CoRR, 2022

A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic EL.
Artif. Intell., 2022

Logical separability of labeled data examples under ontologies.
Artif. Intell., 2022

Efficiently Enumerating Answers to Ontology-Mediated Queries.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Ontology-Mediated Querying on Databases of Bounded Cliquewidth.
Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

Conservative Extensions for Existential Rules.
Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Exact Learning of ELI Queries in the Presence of DL-Lite-Horn Ontologies.
Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), 2022

2021
Separating Data Examples by Description Logic Concepts with Restricted Signatures.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

How to Approximate Ontology-Mediated Queries.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Actively Learning Concepts and Conjunctive Queries under ELr-Ontologies.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Enumerating Answers to Ontology-Mediated Queries: Partial Answers and Efficiency (Extended Abstract).
Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

How to Approximate Ontology-Mediated Queries (Extended Abstract.
Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

Actively Learning ELI Queries under DL-Lite Ontologies.
Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

2020
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment.
ACM Trans. Comput. Log., 2020

Holding a Conference Online and Live due to Covid-19: Experiences and Lessons Learned from EDBT / ICDT 2020.
SIGMOD Rec., 2020

Conservative Extensions in Horn Description Logics with Inverse Roles.
J. Artif. Intell. Res., 2020

Separating Positive and Negative Data Examples by Concepts and Formulas: The Case of Restricted Signatures.
CoRR, 2020

Holding a Conference Online and Live due to COVID-19.
CoRR, 2020

The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Logical Separability of Incomplete Data under Ontologies.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

A Journey into Ontology Approximation: From Non-Horn to Horn.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Classifying the Complexity of Ontology-Mediated Queries in EL: From Atomic Queries to Conjunctive Queries (Extended Abstract).
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020

Separating Positive and Negative Data Examples by Concepts and Formulas: The Case of Restricted Signatures (Abstract).
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020

A Journey into Ontology Approximation: From Non-Horn to Horn (Abstract).
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020

The Complexity of Answer Counting for Ontology-Mediated Queries Based on Guarded TGDs (Extended Abstract).
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020

Least General Generalizations in Description Logic: Verification and Existence.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
The Data Complexity of Ontology-Mediated Queries with Closed Predicates.
Log. Methods Comput. Sci., 2019

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics.
Log. Methods Comput. Sci., 2019

Query inseparability for ALC ontologies.
Artif. Intell., 2019

When is Ontology-Mediated Querying Efficient?
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Learning Description Logic Concepts: When can Positive and Negative Examples be Separated?.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Ontology Approximation in Horn Description Logics.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Decidability and Complexity of ALCOIF with Transitive Closure (and More).
Proceedings of the 32nd International Workshop on Description Logics, 2019

Learning Description Logic Concepts: When can Positive and Negative Examples be Separated? (Abstract).
Proceedings of the 32nd International Workshop on Description Logics, 2019

PTime Combined Complexity and FPT in Ontology-Mediated Querying.
Proceedings of the 32nd International Workshop on Description Logics, 2019

A Tour of Franz Baader's Contributions to Knowledge Representation and Automated Deduction.
Proceedings of the Description Logic, Theory Combination, and All That, 2019

2018
Weighted model counting beyond two-variable logic.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Query Expressibility and Verification in Ontology-Based Data Access.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

From Conjunctive Queries to Instance Queries in Ontology-Mediated Querying.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Querying the Unary Negation Fragment with Regular Path Expressions.
Proceedings of the 21st International Conference on Database Theory, 2018

From Conjunctive Queries to SPARQL Queries in Ontology-Mediated Querying.
Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, Arizona, US, October 27th - to, 2018

Complete Approximations of Horn DL Ontologies.
Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, Arizona, US, October 27th - to, 2018

2017
The Data Complexity of Description Logic Ontologies.
Log. Methods Comput. Sci., 2017

Exact Learning of Lightweight Description Logic Ontologies.
J. Mach. Learn. Res., 2017

Probabilistic Description Logics for Subjective Uncertainty.
J. Artif. Intell. Res., 2017

Computing FO-Rewritings in <i>EL</i> in Practice: From Atomic to Conjunctive Queries.
Proceedings of the Semantic Web - ISWC 2017, 2017

Ontology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Query Conservative Extensions in Horn Description Logics with Inverse Roles.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
Proceedings of the 20th International Conference on Database Theory, 2017

Conservative Extensions in Guarded and Two-Variable Fragments.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Ontology-Mediated Querying with EL: Trichotomy and Linear Datalog Rewritability.
Proceedings of the 30th International Workshop on Description Logics, 2017

Horn Rewritability vs PTime Query Answering for Description Logic TBoxes.
Proceedings of the 30th International Workshop on Description Logics, 2017

Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries.
Proceedings of the 30th International Workshop on Description Logics, 2017

An Introduction to Description Logic.
Cambridge University Press, ISBN: 978-0-521-69542-8, 2017

2016
Query and Predicate Emptiness in Ontology-Based Data Access.
J. Artif. Intell. Res., 2016

Query-Based Entailment and Inseparability for ALC Ontologies (Full Version).
CoRR, 2016

Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk).
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey.
Proceedings of the Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering, 2016

Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Conservative Rewritability of Description Logic TBoxes.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Query-Based Entailment and Inseparability for ALC Ontologies.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

FO-Rewritability of Expressive Ontology-Mediated Queries.
Proceedings of the 29th International Workshop on Description Logics, 2016

When is Query Inseparability for ALC Ontologies Decidable?
Proceedings of the 29th International Workshop on Description Logics, 2016

2015
Ontology-Mediated Queries with Closed Predicates.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Schema.org as a Description Logic.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Efficient Query Rewriting in the Description Logic EL and Beyond.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems.
Proceedings of the 18th International Conference on Database Theory, 2015

Query Rewriting Beyond DL-Lite.
Proceedings of the 28th International Workshop on Description Logics, 2015

Conservative Rewritability of Description Logic TBoxes: First Results.
Proceedings of the 28th International Workshop on Description Logics, 2015

Decidability of Circumscribed Description Logics Revisited.
Proceedings of the Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015

2014
Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP.
ACM Trans. Database Syst., 2014

Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331).
Dagstuhl Reports, 2014

Finite Model Reasoning in Horn Description Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Monodic Fragments of Probabilistic First-Order Logic.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Query Rewriting under EL TBoxes: Efficient Algorithms.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

2013
Model-theoretic inseparability and modularity of description logic ontologies.
Artif. Intell., 2013

Ontology-Based Data Access with Closed Predicates is Inherently Intractable(Sometimes).
Proceedings of the IJCAI 2013, 2013

First-Order Rewritability of Atomic Queries in Horn Description Logics.
Proceedings of the IJCAI 2013, 2013

Exact Learning of TBoxes in EL and DL-Lite.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

Ontology-Based Access to Probabilistic Data.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

Finite Model Reasoning in Horn-SHIQ.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

2012
LTL over description logic axioms.
ACM Trans. Comput. Log., 2012

The Combined Approach to OBDA: Taming Role Hierarchies using Filters.
Proceedings of the Joint Workshop on Scalable and High-Performance Semantic Web Systems, 2012

Ontology-Based Access to Probabilistic Data with OWL QL.
Proceedings of the Semantic Web - ISWC 2012, 2012

Non-Uniform Data Complexity of Query Answering in Description Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Query Containment in Description Logics Reconsidered.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Complexity of Branching Temporal Description Logics.
Proceedings of the ECAI 2012, 2012

Mixing Open and Closed World Assumptionin Ontology-Based Data Access: Non-Uniform Data Complexity.
Proceedings of the 2012 International Workshop on Description Logics, 2012

Deciding FO-Rewritability in EL.
Proceedings of the 2012 International Workshop on Description Logics, 2012

2011
Foundations of instance level updates in expressive description logics.
Artif. Intell., 2011

Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics.
Proceedings of the IJCAI 2011, 2011

Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability.
Proceedings of the IJCAI 2011, 2011

The Combined Approach to Ontology-Based Data Access.
Proceedings of the IJCAI 2011, 2011

The Complexity of Probabilistic EL.
Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011

Status QIO: An Update.
Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011

A Closer Look at the Probabilistic Description Logic Prob-EL.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Small is Again Beautiful in Description Logics.
Künstliche Intell., 2010

Deciding inseparability and conservative extensions in the description logic EL.
J. Symb. Comput., 2010

Tutorial Presentations at the Twelfth International Conference on Principles of Knowledge Representation and Reasoning.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Probabilistic Description Logics for Subjective Uncertainty.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

The Combined Approach to Query Answering in DL-Lite.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Decomposing Description Logic Ontologies.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Query and Predicate Emptiness in Description Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Enriching [Escr ][Lscr ]-Concepts with Greatest Fixpoints.
Proceedings of the ECAI 2010, 2010

EL-Concepts go Second-Order: Greatest Fixpoints and Simulation Quantifiers.
Proceedings of the 23rd International Workshop on Description Logics (DL 2010), 2010

Query Answering in the Description Logic S.
Proceedings of the 23rd International Workshop on Description Logics (DL 2010), 2010

2009
Formal Properties of Modularisation.
Proceedings of the Modular Ontologies: Concepts, 2009

PDL with intersection and converse: satisfiability and infinite-state model checking.
J. Symb. Log., 2009

The Complexity of Circumscription in DLs.
J. Artif. Intell. Res., 2009

The complexity of query containment in expressive fragments of XPath 2.0.
J. ACM, 2009

Mathematical Logic for Life Science Ontologies.
Proceedings of the Logic, 2009

Query Answering in Description Logics: The Knots Approach.
Proceedings of the Logic, 2009

Conjunctive Query Answering in the Description Logic EL Using a Relational Database System.
Proceedings of the IJCAI 2009, 2009

Query Answering in Description Logics with Transitive Roles.
Proceedings of the IJCAI 2009, 2009

Combined FO Rewritability for Conjunctive Query Answering in DL-Lite.
Proceedings of the 22nd International Workshop on Description Logics (DL 2009), 2009

Query Answering over DL ABoxes: How to Pick the Relevant Symbols.
Proceedings of the 22nd International Workshop on Description Logics (DL 2009), 2009

2008
The Complexity of Enriched Mu-Calculi.
Log. Methods Comput. Sci., 2008

Conjunctive Query Answering for the Description Logic SHIQ.
J. Artif. Intell. Res., 2008

Temporal Description Logics: A Survey.
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

Conjunctive Query Answering in EL using a Database System.
Proceedings of the Fifth OWLED Workshop on OWL: Experiences and Directions, 2008

CEX and MEX: Logical Diff and Logic-based Module Extraction in a Fragment of OWL.
Proceedings of the Fourth OWLED Workshop on OWL: Experiences and Directions, 2008

Pushing the EL Envelope Further.
Proceedings of the Fourth OWLED Workshop on OWL: Experiences and Directions, 2008

Semantic Modularity and Module Extraction in Description Logics.
Proceedings of the ECAI 2008, 2008

Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes.
Proceedings of the ECAI 2008, 2008

Two Upper Bounds for Conjunctive Query Answering in SHIQ.
Proceedings of the 21st International Workshop on Description Logics (DL2008), 2008

The Projection Problem for EL Actions.
Proceedings of the 21st International Workshop on Description Logics (DL2008), 2008

Logical Difference and Module Extraction with CEX and MEX.
Proceedings of the 21st International Workshop on Description Logics (DL2008), 2008

The Complexity of Conjunctive Query Answering in Expressive Description Logics.
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007
Propositional dynamic logic with recursive programs.
J. Log. Algebraic Methods Program., 2007

A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes.
J. Autom. Reason., 2007

Quantitative temporal logics over the reals: PSpace and below.
Inf. Comput., 2007

Temporalising Tractable Description Logics.
Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), 2007

Data Complexity in the <i>EL</i> Family of Description Logics.
Proceedings of the Logic for Programming, 2007

Conservative Extensions in Expressive Description Logics.
Proceedings of the IJCAI 2007, 2007

A Description Logic of Change.
Proceedings of the IJCAI 2007, 2007

PDL with Intersection and Converse Is 2 EXP-Complete.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Inverse Roles Make Conjunctive Queries Hard.
Proceedings of the 2007 International Workshop on Description Logics (DL2007), 2007

Data Complexity in the EL family of DLs.
Proceedings of the 2007 International Workshop on Description Logics (DL2007), 2007

PDL with Intersection and Converse is 2EXP-complete.
Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

Conservative Extensions in the Lightweight Description Logic EL.
Proceedings of the Automated Deduction, 2007

Description logic.
Proceedings of the Handbook of Modal Logic., 2007

2006
ATL Satisfiability is Indeed EXPTIME-complete.
J. Log. Comput., 2006

Modal Logics of Topological Relations.
Log. Methods Comput. Sci., 2006

Reasoning Support for Ontology Design.
Proceedings of the OWLED*06 Workshop on OWL: Experiences and Directions, 2006

Updating Description Logic ABoxes.
Proceedings of the Proceedings, 2006

Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics.
Proceedings of the Proceedings, 2006

Description Logics with Circumscription.
Proceedings of the Proceedings, 2006

Reasoning About Actions Using Description Logics with General TBoxes.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

The Complexity of Enriched <i>µ</i>-Calculi.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

DL Actions with GCIs: a Pragmatic Approach.
Proceedings of the 2006 International Workshop on Description Logics (DL2006), Windermere, Lake District, UK, May 30, 2006

Efficient Reasoning in <i>EL+</i>.
Proceedings of the 2006 International Workshop on Description Logics (DL2006), Windermere, Lake District, UK, May 30, 2006

CEL - A Polynomial-Time Reasoner for Life Science Ontologies.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

Complexity and succinctness of public announcement logic.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Conservative extensions in modal logic.
Proceedings of the Advances in Modal Logic 6, 2006

2005
2-ExpTime lower bounds for propositional dynamic logics with intersection.
J. Symb. Log., 2005

PDL with Negation of Atomic Programs.
J. Appl. Non Class. Logics, 2005

Keys, Nominals, and Concrete Domains.
J. Artif. Intell. Res., 2005

The complexity of finite model reasoning in description logics.
Inf. Comput., 2005

Quantitative Temporal Logics: PSPACE and Below.
Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 2005

A Tableau Algorithm for Description Logics with Concrete Domains and GCIs.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2005

A New <i>n</i>-Ary Existential Quantifier in Description Logics.
Proceedings of the KI 2005: Advances in Artificial Intelligence, 2005

Pushing the EL Envelope.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

A Tableau Algorithm for DLs with Concrete Domains and GCIs.
Proceedings of the 2005 International Workshop on Description Logics (DL2005), 2005

PDL with Intersection and Converse Is Decidable.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Integrating Description Logics and Action Formalisms: First Results.
Proceedings of the Proceedings, 2005

2004
NEXP TIME-complete description logics with concrete domains.
ACM Trans. Comput. Log., 2004

Temporalising Tableaux.
Stud Logica, 2004

A Correspondence between Temporal Description Logics.
J. Appl. Non Class. Logics, 2004

Combining interval-based temporal reasoning with general TBoxes.
Artif. Intell., 2004

E-connections of abstract description systems.
Artif. Intell., 2004

Description Logics with Concrete Domains and Functional Dependencies.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Mona as a DL Reasoner.
Proceedings of the 2004 International Workshop on Description Logics (DL2004), 2004

2003
From Tableaux to Automata for Description Logics.
Fundam. Informaticae, 2003

A Tableau Algorithm for Reasoning about Concepts and Similarity.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

Resasoning about Concepts and Similarity.
Proceedings of the 2003 International Workshop on Description Logics (DL2003), 2003

Finite Model Reasoning in ALCQI is EXPTIME Logics.
Proceedings of the 2003 International Workshop on Description Logics (DL2003), 2003

E-connections of Description Logics.
Proceedings of the 2003 International Workshop on Description Logics (DL2003), 2003

2002
The complexity of description logics with concrete domains.
PhD thesis, 2002

A Tableau Decision Algorithm for Modalized ALC with Constant Domains.
Stud Logica, 2002

Fusions of Description Logics and Abstract Description Systems.
J. Artif. Intell. Res., 2002

PSpace Reasoning with the Description Logic ALCF(D).
Log. J. IGPL, 2002

Adding Numbers to the SHIQ Description Logic: First Results.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

A proposal for describing services with DLs.
Proceedings of the 2002 International Workshop on Description Logics (DL2002), 2002

Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies.
Proceedings of the 2002 International Workshop on Description Logics (DL2002), 2002

Description Logics with Concrete Domains-A Survey.
Proceedings of the Advances in Modal Logic 4, papers from the fourth conference on "Advances in Modal logic," held in Toulouse, France, 30 September, 2002

2001
Interval-based Temporal Reasoning with General TBoxes.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Description Logics and the Two-Variable Fragment.
Proceedings of the Working Notes of the 2001 International Description Logics Workshop (DL-2001), 2001

Modal Logic and the Two-Variable Fragment.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

Tableaux for Temporal Description Logic with Constant Domains.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

NEXPTIME-Complete Description Logics with Concrete Domains.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000
Mary Likes all Cats.
Proceedings of the 2000 International Workshop on Description Logics (DL2000), 2000

Fusions of Description Logics.
Proceedings of the 2000 International Workshop on Description Logics (DL2000), 2000

The Complexity of Reasoning with Boolean Modal Logics.
Proceedings of the Advances in Modal Logic 3, 2000

1999
A Description Logic with Concrete Domains and a Role-forming Predicate Operator.
J. Log. Comput., 1999

Complexity of Terminological Reasoning Revisited.
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

Reasoning with Concrete Domains.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

A Suggestion for an n-ary Description Logic.
Proceedings of the 1999 International Workshop on Description Logics (DL'99), Linköping, Sweden, July 30, 1999

1998
Foundations of Spatioterminological Reasoning with Description Logics.
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

1997
Defined Topological Relations in Description Logics.
Proceedings of the 1997 International Workshop on Description Logics, 1997


  Loading...