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

• 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)
• Axiom Pinpointing in General Tableaux  + (BaaderPenaloza-LTCS-07-01.pdf)
• Axiom Pinpointing in General Tableaux  + (BaaderPenaloza-Tableaux-07.pdf)
• Knowledge Representation in Process Engineering  + (BaaderSattler-DL-96.ps.gz)

• Description Logics with Aggregates and Concrete Domains  + (BaaderSattler-DL97.ps.gz)

• Description Logics with Symbolic Number Restrictions  + (BaaderSattler-ECAI-96.ps.gz)
• Description Logics with Concrete Domains and Aggregation  + (BaaderSattler-ECAI-98.ps.gz)
• Expressive Number Restrictions in Description Logics  + (BaaderSattler-JLC-99.ps.gz)
• Description Logics with Aggregates and Concrete Domains, Part II (extended)  + (BaaderSattler-LTCS-98-02.ps.gz)
• Number Restrictions on Complex Roles in Description Logics  + (BaaderSattler-LTCS2.ps.gz)
• Description Logics with Symbolic Number Restrictions  + (BaaderSattler-LTCS3.ps.gz)
• An Overview of Tableau Algorithms for Description Logics  + (BaaderSattler-StudiaLogica.ps.gz)
• Tableau Algorithms for Description Logics  + (BaaderSattler-Tableaux-2000.ps.gz)
• Description Logics with Aggregates and Concrete Domains  + (BaaderSattlerIS-03.ps.gz)
• Combining Constraint Solving  + (BaaderSchulzCCL.ps.gz)
• Applying Formal Concept Analysis to Description Logics  + (BaaderSertkayaICFCA04.pdf)
• Computing the Least Common Subsumer w.r.t. a Background Terminology  + (BaaderSertkayaTurhan-Jelia04.pdf)
• Computing the Least Common Subsumer w.r.t. a Background Terminology  + (BaaderSertkayaTurhan-jal.pdf)
• Computing the Least Common Subsumer w.r.t. a Background Terminology  + (BaaderSertkayaTurhanDL04.pdf)
• Unification Theory  + (BaaderSnyderHandbook.ps.gz)
• Combining Decision Procedures for Positive Theories Sharing Constructors  + (BaaderTinelliRTA02.ps.gz)
• The Inverse Method Implements the Automata Approach for Modal Satisfiability  + (BaaderTobies-IJCAR.ps.gz)
• The Inverse Method Implements the Automata Approach for Modal Satisfiability  + (BaaderTobies-LTCS-01-03.ps.gz)
• TBoxes do not yield a compact representation of least common subsumers  + (BaaderTurhan-DL.ps.gz)
• On the problem of computing small representations of least common subsumers  + (BaaderTurhan-KI02.ps.gz)
• A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL  + (BaaderWG04.pdf)
• Level Mapping Characterizations for Quantitative and Disjunctive Logic Programs  + (Bach knorr.pdf)
• Extracting Propositional Logic Programs From Neural Networks: A Decompositional Approach.  + (Bachelor mayer-eichberger.pdf)
• Human reasoning and abduction  + (Bachelor tobias.pdf)
• The Integration of Connectionism and First-Order Knowledge Representation and Reasoning as a Challenge for Artificial Intelligence  + (Bader:04:02.pdf)