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

On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers + (On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers)
On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers + (On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers)
On the Complexity and Expressiveness of Description Logics with Counting + (On the Complexity and Expressiveness of Description Logics with Counting)
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics + (On the Complexity of Axiom Pinpointing in the EL Family of Description Logics)
On the Complexity of Axiom Pinpointing in Description Logics + (On the Complexity of Axiom Pinpointing in Description Logics)
On the Complexity of Boolean Unification + (On the Complexity of Boolean Unification)
On the Complexity of Boolean Unification + (On the Complexity of Boolean Unification)
On the Complexity of Computing Generators of Closed Sets + (On the Complexity of Computing Generators of Closed Sets)
On the Complexity of Counting in Description Logics + (On the Complexity of Counting in Description Logics)
On the Complexity of Graded Modal Logics with Converse. + (On the Complexity of Graded Modal Logics with Converse.)
On the Complexity of Synthesis of nop-Free Boolean Petri Nets + (On the Complexity of Synthesis of nop-Free Boolean Petri Nets)
On the Complexity of Synthesis of nop-Free Boolean Petri Nets + (On the Complexity of Synthesis of nop-Free Boolean Petri Nets)
On the Complexity of Temporal Query Answering + (On the Complexity of Temporal Query Answering)
On the Complexity of Terminological Reasoning + (On the Complexity of Terminological Reasoning)
On the Complexity of Universality for Partially Ordered NFAs + (On the Complexity of Universality for Partially Ordered NFAs)
On the Complexity of Universality for Partially Ordered NFAs + (On the Complexity of Universality for Partially Ordered NFAs)
On the Complexity of Universality for Partially Ordered NFAs + (On the Complexity of Universality for Partially Ordered NFAs)
On the Complexity of k-Piecewise Testability and the Depth of Automata + (On the Complexity of k-Piecewise Testability and the Depth of Automata)
On the Complexity of k-Piecewise Testability and the Depth of Automata + (On the Complexity of k-Piecewise Testability and the Depth of Automata)
On the Complexity of k-Piecewise Testability and the Depth of Automata + (On the Complexity of k-Piecewise Testability and the Depth of Automata)
On the Computation of Naive-based Argumentation Semantics + (On the Computation of Naive-based Argumentation Semantics)
On the Computation of Naive-based Argumentation Semantics + (On the Computation of Naive-based Argumentation Semantics)
On the Computational Complexity of Naive-based Semantics for Abstract Dialectical Frameworks + (On the Computational Complexity of Naive-based Semantics for Abstract Dialectical Frameworks)
On the Correspondence between Compositional Matrix-Space Models of Language and Weighted Automata + (On the Correspondence between Compositional Matrix-Space Models of Language and Weighted Automata)
On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics + (On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics)
On the Decidability Status of Fuzzy ALC with General Concept Inclusions + (On the Decidability Status of Fuzzy ALC with General Concept Inclusions)

On the Decidability of Verifying LTL Properties of Golog Programs + (On the Decidability of Verifying LTL Properties of Golog Programs)
On the Decidability of Verifying LTL Properties of Golog Programs + (On the Decidability of Verifying LTL Properties of Golog Programs)

On the Decomposition of ADFs and the Complexity of Naive-based Semantics + (On the Decomposition of ADFs and the Complexity of Naive-based Semantics)
On the Decomposition of ADFs and the Complexity of Naive-based Semantics + (On the Decomposition of ADFs and the Complexity of Naive-based Semantics)
On the Exploration of the Query Rewriting Space with Existential Rules + (On the Exploration of the Query Rewriting Space with Existential Rules)
On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets + (On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets)
On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets + (On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets)
On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets + (On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets)
On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations + (On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations)
On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations + (On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations)
On the Foundations of Cycles in Bayesian Networks + (On the Foundations of Cycles in Bayesian Networks)
On the Limits of Decision: the Adjacent Fragment of First-Order Logic + (On the Limits of Decision: the Adjacent Fragment of First-Order Logic)
On the Logical Characterisation of Performability Properties + (On the Logical Characterisation of Performability Properties)
On the Maximal and Average Numbers of Stable Extensions + (On the Maximal and Average Numbers of Stable Extensions)
On the Number of Bipolar Boolean Functions + (On the Number of Bipolar Boolean Functions)
On the Ontological Modeling of Trees + (On the Ontological Modeling of Trees)
On the Relation between Descripion Logics and Conceptual Graphs + (On the Relation between Descripion Logics and Conceptual Graphs)
On the Relative Expressiveness of Argumentation Frameworks, Normal Logic Programs and Abstract Dialectical Frameworks + (On the Relative Expressiveness of Argumentation Frameworks, Normal Logic Programs and Abstract Dialectical Frameworks)
On the Satisfiability of Temporal Logics with Concrete Domains + (On the Satisfiability of Temporal Logics with Concrete Domains)
On the Semantic Foundations of Probabilistic Synchronous Reactive Programs + (On the Semantic Foundations of Probabilistic Synchronous Reactive Programs)
On the Semantic Relationship between Datalog and Description Logics + (On the Semantic Relationship between Datalog and Description Logics)
On the State Complexity of the Reverse of R- and J-Trivial Regular Languages + (On the State Complexity of the Reverse of R- and J-Trivial Regular Languages)
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs + (On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs)
On the Succinctness of Closure Operator Representations + (On the Succinctness of Closure Operator Representations)
On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components + (On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components)
On the Undecidability of Fuzzy Description Logics with GCIs and Product t-norm + (On the Undecidability of Fuzzy Description Logics with GCIs and Product t-norm)