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

• The Fuzzy Description Logic ALC_FLH  + (The Fuzzy Description Logic ALC_FLH)
• The Fuzzy Description Logic G-FL_0 with Greatest Fixed-Point Semantics  + (The Fuzzy Description Logic G-FL_0 with Greatest Fixed-Point Semantics)
• The Fuzzy Linguistic Description Logic ALC_FL  + (The Fuzzy Linguistic Description Logic ALC_FL)
• The Fuzzy Linguistic Description Logic ALC_FL  + (The Fuzzy Linguistic Description Logic ALC_FL)
• The Guarded Fragment of Conceptual Graphs  + (The Guarded Fragment of Conceptual Graphs)
• The Hanoi Omega-Automata Format  + (The Hanoi Omega-Automata Format)
• The Hybrid mu-Calculus  + (The Hybrid mu-Calculus)
• The Identity Problem in Description Logic Ontologies  + (The Identity Problem in Description Logic Ontologies)
• The Identity Problem in Description Logic Ontologies  + (The Identity Problem in Description Logic Ontologies)
• The Inclusion Problem for Weighted Automata on Infinite Trees  + (The Inclusion Problem for Weighted Automata on Infinite Trees)
• The Incredible ELK: From Polynomial Procedures to Efficient Reasoning with ℰℒ Ontologies  + (The Incredible ELK: From Polynomial Procedures to Efficient Reasoning with ℰℒ Ontologies)
• The Instance Problem and the Most Specific Concept in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics  + (The Instance Problem and the Most Specific Concept in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics)
• The Integration of Connectionism and First-Order Knowledge Representation and Reasoning as a Challenge for Artificial Intelligence  + (The Integration of Connectionism and First-Order Knowledge Representation and Reasoning as a Challenge for Artificial Intelligence)
• The Integration of Connectionism and First-Order Knowledge Representation and Reasoning as a Challenge for Artificial Intelligence  + (The Integration of Connectionism and First-Order Knowledge Representation and Reasoning as a Challenge for Artificial Intelligence)
• The Inverse Method Implements the Automata Approach for Modal Satisfiability  + (The Inverse Method Implements the Automata Approach for Modal Satisfiability)
• The Inverse Method Implements the Automata Approach for Modal Satisfiability  + (The Inverse Method Implements the Automata Approach for Modal Satisfiability)
• The Limits of Decidability in Fuzzy Description Logics with General Concept Inclusions  + (The Limits of Decidability in Fuzzy Description Logics with General Concept Inclusions)
• The Logical Difference for EL: from Terminologies towards TBoxes  + (The Logical Difference for EL: from Terminologies towards TBoxes)
• The Logical Difference for ELHr-Terminologies using Hypergraphs  + (The Logical Difference for ELHr-Terminologies using Hypergraphs)
• The Method of Refinement: Deriving Proof-Calculi from Semantics for Multi-Modal Logics  + (The Method of Refinement: Deriving Proof-Calculi from Semantics for Multi-Modal Logics)
• The Method of Refinement: Deriving Proof-Calculi from Semantics for Multi-Modal Logics  + (The Method of Refinement: Deriving Proof-Calculi from Semantics for Multi-Modal Logics)
• The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion  + (The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion)
• The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion  + (The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion)
• The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion  + (The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion)
• The New SQID: Improving Wikidata Made Easy  + (The New SQID: Improving Wikidata Made Easy)

• The Not-So-Easy Task of Computing Class Subsumptions in OWL RL  + (The Not-So-Easy Task of Computing Class Subsumptions in OWL RL)

• The Orbit Problem for Parametric Linear Dynamical Systems  + (The Orbit Problem for Parametric Linear Dynamical Systems)
• The Orchestration Stack: The Impossible Task of Designing Software for Unknown Future Post-CMOS Hardware  + (The Orchestration Stack: The Impossible Task of Designing Software for Unknown Future Post-CMOS Hardware)
• The PIE system for Proving, Interpolating and Eliminating  + (The PIE system for Proving, Interpolating and Eliminating)
• The Power of the Terminating Chase  + (The Power of the Terminating Chase)
• The Power of the Terminating Chase  + (The Power of the Terminating Chase)
• The Power of the Terminating Chase  + (The Power of the Terminating Chase)
• The Precise Complexity of Reasoning in ALC with ω-Admissible Concrete Domains  + (The Precise Complexity of Reasoning in ALC with ω-Admissible Concrete Domains)
• The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard  + (The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard)
• The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard  + (The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard)
• The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard  + (The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard)
• The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard (Extended Abstract)  + (The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard (Extended Abstract))
• The Problem of Bureaucracy and Identity of Proofs from the Perspective of Deep Inference  + (The Problem of Bureaucracy and Identity of Proofs from the Perspective of Deep Inference)
• The Projection Problem for EL Actions  + (The Projection Problem for EL Actions)
• The Relative Expressiveness of Abstract Argumentation and Logic Programming  + (The Relative Expressiveness of Abstract Argumentation and Logic Programming)
• The Relevance of Formal Logics for Cognitive Logics, and Vice Versa  + (The Relevance of Formal Logics for Cognitive Logics, and Vice Versa)
• The Relevance of Formal Logics for Cognitive Logics, and Vice Versa  + (The Relevance of Formal Logics for Cognitive Logics, and Vice Versa)
• The RustBelt and its Separation Logic  + (The RustBelt and its Separation Logic)
• The RustBelt and its Separation Logic  + (The RustBelt and its Separation Logic)
• The SAT Solver Framework priss  + (The SAT Solver Framework priss)
• The SAT Solver Framework priss (System Description)  + (The SAT Solver Framework priss (System Description))
• The Semantic Web: ESWC 2018 Satellite Events - ESWC 2018 Satellite Events  + (The Semantic Web: ESWC 2018 Satellite Events - ESWC 2018 Satellite Events)
• The Semantic Web: Semantics and Big Data, 10th International Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. Proceedings  + (The Semantic Web: Semantics and Big Data, 10th International Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. Proceedings)
• The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules  + (The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules)
• The Subsumption Problem in the Fuzzy Description Logic ALC_FH  + (The Subsumption Problem in the Fuzzy Description Logic ALC_FH)
• The Syllogistic Reasoning Task: Reasoning Principles and Heuristic Strategies in Modeling Human Clusters  + (The Syllogistic Reasoning Task: Reasoning Principles and Heuristic Strategies in Modeling Human Clusters)