- Titel
- LTCS-Report
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-785040
- DOI
- https://doi.org/10.25368/2022.63
- Abstract (EN)
- This series consists of technical reports produced by the members of the Chair for Automata Theory at TU Dresden. The purpose of these reports is to provide detailed information (e.g., formal proofs, worked out examples, experimental results, etc.) for articles published in conference proceedings with page limits. The topics of these reports lie in different areas of the overall research agenda of the chair, which includes Logic in Computer Science, symbolic AI, Knowledge Representation, Description Logics, Automated Deduction, and Automata Theory and its applications in the other fields.
- Freie Schlagwörter (DE)
- Logik in der Informatik Wissensrepräsentation Beschreibungslogiken Automatisches Theorembeweisen Automatentheorie und ihre Anwendungen
- Freie Schlagwörter (EN)
- Logic in Computer Science Knowledge Representation Description Logics Automated Deduction Automata Theory and Applications
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Herausgeber (Institution)
- Technische Universität Dresden
- Version / Begutachtungsstatus
- publizierte Version / Verlagsversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-785040
- Veröffentlichungsdatum Qucosa
- 17.03.2022
- Dokumenttyp
- Schriftenreihe
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0
- Optimal Repairs in the Description Logic EL Revisited - 23-03
- Optimal Fixed-Premise Repairs of EL TBoxes - 22-04
- Pushing Optimal ABox Repair from EL Towards More Expressive Horn-DLs - 22-02
- Optimal ABox Repair w.r.t. Static EL TBoxes: from Quantified ABoxes back to ABoxes - 22-01
- Privacy-Preserving Ontology Publishing: - 21-04
- Two Ways of Explaining Negative Entailments in Description Logics Using Abduction - 21-03
- Restricted Unification in the DL FL₀ - 21-02
- Computing Optimal Repairs of Quantified ABoxes w.r.t. Static EL TBoxes - 21-01
- An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics - 20-10
- Computing Safe Anonymisations of Quantified ABoxes w.r.t. EL Policies - 20-09
- Computing Compliant Anonymisations of Quantified ABoxes w.r.t. EL Policies - 20-08
- Deductive Module Extraction for Expressive Description Logics - 20-06
- Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics - 20-05
- Deciding the Word Problem for Ground Identities with Commutative and Extensional Symbols - 20-02
- Using model theory to find w-admissible concrete domains - 20-01
- On the Complexity and Expressiveness of Description Logics with Counting - 19-09
- Role-Value Maps and General Concept Inclusions in the Description Logic FL₀ - 19-08
- Finite Herbrand Models for Restricted First-Order Clauses - 19-07
- Practical Query Rewriting for DL-Lite with Numerical Predicates - 19-06
- Ontology-Mediated Probabilistic Model Checking - 19-05
- Projection in a Description Logic of Context with Actions - 19-04
- Maybe Eventually? Towards Combining Temporal and Probabilistic Description Logics and Queries - 19-03
- Joining implications in formal contexts and inductive learning in a Horn description logic - 19-02
- Privacy-Preserving Ontology Publishing for EL Instance Stores - 19-01
- From Horn-SRIQ to Datalog - 18-14
- Ontology-Based Query Answering for Probabilistic Temporal Data - 18-13
- Learning description logic axioms from discrete probability distributions over description graphs - 18-12
- Most specific consequences in the description logic EL - 18-11
- The distributive, graded lattice of EL concept descriptions and its neighborhood relation - 18-10
- Contextualized Programs for Ontology-Mediated Probabilistic System Analysis - 18-09
- Actions with Conjunctive Queries: - 18-08
- Ontology-Mediated Query Answering for Probabilistic Temporal Data with EL Ontologies - 18-07
- On the Complexity of Verifying Timed Golog Programs over Description Logic Actions - 18-06
- Standard and Non-Standard Inferences in the Description Logic FL₀ Using Tree Automata - 18-04
- Terminological knowledge aquisition in probalistic description logic - 18-03
- Repairing Description Logic Ontologies by Weakening Axioms - 18-01
- Constructing SNOMED CT Concepts via Disunification - 17-07
- Temporal Query Answering in DL-Lite over Inconsistent Data - 17-06
- Using Ontologies to Query Probabilistic Numerical Data - 17-05
- Query Rewriting for DL-Lite with n-ary Concrete Domains - 17-04
- Metric Temporal Description Logics with Interval-Rigid Names - 17-03
- Concept Descriptions with Set Constraints and Cardinality Constraints - 17-02
- Making Quantification Relevant Again —the Case of Defeasible EL⊥ - 17-01
- Approximation in Description Logics - 16-08
- Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures - 16-07
- Approximate Unification in the Description Logic FL₀ - 16-04
- Approximately Solving Set Equations - 16-03
- Extending the Description Logic τEL(deg) with Acyclic TBoxes - 16-02
- Decidability of ALCP(D) for concrete domains with the EHD-property - 16-01
- Decidable Verification of Golog Programs over Non-Local Effect Actions - 15-19
- A Tableau Algorithm for SROIQ under Infinitely Valued Gödel Semantics - 15-18
- Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles - 15-17
- Temporal Query Answering in DL-Lite with Negation - 15-16
- Learning General Concept Inclusions in Probabilistic Description Logics - 15-14
- Axiomatization of General Concept Inclusions from Finite Interpretations - 15-13
- On Implementing Temporal Query Answering in DL-Lite - 15-12
- Infinitely Valued Gödel Semantics for Expressive Description Logics - 15-11
- Verification of Knowledge-Based Programs over Description Logic Actions - 15-10
- Adding Threshold Concepts to the Description Logic EL - 15-09
- Temporal Query Answering in EL - 15-08
- LTL over EL Axioms - 15-07
- Subsumption in Finitely Valued Fuzzy EL - 15-06
- Description Logics of Context with Rigid Roles Revisited - 15-04
- Dismatching and Local Disunification in EL - 15-03
- Error-Tolerant Reasoning in the Description Logic EL - 14-11
- Reasoning with Temporal Properties over Axioms of DL-Lite - 14-06
- Towards Parallel Repair Using Decompositions - 14-05
- Conjunctive Query Answering in Rough EL - 14-04
- Matching with respect to general concept inclusions in the Description Logic EL - 14-03
- The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals - 14-02
- Runtime Verification Using a Temporal Description Logic Revisited - 14-01
- Similarity Measures for Computing Relaxed Instances w.r.t. General EL-TBoxes - 13-12
- Model Exploration by Confidence with Completely Specified Counterexamples - 13-11
- On the Decidability of Verifying LTL Properties of Golog Programs - 13-10
- Gödel Description Logics - 13-09
- Verification of Golog Programs over Description Logic Actions - 13-08
- Hybrid Unification in the Description Logic EL - 13-07
- Most Specific Generalizations w.r.t. General EL-TBoxes - 13-06
- Temporal Query Answering w.r.t. DL-Lite-Ontologies - 13-05
- Exploration by Confidence - 13-04
- Learning Formal Definitions for Snomed CT from Text - 13-03
- A General Form of Attribute Exploration - 13-02
- On the Complexity of Temporal Query Answering - 13-01
- On Confident GCIs of Finite Interpretations - 12-06
- A Goal-Oriented Algorithm for Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies - 12-05
- Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices - 12-04
- Computing Minimal EL-Unifiers is Hard - 12-03
- SAT Encoding of Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies - 12-02
- Solving Language Equations and Disequations Using Looping Tree Automata with Colors - 12-01
- Undecidability of Fuzzy Description Logics - 11-06
- Unification in the Description Logic EL w.r.t. Cycle-Restricted TBoxes - 11-05
- Finding Finite Herbrand Models - 11-04
- Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm - 11-03
- Complementation and Inclusion of Weighted Automata on Infinite Trees - 11-02
- Unification in the Description Logic EL Without Top Constructor - 11-01
- Complementation and Inclusion of Weighted Automata on Infinite Trees - 10-05
- SAT Encoding of Unification in EL - 10-04
- Completion-based computation of most specific concepts with limited role-depth for EL and Prob-EL⁰¹ - 10-03
- Completion-based computation of least common subsumers with limited role-depth for EL and Prob-EL⁰¹ - 10-02
- Adding Causal Relationships to DL-based Action Formalisms - 10-01
- On the Complexity of Axiom Pinpointing in Description Logics - 09-04
- Integrate Action Formalisms into Linear Temporal Description Logics - 09-03
- Computing Boundaries for Reasoning in Sub-Ontologies - 09-02
- Putting ABox Updates into Action - 09-01
- Some Computational Problems Related to Pseudo-intents - 08-06
- Exploring finite models in the Description Logic ELgfp - 08-05
- Model-based Most Specific Concepts in Description Logics with Value Restrictions - 08-04
- Pinpointing in Terminating Forest Tableaux - 08-03
- Blocking and Pinpointing in Forest Tableaux - 08-02
- LTL over Description Logic Axioms - 08-01
- Module Extraction and Incremental Classification - 07-03
- A finite basis for the set of EL-implications holding in a finite model - 07-02
- Axiom Pinpointing in General Tableaux - 07-01
- Pinpointing in Tableaus - 06-05
- PSpace Automata with Blocking for Description Logics - 06-04
- Description Logic Actions with general TBoxes - 06-03
- Completing Description Logic Knowledge Bases using Formal Concept Analysis - 06-02
- On Language Equations with One-sided Concatenation - 06-01
- Updating Description Logic ABoxes - 05-10
- Complexity and Succinctness of Public Announcement Logic - 05-09
- A New n-ary Existential Quantifier in Description Logics - 05-08
- A Tableau Algorithm for DLs with Concrete Domains and GCIs - 05-07
- Expressive Non-Monotonic Description Logics Based on Circumscription - 05-06
- PDL with Intersection and Converse is Decidable - 05-05
- Connecting many-sorted theories - 05-04
- Quantitative Temporal Logics - 05-03
- Integrating Description Logics and Action Formalisms for Reasoning about Web Services - 05-02
- Pushing the EL Envelope - 05-01
- Description Logics with Concrete Domains and Functional Dependencies - 04-06
- Modal Logics of Topological Relations - 04-05
- Subsumption and Instance Problem in ELH w.r.t. General TBoxes - 04-04
- Reasoning in ELH w.r.t. General Concept Inclusion Axioms - 04-03
- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL - 04-02
- A nice Cycle Rule for Goal-Directed E-unification - 04-01
- A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics - 03-05
- PDL with Negation of Atomic Programs - 03-04
- Completeness of E-unification with eager Variable Elimination - 03-03
- Foundations of non-standard inferences for DLs with transitive roles - 03-02
- The instance problem and the most specific concept in the description logic EL w.r.t. terminological cycles with descriptive semantics - 03-01
- Least common subsumers, most specific concepts, and role-value-maps in a description logic with existential restrictions and terminological cycles - 02-07
- Decidability of SHIQ with Complex Role Inclusion Axioms - 02-06
- The Complexity of Finite Model Reasoning in Description Logics - 02-05
- Keys, Nominals, and Concrete Domains - 02-04
- An Approach for Optimizing ALE-Approximation of ALC-Concepts - 02-03
- Terminological cycles in a description logic with existential restrictions - 02-02
- Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies - 02-01
- Optimised Reasoning for SHIQ - 01-08
- Adding Numbers to the SHIQ Description Logic - First Results - 01-07
- Approximation and Difference in Description Logics - 01-06
- Unification in a Description Logic with Transitive Closure of Roles - 01-05
- Modal Logic and the two-variable fragment - 01-04
- The Inverse Method Implements the Automata Approach for Modal Satisfiability - 01-03
- Matching under Side Conditions in Description Logics - 01-02
- A Tableau Calculus for Temporal Description Logic - 01-01
- Computing Least Common Subsumers in ALEN - 00-07
- Interval-based Temporal Reasoning with General TBoxes - 00-06
- Computing Most Specific Concepts in Description Logics with Existential Restrictions - 00-05
- Revised Version of LTCS-Report 99-12: Rewriting Concepts Using Terminologies - Revisited - 00-04
- A Tableau Algorithm for the Clique Guarded Fragment - 00-03
- The Complexity of Reasoning with Boolean Modal Logics - 00-02
- NExpTime-complete Description Logics with Concrete Domains - 00-01
- Query Containment Using a DLR ABox - 99-15
- Optimisation of Terminological Reasoning - 99-14
- Matching Concept Descriptions with Existential Restrictions Revisited - 99-13
- Rewriting Concepts Using Terminologies - Revisited - 99-12
- PSpace Reasoning for DLs with Qualifying Number Restrictions - 99-11
- A PSpace-algorithm for ALCQI-satisfiability - 99-09
- A Description Logic with Transitive and Converse Roles, Role Hierarchies and Qualifying Number Restrictions - 99-08
- Matching Concept Descriptions with Existential Restrictions - 99-07
- Rewriting Concepts Using Terminologies - 99-06
- A NExpTime-Complete Description Logic Strictly Contained in C² - 99-05
- A Database Approach for Modeling and Querying Video Data - 99-03
- Representing and Reasoning on Conceptual Queries Over Image Databases - 99-02
- The Complexity of Reasoning with Concrete Domains - 99-01
- On the Relation between Conceptual Graphs and Description Logics - 98-11
- The Guarded Fragment of Conceptual Graphs - 98-10
- Computing Least Common Subsumer in Description Logics with Existential Restrictions - 98-09
- A PSPACE-algorithm for deciding ALCNIR+-satisfiability - 98-08
- Unification of Concept Terms in Description Logics - 98-07
- Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions - 98-06
- A Description Logic with Transitive and Converse Roles and Role Hierarchies - 98-05
- Structural Subsumption Considered from an Automata-Theoretic Point of View - 98-04
- Structural Subsumption for ALN - 98-03
- Description Logics with Aggregates and Concrete Domains, Part II - 98-02
- A Description Logic for Vague Knowledge - 98-01
- Unification Theory - An Introduction - 97-103
- A Rule-Based Data Manipulation Language for OLAP Systems - 97-05
- Characterizing the semantics of terminological cycles in ALN using finite automata - 97-04
- On the Complexity of Boolean Unification - 97-03
- Unfication of Concept Terms in Description Logics - 97-02
- Description Logics with Aggregates and Concrete Domains - 97-01
- Combination of Compatible Reduction Orderings that are Total on Ground Terms - 96-05
- Optimisation Techniques for Combining Constraint Solvers - 96-04
- Description Logics with Symbolic Number Restrictions - 96-03
- Number Restrictions on Complex Roles in Description Logics - 96-02
- A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method - 96-01