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

• Extracting Reduced Logic Programs from Artificial Neural Networks  + (Extracting Reduced Logic Programs from Artificial Neural Networks)
• Extraction of Multilingual Term Variants in the Business Reporting Domain  + (Extraction of Multilingual Term Variants in the Business Reporting Domain)
• FABEL  + (FABEL)
• FABEL  + (FABEL)
• FABEL  + (FABEL)
• FABEL im Überblick  + (FABEL im Überblick)
• FABEL-IDEA 2, Intelligente Designunterstützung für Architekten, Version 2: Fallretrieval  + (FABEL-IDEA 2, Intelligente Designunterstützung für Architekten, Version 2: Fallretrieval)
• FABEL: Projektstatus, Perspektiven, Potentiale  + (FABEL: Projektstatus, Perspektiven, Potentiale)
• FAENSY: Fabel Development System  + (FAENSY: Fabel Development System)
• FCPlanner: A Planning Strategy for First-Order MDPs  + (FCPlanner: A Planning Strategy for First-Order MDPs)
• FLUCAP: A Heuristic Search Planner for First-Order MDPs  + (FLUCAP: A Heuristic Search Planner for First-Order MDPs)
• Foundations of Databases and Query Languages  + (FO Expressivity and Introduction to Datalog)
• Foundations of Databases and Query Languages  + (FO Expressivity and Introduction to Datalog)
• Database Theory  + (FO Expressivity and Introduction to Datalog)
• Database Theory  + (FO Expressivity and Introduction to Datalog)
• Foundations of Databases and Query Languages  + (FO Query Answering Complexity)
• Foundations of Databases and Query Languages  + (FO Query Answering Complexity)
• Database Theory  + (FO Query Answering Complexity)
• Database Theory  + (FO Query Answering Complexity)
• Database Theory  + (FO Query Answering Complexity (I))
• Database Theory  + (FO Query Answering Complexity (II))
• Foundations of Databases and Query Languages  + (FO Query Optimisation and Trakhenbrot's Theorem)
• Database Theory  + (FO Query Optimisation and Trakhenbrot's Theorem)
• Logical Modelling  + (FO(\cdot) and IDP)
• Faceted Answer-Set Navigation  + (Faceted Answer-Set Navigation)

• Fallverwaltung in heterogenen Fallwissensbasen  + (Fallverwaltung in heterogenen Fallwissensbasen)

• Fallverwaltung und Fallretrieval: Implementierungen und Tests  + (Fallverwaltung und Fallretrieval: Implementierungen und Tests)
• Family-Based Modeling and Analysis for Probabilistic Systems - Featuring ProFeat  + (Family-Based Modeling and Analysis for Probabilistic Systems - Featuring ProFeat)
• Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints  + (Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints)
• Fast Compression of Large Semantic Web Data using X10  + (Fast Compression of Large Semantic Web Data using X10)
• Fast Computation of Proper Premises  + (Fast Computation of Proper Premises)
• Fast Dual Simulation Processing of Graph Database Queries  + (Fast Dual Simulation Processing of Graph Database Queries)
• Fast Dual Simulation Processing of Graph Database Queries (Supplement)  + (Fast Dual Simulation Processing of Graph Database Queries (Supplement))
• Fast Indexing of Codebook Vectors Using Dynamic Binary Search Trees With Fat Decision Hyperplanes  + (Fast Indexing of Codebook Vectors Using Dynamic Binary Search Trees With Fat Decision Hyperplanes)
• Fast Modularisation and Atomic Decomposition of Ontologies using Axiom Dependency Hypergraphs  + (Fast Modularisation and Atomic Decomposition of Ontologies using Axiom Dependency Hypergraphs)
• Fast algorithms for implication bases and attribute exploration using proper premises  + (Fast algorithms for implication bases and attribute exploration using proper premises)
• Finding Finite Herbrand Models  + (Finding Finite Herbrand Models)
• Finding Finite Herbrand Models  + (Finding Finite Herbrand Models)
• Academic Skills in Computer Science  + (Finding Literature)
• Academic Skills in Computer Science  + (Finding Literature)
• Finding the Largest Datalog Fragment of Description Logic  + (Finding the Largest Datalog Fragment of Description Logic)
• Finite Entailment of Local Queries in the Z family of Description Logics  + (Finite Entailment of Local Queries in the Z family of Description Logics)
• Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract)  + (Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract))
• Finite Groundings for ASP with Functions: A Journey through Consistency (Technical Report)  + (Finite Groundings for ASP with Functions: A Journey through Consistency (Technical Report))
• Finite Lattices Do Not Make Reasoning in ALCI Harder  + (Finite Lattices Do Not Make Reasoning in ALCI Harder)
• Finite Lattices Do Not Make Reasoning in ALCOI Harder  + (Finite Lattices Do Not Make Reasoning in ALCOI Harder)
• Finite Model Theory of the Triguarded Fragment and Related Logics  + (Finite Model Theory of the Triguarded Fragment and Related Logics)
• Finite Model reasoning in ALCQI is ExpTime-complete  + (Finite Model reasoning in ALCQI is ExpTime-complete)
• Finite and algorithmic model theory  + (Finite and algorithmic model theory)
• Finite and algorithmic model theory (22/23)  + (Finite and algorithmic model theory (22/23))
• Finite and algorithmic model theory  + (Finite model property for FO2)