Search by property

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

• Robust and Efficient Large-large Table Outer Joins on Distributed Infrastructures  + (Robust and Efficient Large-large Table Outer Joins on Distributed Infrastructures)
• Robust and Skew-resistant Parallel Joins in Shared-nothing Systems  + (Robust and Skew-resistant Parallel Joins in Shared-nothing Systems)
• Robust mobile robot localisation from sparse and noisy proximity readings using Hough transform and probability grids  + (Robust mobile robot localisation from sparse and noisy proximity readings using Hough transform and probability grids)
• LATPub439  + (Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes)
• Role-depth Bounded Least Common Subsumers for EL+ and ELI  + (Role-depth Bounded Least Common Subsumers for EL+ and ELI)
• LATPub527  + (Role-depth bounded Least Common Subsumer in Prob-EL with Nominals)
• Algorithmic Game Theory  + (Room occupied by RoboLab)
• Rough EL Classification  + (Rough EL Classification)
• Roughening the EL Envelope  + (Roughening the EL Envelope)
• Rule Extraction from Trained ANN: A Survey  + (Rule Extraction from Trained ANN: A Survey)
• Rule-Based OWL Modeling with ROWLTab Protégé Plugin  + (Rule-Based OWL Modeling with ROWLTab Protégé Plugin)
• Foundations of Semantic Web Technologies  + (Rules and N3)
• Knowledge Graphs  + (Rules for Querying Graphs)
• Foundations of Semantic Web Technologies  + (Rules on the Web)
• Runtime Characterisation of Triple Stores  + (Runtime Characterisation of Triple Stores)
• Runtime Verification Using a Temporal Description Logic  + (Runtime Verification Using a Temporal Description Logic)
• Runtime Verification Using a Temporal Description Logic Revisited  + (Runtime Verification Using a Temporal Description Logic Revisited)
• Runtime Verification Using the Temporal Description Logic ALC-LTL Revisited  + (Runtime Verification Using the Temporal Description Logic ALC-LTL Revisited)
• Rushing and Strolling among Answer Sets - Navigation Made Easy  + (Rushing and Strolling among Answer Sets - Navigation Made Easy)
• Rushing and Strolling among Answer Sets - Navigation Made Easy  + (Rushing and Strolling among Answer Sets - Navigation Made Easy)
• Rushing and Strolling among Answer Sets - Navigation Made Easy  + (Rushing and Strolling among Answer Sets - Navigation Made Easy)
• Rushing and Strolling among Answer Sets - Navigation Made Easy (Extended Abstract)  + (Rushing and Strolling among Answer Sets - Navigation Made Easy (Extended Abstract))
• Rushing and Strolling among Answer Sets – Navigation Made Easy (Extended Abstract)  + (Rushing and Strolling among Answer Sets – Navigation Made Easy (Extended Abstract))
• Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian  + (Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian)
• SAT-Solving  + (SAT - Programming)
• SAT-Solving  + (SAT Algorithms)

• SAT Encoding of Unification in EL  + (SAT Encoding of Unification in EL)
• SAT Encoding of Unification in EL  + (SAT Encoding of Unification in EL)

• SAT Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies  + (SAT Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies)
• SAT-Solving  + (SAT Introduction)
• SAT-Solving  + (SAT Problems)
• SAT Solving - Scheduling, Generic CDCL, Partitioning  + (SAT Solving - Scheduling, Generic CDCL, Partitioning)
• Finite and algorithmic model theory (22/23)  + (SAT of FO is undecidable. The quest of finding decidable fragments (survey on recent research trends))
• SAT-Based Analysis and Quantification of Information Flow in Programs  + (SAT-Based Analysis and Quantification of Information Flow in Programs)
• SAT-Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies  + (SAT-Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies)
• SAT-Solving  + (SAT-Solving)
• SAT-Solving  + (SAT-Solving)
• SAT-Solving  + (SAT-Solving)
• SAT-Solving (SudokuSAT)  + (SAT-Solving (SudokuSAT))
• SAT-Solving: State-of-the-Art and Challenges (INFOCOM-6)  + (SAT-Solving: State-of-the-Art and Challenges (INFOCOM-6))
• SATPin: Axiom Pinpointing for Lightweight Description Logics through Incremental SAT  + (SATPin: Axiom Pinpointing for Lightweight Description Logics through Incremental SAT)
• SI! Automata Can Show PSPACE Results for Description Logics  + (SI! Automata Can Show PSPACE Results for Description Logics)
• Foundations of Logic Programming  + (SLD Resolution)
• Foundations of Logic Programming  + (SLD Resolution)
• SNOMED CT's Problem List: Ontologists' and Logicians' Therapy Suggestions  + (SNOMED CT's Problem List: Ontologists' and Logicians' Therapy Suggestions)
• SNOMED reaching its adolescence: Ontologists' and logicians' health check  + (SNOMED reaching its adolescence: Ontologists' and logicians' health check)
• SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings  + (SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings)
• Foundations of Semantic Web Technologies  + (SPARQL)
• Knowledge Graphs  + (SPARQL)
• Foundations of Semantic Web Technologies  + (SPARQL)
• Foundations of Semantic Web Technologies  + (SPARQL - Algebra)
• Foundations of Semantic Web Technologies  + (SPARQL - Entailment Regimes)