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

• Compositional matrix-space models of language: Definitions, properties, and learning methods  + (Compositional matrix-space models of language: Definitions, properties, and learning methods)
• Computability and Complexity of (Iterated) Belief Revision  + (Computability and Complexity of (Iterated) Belief Revision)
• Computability and Complexity of (Iterated) Belief Revision  + (Computability and Complexity of (Iterated) Belief Revision)
• Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication  + (Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication)
• Computational Aspects of cf2 and stage2 Argumentation Semantics  + (Computational Aspects of cf2 and stage2 Argumentation Semantics)
• Computational Logic  + (Computational Logic)
• Computational Logic  + (Computational Logic)
• Computational Logic and Human Reasoning  + (Computational Logic and Human Reasoning)
• Computational Logic and Human Reasoning Episodes  + (Computational Logic and Human Reasoning Episodes)
• Computational Logic: Abgeschlossene Arbeiten  + (Computational Logic: Abgeschlossene Arbeiten)
• Computational Logic: Completed Theses  + (Computational Logic: Completed Theses)
• Computing Boundaries for Reasoning in Sub-Ontologies  + (Computing Boundaries for Reasoning in Sub-Ontologies)
• Computing Change and Specificity with Equational Logic Programs  + (Computing Change and Specificity with Equational Logic Programs)
• Computing Conditional Probabilities in Markovian Models Efficiently  + (Computing Conditional Probabilities in Markovian Models Efficiently)
• Computing Conditional Probabilities: Implementation and Evaluation  + (Computing Conditional Probabilities: Implementation and Evaluation)
• Computing Cores for Existential Rules with the Standard Chase and ASP  + (Computing Cores for Existential Rules with the Standard Chase and ASP)
• Computing Facilities at the Faculty  + (Computing Facilities at the Faculty)
• Computing First-Order Logic Programs by Fibring Artificial Neural Networks  + (Computing First-Order Logic Programs by Fibring Artificial Neural Networks)
• Computing Generalizations of Temporal EL Concepts with Next and Global  + (Computing Generalizations of Temporal EL Concepts with Next and Global)
• Computing Generalizations of Temporal EL Concepts with Next and Global  + (Computing Generalizations of Temporal EL Concepts with Next and Global)
• Computing Intensional Answers to Questions - An Inductive Logic Programming Approach  + (Computing Intensional Answers to Questions - An Inductive Logic Programming Approach)
• Computing Least Common Subsumers in ALEN  + (Computing Least Common Subsumers in ALEN)
• Computing Least Common Subsumers in Description Logics with Existential Restrictions  + (Computing Least Common Subsumers in Description Logics with Existential Restrictions)
• Computing Least Common Subsumers in Description Logics with Existential Restrictions  + (Computing Least Common Subsumers in Description Logics with Existential Restrictions)
• Computing Local Unifiers in the Description Logic EL without the Top Concept  + (Computing Local Unifiers in the Description Logic EL without the Top Concept)

• Computing Minimal EL-Unifiers is Hard  + (Computing Minimal EL-Unifiers is Hard)

• Computing Minimal EL-unifiers is Hard  + (Computing Minimal EL-unifiers is Hard)
• Computing Most Specific Concepts in Description Logics with Existential Restrictions  + (Computing Most Specific Concepts in Description Logics with Existential Restrictions)
• Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems  + (Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems)
• Computing Quantiles in Markov Reward Models  + (Computing Quantiles in Markov Reward Models)
• Computing Role-depth Bounded Generalizations in the Description Logic ELOR  + (Computing Role-depth Bounded Generalizations in the Description Logic ELOR)
• Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis  + (Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis)
• Computing Stable Models for Nonmonotonic Existential Rules  + (Computing Stable Models for Nonmonotonic Existential Rules)
• Computing a Minimal Representation of the Subsumption Lattice of all Conjunctions of Concepts Defined in a Terminology  + (Computing a Minimal Representation of the Subsumption Lattice of all Conjunctions of Concepts Defined in a Terminology)
• Computing extensions of terminological default theories  + (Computing extensions of terminological default theories)
• Computing in Civil Engineering  + (Computing in Civil Engineering)
• Computing least common subsumers for FLE^+  + (Computing least common subsumers for FLE^+)
• Computing the Least Common Subsumer w.r.t. a Background Terminology  + (Computing the Least Common Subsumer w.r.t. a Background Terminology)
• Computing the Least Common Subsumer w.r.t. a Background Terminology  + (Computing the Least Common Subsumer w.r.t. a Background Terminology)
• Computing the Least Common Subsumer w.r.t. a Background Terminology  + (Computing the Least Common Subsumer w.r.t. a Background Terminology)
• Computing the hierarchy of conjunctions of concept names and their negations in a Description Logic knowledge base using Formal Concept Analysis (ICFCA 2006)  + (Computing the hierarchy of conjunctions of concept names and their negations in a Description Logic knowledge base using Formal Concept Analysis (ICFCA 2006))
• Computing the lcs w.r.t. General EL^+ TBoxes  + (Computing the lcs w.r.t. General EL^+ TBoxes)
• Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions  + (Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions)
• Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions  + (Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions)
• Computing the least common subsumer in the description logic EL w.r.t. terminological cycles with descriptive semantics  + (Computing the least common subsumer in the description logic EL w.r.t. terminological cycles with descriptive semantics)
• Computing with Logic as Operator Elimination: The ToyElim System  + (Computing with Logic as Operator Elimination: The ToyElim System)
• Computing with Logic as Operator Elimination: The ToyElim System  + (Computing with Logic as Operator Elimination: The ToyElim System)
• Concept Adjustment for Description Logics  + (Concept Adjustment for Description Logics)
• Concept Dissimilarity Based on Tree Edit Distances and Morphological Dilations  + (Concept Dissimilarity Based on Tree Edit Distances and Morphological Dilations)
• Concept Dissimilarity with Triangle Inequality  + (Concept Dissimilarity with Triangle Inequality)
• Concept Lattice Orbifolds -- First Steps  + (Concept Lattice Orbifolds -- First Steps)