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

• Implementing the n-ary Description Logic GF1-  + (Jan)
• Reasoning about Nominals with FaCT and RACER  + (Jan)
• PSPACE Automata for Description Logics  + (Jan)
• A Framework For Evaluating Visual SLAM  + (Jan)
• Multilevel Coordination Control of Partially Observed Modular DES  + (Jan)
• Relative Observability in Coordination Control  + (Jan)
• Distributed computation of supremal conditionally-controllable sublanguages  + (Jan)
• On a Distributed Computation of Supervisors in Modular Supervisory Control  + (Jan)
• Control of an Engineering-Structured Multilevel Discrete-Event System  + (Jan)
• Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication  + (Jan)
• Detecting Synonymous Properties by Shared Data-driven Definitions  + (Jan-Christoph)
• Semantik, Linked Data, Web-Präsentation: Grundlagen der Nachlasserschließung im Portal www.pueckler-digital.de  + (Jana)
• Semantik, Web, Metadaten und digitale Edition: Grundlagen und Ziele der Erschließung neuer Quellen des Branitzer Pückler-Archivs  + (Jana)
• Knowledge-Based Support for Scholarly Editing and Text Processing  + (Jana)
• Towards Knowledge-Based Assistance for Scholarly Editing  + (Jana)
• Semantik, Linked Data, Web-Präsentation: Grundlagen der Nachlasserschließung im Portal www.pueckler-digital.de  + (Jana)
• Visualization of Statistical Information in Concept Lattice Diagrams  + (Jana)
• Determinacy of Real Conjunctive Queries. The Boolean Case  + (Jarosław)
• A Behavioral Characterization of Computational Systems  + (Javier Oscar)
• Walking the Complexity Lines for Generalized Guarded Existential Rules  + (Jean-François)
• Towards Farsighted Dependencies for Existential Rules  + (Jean-François)
• Bounded Treewidth and the Infinite Core Chase – Complications and Workarounds toward Decidable Querying  + (Jean-François)
• Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs  + (Jens)
• Extracting Reduced Logic Programs from Artificial Neural Networks  + (Jens)
• Extracting Reduced Logic Programs from Artificial Neural Networks  + (Jens)
• A Hardware/Software Stack for Heterogeneous Systems  + (Jeronimo)
• From Default and Autoepistemic Logics to Disjunctive Answer Set Programs via the Logic of GK  + (Jianmin)
• Implementing Default and Autoepistemic Logics via the Logic of GK  + (Jianmin)
• Evaluation of Extraction Techniques for Ontology Excerpts  + (Jieying)

• Advances in Symbolic Probabilistic Model Checking with PRISM  + (Joachim)
• Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata  + (Joachim)
• Are Good-for-Games Automata Good for Probabilistic Model Checking?  + (Joachim)
• Compositional Construction of Most General Controllers  + (Joachim)
• Compositional Synthesis and Most General Controllers  + (Joachim)
• Experiments with Deterministic $ømega$-Automata for Formulas of Linear temporal Logic  + (Joachim)
• Experiments with deterministic $ømega$-automata for formulas of linear temporal logic  + (Joachim)
• Hierarchical Modeling and Formal Verification: An Industrial Case Study Using Reo and Vereofy  + (Joachim)
• On-the-Fly Stuttering in the Construction of Deterministic $ømega$-Automata  + (Joachim)

• Lexico-Logical Acquisition of OWL DL Axioms - An Integrated Approach to Ontology Refinement  + (Johanna)
• Fostering Web Intelligence by Semi-automatic OWL Ontology Refinement  + (Johanna)
• Attribute Exploration with Proper Premises and Incomplete Knowledge Applied to the Free Radical Theory of Ageing  + (Johannes)
• Linear context-free tree languages and inverse homomorphisms  + (Johannes)
• Linear Context-Free Tree Languages and Inverse Homomorphisms  + (Johannes)
• Rushing and Strolling among Answer Sets - Navigation Made Easy  + (Johannes Klaus)
• Rushing and Strolling among Answer Sets - Navigation Made Easy  + (Johannes Klaus)
• IASCAR: Incremental Answer Set Counting by Anytime Refinement  + (Johannes Klaus)
• Rushing and Strolling among Answer Sets – Navigation Made Easy (Extended Abstract)  + (Johannes Klaus)
• Rushing and Strolling among Answer Sets - Navigation Made Easy (Extended Abstract)  + (Johannes Klaus)
• IASCAR: Incremental Answer Set Counting by Anytime Refinement  + (Johannes Klaus)
• IASCAR: Incremental Answer Set Counting by Anytime Refinement  + (Johannes Klaus)
• A Modified Supervaluationist Framework for Decision-Making  + (Jonas)
• The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion  + (Jonas)
• Second-order Confidence in Supervaluationism  + (Jonas)
• Voting for Bins: Integrating Imprecise Probabilistic Beliefs into the Condorcet Jury Theorem  + (Jonas)
• To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence  + (Jonas)
• Taming Dilation in Imprecise Pooling  + (Jonas)
• Metric semantics for true concurrent real time  + (Joost-Pieter)
• Towards an FCA-based Recommender System for Black-Box Optimization  + (Josefine)
• Concept lattices with negative information: A characterization theorem  + (José Manuel)