Search by property
From International Center for Computational Logic
This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.
List of results
- Simon Razniewski + (Simon Razniewski)
- Simon Razniewski + (Simon Razniewski)
- 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)
- Simplifying Pseudo Boolean Problems + (Simplifying Pseudo Boolean Problems)
- 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)
- 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)
- Smoke Test Planning using Answer Set Programming + (Smoke Test Planning using Answer Set Programming)
- Smoke Test Planning using Answer Set Programming + (Smoke Test Planning using Answer Set Programming)
- Social Events + (Social Events)
- Software AG + (Software AG)
- Software AG + (Software AG)
- Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata + (Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata)
- Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata + (Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata)
- Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata + (Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata)
- Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata + (Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata)
- 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)
- 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 Angry Birds with Reinforcement Learning + (Solving Angry Birds with Reinforcement Learning)
- Solving Angry Birds with Reinforcement Learning + (Solving Angry Birds with Reinforcement Learning)
- Solving Angry Birds with Reinforcement Learning + (Solving Angry Birds with Reinforcement Learning)
- Solving Angry Birds with Reinforcement Learning + (Solving Angry Birds with Reinforcement Learning)
- Solving Angry Birds with Reinforcement Learning + (Solving Angry Birds with Reinforcement Learning)
- Solving Angry Birds with Reinforcement Learning + (Solving Angry Birds with Reinforcement Learning)
- Solving Datalog(S) Problems with Lazy-Grounding ASP Solving + (Solving Datalog(S) Problems with Lazy-Grounding ASP Solving)
- Solving Datalog(S) Problems with Lazy-Grounding ASP Solving + (Solving Datalog(S) Problems with Lazy-Grounding ASP Solving)
- 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)
- Solving Mixed Linear Programs with Pseudo Boolean Solvers + (Solving Mixed Linear Programs with Pseudo Boolean Solvers)
- Solving Problems Exponentially Faster: Implementing a Nondeterministic Universal Turing Machine Using DNA + (Solving Problems Exponentially Faster: Implementing a Nondeterministic Universal Turing Machine Using DNA)
- Solving Problems Exponentially Faster: Implementing a Nondeterministic Universal Turing Machine Using DNA + (Solving Problems Exponentially Faster: Implementing a Nondeterministic Universal Turing Machine Using DNA)
- Solving Product Configuration Problems using Non-standard Reasoning Services + (Solving Product Configuration Problems using Non-standard Reasoning Services)
- Solving Product Configuration Problems using Non-standard Reasoning Services + (Solving Product Configuration Problems using Non-standard Reasoning Services)
- 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 school time tables with SAT + (Solving school time tables with SAT)
- 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)