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

• LATPub721  + (Similarity Measures for Computing Relaxed Instances w.r.t. General EL-TBoxes)
• Similarity-based Relaxed Instance Queries  + (Similarity-based Relaxed Instance Queries)
• Similarity-based Relaxed Instance Queries in EL^++  + (Similarity-based Relaxed Instance Queries in EL^++)
• Simple Default Reasoning in Theories of Action  + (Simple Default Reasoning in Theories of Action)
• Simple restriction in context-free rewriting  + (Simple restriction in context-free rewriting)
• SAT-Solving  + (Simplification)
• Simulating Sets in Answer Set Programming  + (Simulating Sets in Answer Set Programming)
• Simulating perfect channels with probabilistic lossy channels  + (Simulating perfect channels with probabilistic lossy channels)
• Simulation for Continuous-Time Markov Chains  + (Simulation for Continuous-Time Markov Chains)
• Situation Recognition for Service Management Systems Using OWL 2 Reasoners  + (Situation Recognition for Service Management Systems Using OWL 2 Reasoners)
• Situations, Actions, and Causality in the Fluent Calculus  + (Situations, Actions, and Causality in the Fluent Calculus)
• Seminar Rule-Based Paradigms in KR  + (Slide Feedback and Consultation)
• Small is again Beautiful in Description Logics  + (Small is again Beautiful in Description Logics)
• SmartWeb: Mobile Access to the Semantic Web  + (SmartWeb: Mobile Access to the Semantic Web)
• SmartWeb: Mobile Access to the Semantic Web  + (SmartWeb: Mobile Access to the Semantic Web)
• Smoke Test Planning using Answer Set Programming  + (Smoke Test Planning using Answer Set Programming)
• Solver Description of RISS 2.0 and PRISS 2.0  + (Solver Description of RISS 2.0 and PRISS 2.0)
• Solver submission of riss 1.0 to the SAT Competition 2011  + (Solver submission of riss 1.0 to the SAT Competition 2011)
• Foundations of Logic Programming  + (Solving)
• Foundations of Logic Programming  + (Solving 1/2)
• Foundations of Logic Programming  + (Solving 2/2)
• Solving Advanced Argumentation Problems with Answer Set Programming  + (Solving Advanced Argumentation Problems with Answer Set Programming)
• Solving Advanced Argumentation Problems with Answer Set Programming  + (Solving Advanced Argumentation Problems with Answer Set Programming)
• Solving Advanced Argumentation Problems with Answer-Set Programming  + (Solving Advanced Argumentation Problems with Answer-Set Programming)
• Solving Hidokus Using SAT-Solvers  + (Solving Hidokus Using SAT-Solvers)

• Solving Hidokus using SAT Solvers  + (Solving Hidokus using SAT Solvers)

• Solving Language Equations and Disequations Using Looping Tree Automata with Colors  + (Solving Language Equations and Disequations Using Looping Tree Automata with Colors)
• Foundations of Logic Programming  + (Solving Part I)
• Foundations of Logic Programming  + (Solving Part II)
• Solving Robust Markov Decision Processes: Generic, Reliable, Efficient  + (Solving Robust Markov Decision Processes: Generic, Reliable, Efficient)
• Solving a PSPACE-complete problem by gene assembly  + (Solving a PSPACE-complete problem by gene assembly)
• Solving language equations and disequations with applications to disunification in description logics and monadic set constraints  + (Solving language equations and disequations with applications to disunification in description logics and monadic set constraints)
• Solving the All-Interval Series Problem: SAT vs CP  + (Solving the All-Interval Series Problem: SAT vs CP)
• Solving the Entailment Problem in the Fluent Calculus with Binary Decision Diagrams  + (Solving the Entailment Problem in the Fluent Calculus with Binary Decision Diagrams)
• Solving the Entailment Problem in the Fluent Calculus using Binary Decision Diagrams  + (Solving the Entailment Problem in the Fluent Calculus using Binary Decision Diagrams)
• Some Complexity Results about Essential Closed Sets  + (Some Complexity Results about Essential Closed Sets)
• Some Computational Problems Related to Pseudo-intents  + (Some Computational Problems Related to Pseudo-intents)
• Some Computational Problems Related to Pseudo-intents  + (Some Computational Problems Related to Pseudo-intents)
• Some Experimental Results on Randomly Generating Formal Contexts  + (Some Experimental Results on Randomly Generating Formal Contexts)
• Some Fragments Towards Establishing Completeness Properties of Second-Order Quantifier Elimination Methods  + (Some Fragments Towards Establishing Completeness Properties of Second-Order Quantifier Elimination Methods)
• Some Notes on Managing Closure Operators  + (Some Notes on Managing Closure Operators)
• Some Notes on Pseudo-closed Sets  + (Some Notes on Pseudo-closed Sets)
• Some Remarks on Human Reasoning, Logic Programs and Connectionist Systems  + (Some Remarks on Human Reasoning, Logic Programs and Connectionist Systems)
• Some advances in tools and algorithms for the construction and analysis of systems  + (Some advances in tools and algorithms for the construction and analysis of systems)
• Sonic—Non-standard Inferences go OilEd  + (Sonic—Non-standard Inferences go OilEd)
• Sonic—System Description  + (Sonic—System Description)
• Sound Statistical Model Checking for Probabilities and Expected Rewards  + (Sound Statistical Model Checking for Probabilities and Expected Rewards)
• Sound, Complete and Minimal UCQ-Rewriting for Existential Rules  + (Sound, Complete and Minimal UCQ-Rewriting for Existential Rules)
• Sound, Complete, and Minimal Query Rewriting for Existential Rules  + (Sound, Complete, and Minimal Query Rewriting for Existential Rules)
• Foundations of Logic Programming  + (Soundness and Restricted Completeness of SLDNF Resolution)
• Foundations of Logic Programming  + (Soundness and Restricted Completeness of SLDNF Resolution)