Suche mittels Attribut
Aus International Center for Computational Logic
Diese Seite stellt eine einfache Suchoberfläche zum Finden von Objekten bereit, die ein Attribut mit einem bestimmten Datenwert enthalten. Andere verfügbare Suchoberflächen sind die Attributsuche sowie der Abfragengenerator.
Liste der Ergebnisse
- Modal Logic and the two-variable fragment + (LTCS-01-04)
- Adding Numbers to the SHIQ Description Logic—First Results + (LTCS-01-07)
- Optimised Reasoning for SHIQ + (LTCS-01-08)
- Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies + (LTCS-02-01)
- Terminological Cycles in a Description Logic with Existential Restrictions + (LTCS-02-02)
- Keys, Nominals, and Concrete Domains + (LTCS-02-04)
- The Complexity of Finite Model Reasoning in Description Logics + (LTCS-02-05)
- Decidability of SHIQ with Complex Role Inclusion Axioms + (LTCS-02-06)
- Least Common Subsumers, Most Specific Concepts, and Role-Value-Maps in a Description Logic with Existential Restrictions and Terminological Cycles + (LTCS-02-07)
- The Instance Problem and the Most Specific Concept in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics + (LTCS-03-01)
- Completness of E-unification with eager Variable Elimination + (LTCS-03-03)
- PDL with Negation of Atomic Programs + (LTCS-03-04)
- A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics + (LTCS-03-05)
- A nice Cycle Rule for Goal-Directed E-Unification + (LTCS-04-01)
- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL + (LTCS-04-02)
- Reasoning in ELH w.r.t. General Concept Inclusion Axioms + (LTCS-04-03)
- Subsumption and Instance Problem in ELH w.r.t. General TBoxes + (LTCS-04-04)
- Modal Logics of Topological Relations + (LTCS-04-05)
- Description Logics with Concrete Domains and Functional Dependencies + (LTCS-04-06)
- Pushing the EL Envelope + (LTCS-05-01)
- Integrating Description Logics and Action Formalisms for Reasoning about Web Services + (LTCS-05-02)
- Quantitative Temporal Logics: PSpace and below + (LTCS-05-03)
- Connecting Many-Sorted Theories + (LTCS-05-04)
- PDL with Intersection and Converse is Decidable + (LTCS-05-05)
- Expressive Non-Monotonic Description Logics Based on Circumscription + (LTCS-05-06)
- A New n-ary Existential Quantifier in Description Logics + (LTCS-05-08)
- Complexity and Succinctness of Public Announcement Logic + (LTCS-05-09)
- Updating Description Logic ABoxes + (LTCS-05-10)
- On Language Equations with One-sided Concatenation + (LTCS-06-01)
- Completing Description Logic Knowledge Bases using Formal Concept Analysis + (LTCS-06-02)
- Description Logic Actions with general TBoxes: a Pragmatic Approach + (LTCS-06-03)
- PSPACE Automata with Blocking for Description Logics + (LTCS-06-04)
- Pinpointing in Tableaus + (LTCS-06-05)
- Axiom Pinpointing in General Tableaux + (LTCS-07-01)
- Module Extraction and Incremental Classification: A Pragmatic Approach for EL+ Ontologies + (LTCS-07-03)
- Blocking and Pinpointing in Forest Tableaux + (LTCS-08-02)
- Pinpointing in Terminating Forest Tableaux + (LTCS-08-03)
- Some Computational Problems Related to Pseudo-intents + (LTCS-08-06)
- Integrate Action Formalisms into Linear Temporal Description Logics + (LTCS-09-03)
- LATPub703 + (LTCS-10-02)
- LATPub702 + (LTCS-10-03)
- Complementation and Inclusion of Weighted Automata on Infinite Trees + (LTCS-10-05)
- A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method + (LTCS-96-01)
- Number Restrictions on Complex Roles in Description Logics + (LTCS-96-02)
- Description Logics with Symbolic Number Restrictions + (LTCS-96-03)
- Optimisation Techniques for Combining Constraint Solvers + (LTCS-96-04)
- Combination of Compatible Reduction Orderings that are Total on Ground Terms + (LTCS-96-05)
- Description Logics with Aggregates and Concrete Domains + (LTCS-97-01)
- Unification of Concept Terms in Description Logics + (LTCS-97-02)
- On the Complexity of Boolean Unification + (LTCS-97-03)
