Suche mittels Attribut

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

• A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method  + (Baader-Tinelli-LTCS-96.ps.gz)
• Combining Equational Theories Sharing Non-Collapse-Free Constructors  + (Baader-Tinelli-Report-99-13.ps.gz)
• Deciding the Word Problem in the Union of Equational Theories  + (Baader-Tinelli-UIUCDCS-R-98-2073.ps.gz)
• Combination of Compatible Reduction Orderings that are Total on Ground Terms  + (Baader-UNIF-96.ps.gz)
• Description Logics  + (Baader09.pdf)
• Query and Predicate Emptiness in Description Logics  + (BaaderBLW10.pdf)
• Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints  + (BaaderBednarczykRudolphECAI2020Report.pdf)
• Matching under Side Conditions in Description Logics  + (BaaderBrandt+-LTCS-01-02.ps.gz)
• Pushing the EL Envelope  + (BaaderBrandtLutz-IJCAI-05.pdf)
• Pushing the EL Envelope  + (BaaderBrandtLutz-LTCS-05-01.pdf)
• On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations  + (BaaderBuerckert+-JLLI-93.ps.gz)
• A Finite Basis for the Set of EL-Implications Holding in a Finite Model  + (BaaderDistelICFCA08.pdf)
• A New n-ary Existential Quantifier in Description Logics  + (BaaderEtAl-LTCS-05-08.pdf)
• A New n-ary Existential Quantifier in Description Logics  + (BaaderEtAlDL05.pdf)
• Integrating Description Logics and Action Formalisms: First Results  + (BaaderEtAlDL05b.pdf)
• A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics  + (BaaderEtAlIJCAR04.pdf)
• A New n-ary Existential Quantifier in Description Logics  + (BaaderEtAlKI05.pdf)
• An Empirical Analysis of Optimization Techniques for Terminological Representation Systems  + (BaaderFranconi+-OptJournal-94.ps.gz)
• LTL over Description Logic Axioms  + (BaaderGL12.pdf)
• Unification in Modal and Description Logics  + (BaaderGhilardi2011.pdf)
• Connecting Many-Sorted Theories  + (BaaderGhilardiCADE05.pdf)
• Connecting Many-Sorted Structures and Theories through Adjoint Functions  + (BaaderGhilardiFroCoS05.pdf)
• Connecting Many-Sorted Theories  + (BaaderGhilardiLTCS-05-04.ps.gz)
• A Terminological Knowledge Representation System with Complete Inference Algorithms  + (BaaderHollunder-PDK-91.ps.gz)
• Computing the least common subsumer in the description logic EL w.r.t. terminological cycles with descriptive semantics  + (BaaderICCS03.pdf)

• Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles  + (BaaderIJCAI03b.pdf)

• The instance problem and the most specific concept in the description logic EL w.r.t. terminological cycles with descriptive semantics  + (BaaderKI03.ps.gz)
• Structural Subsumption Considered from an Automata Theoretic Point of View  + (BaaderKuesters+-DL-98.ps.gz)
• Least common subsumer computation w.r.t. cyclic ALN-terminologies  + (BaaderKuesters-DL-1998.ps.gz)
• Matching in Description Logics with Existential Restrictions  + (BaaderKuesters-DL-1999.ps.gz)
• Nonstandard Inferences in Description Logics: The Story So Far  + (BaaderKuesters-IMAT-06.pdf)
• Matching in Description Logics with Existential Restrictions  + (BaaderKuesters-KR-2000.ps.gz)
• Unification in a Description Logic with Transitive Closure of Roles  + (BaaderKuesters-LPAR.ps.gz)
• Unification in a Description Logic with Transitive Closure of Roles  + (BaaderKuesters-LTCS-01-05.ps.gz)
• Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions  + (BaaderKuesters-LTCS-98-06-1998.ps.gz)
• Matching in Description Logics with Existential Restrictions  + (BaaderKuesters-LTCS-99-07-1999.ps.gz)
• Matching Concept Descriptions with Existential Restrictions Revisited  + (BaaderKuesters-LTCS-99-13-1999.ps.gz)
• Unification in a Description Logic with Inconsistency and Transitive Closure of Roles  + (BaaderKuestersDL02.ps.gz)
• Rewriting Concepts Using Terminologies  + (BaaderKuestersMolitor-KR-2000.ps.gz)
• Rewriting Concepts Using Terminologies – Revisited  + (BaaderKuestersMolitor-LTCS-00-04.ps.gz)
• Structural Subsumption Considered from an Automata Theoretic Point of View  + (BaaderKuestersMolitor-LTCS-98-04.ps.gz)
• Computing Least Common Subsumers in Description Logics with Existential Restrictions  + (BaaderKuestersMolitor-LTCS-98-09.ps.gz)
• Rewriting Concepts Using Terminologies – Revisited  + (BaaderKuestersMolitor-LTCS-99-12.ps.gz)
• Small is again Beautiful in Description Logics  + (BaaderLutzTurhan-KIJ.pdf)
• Rewriting Concepts Using Terminologies  + (BaaderMolitor-DL-1999.ps.gz)
• Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis  + (BaaderMolitor-ICCS2000.ps.gz)
• Rewriting Concepts using Terminologies  + (BaaderMolitor-LTCS-99-06.ps.gz)
• Tractable and Decidable Fragments of Conceptual Graphs  + (BaaderMolitorTobies-ICCS-1999.ps.gz)
• The Guarded Fragment of Conceptual Graphs  + (BaaderMolitorTobies-LTCS-98-10.ps.gz)
• On the Relation between Descripion Logics and Conceptual Graphs  + (BaaderMolitorTobies-LTCS-98-11.ps.gz)
• On Language Equations with One-sided Concatenation  + (BaaderOkhotin-LTCS-06-01.pdf)