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 Fixed-Point Theorems of Priess-Crampe and Ribenboim in Logic Programming + (The Fixed-Point Theorems of Priess-Crampe and Ribenboim in Logic Programming)
The Fourth International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2022) + (The Fourth International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2022))
The Fuzzy Description Logic ALC_FH with Hedge Algebras as Concept Modifiers + (The Fuzzy Description Logic ALC_FH with Hedge Algebras as Concept Modifiers)
The Fuzzy Description Logic ALC_FLH + (The Fuzzy Description Logic ALC_FLH)
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 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)
Concurrency Theory + (The Linear Time - Branching Time Spectrum (1))
Concurrency Theory + (The Linear Time - Branching Time Spectrum (2))
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 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)
Models of Concurrent Systems + (The Pi-Calculus: Examples and Reductions)
Models of Concurrent Systems + (The Pi-Calculus: Labeled Transition Semantics)
Models of Concurrent Systems + (The Pi-Calculus: Properties of the LTS-Semantics)
Models of Concurrent Systems + (The Pi-Calculus: Syntax and Reduction Semantics)
Models of Concurrent Systems + (The Pi-Calculus: The Harmony Lemma)
Complexity Theory + (The Polynomial Hierarchy)
Complexity Theory + (The Polynomial Hierarchy)
Complexity Theory + (The Polynomial Hierarchy)
Complexity Theory + (The Polynomial Hierarchy)
Foundations of Complexity Theory + (The Polynomial Hierarchy)
Complexity Theory + (The Polynomial Hierarchy)
Complexity Theory + (The Polynomial Hierarchy)
Complexity Theory + (The Polynomial Hierarchy)
Complexity Theory + (The Polynomial Hierarchy)
Complexity Theory + (The Polynomial Hierarchy / Circuit Complexity)
Complexity Theory + (The Polynomial Hierarchy / Circuit Complexity)
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 (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)