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

• Completing the Picture: Complexity of Graded Modal Logics with Converse  + (Bednarczyk)
• The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard (Extended Abstract)  + (Bednarczyk)
• Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract)  + (Bednarczyk)
• Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics  + (Bednarczyk)
• On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics  + (Bednarczyk)
• The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard  + (Bednarczyk)
• Finite Entailment of Local Queries in the Z family of Description Logics  + (Bednarczyk)
• Comonadic Semantics for Description Logics Games  + (Bednarczyk)
• Towards Model Theory of Ordered Logics: Expressivity and Interpolation  + (Bednarczyk)
• Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting  + (Bednarczyk)
• Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?  + (Bednarczyk)
• On Composing Finite Forests with Modal Logics  + (Bednarczyk)
• On the Limits of Decision: the Adjacent Fragment of First-Order Logic  + (Bednarczyk)
• Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features  + (Bednarczyk)
• How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC  + (Bednarczyk)
• Data Complexity in Expressive Description Logics With Path Expressions  + (Bednarczyk)
• Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features.  + (Bednarczyk)
• Database-Inspired Reasoning Problems in Description Logics With Path Expressions  + (Bednarczyk)
• Ausgezeichnete Informatikdissertationen 2002  + (Beilner)
• Ausgezeichnete Informatikdisserationen 2001  + (Beilner)
• Parallel MUS Extraction  + (Belov)
• Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2012)  + (Benedikt)
• On Monotonic Determinacy and Rewritability for Recursive Queries and Views  + (Benedikt)
• Defining Relations: a general incremental approach with spatial temporal case studies  + (Bennett)
• Vagueness in Predicates and Objects  + (Bennett)

• Constructible differentially finite algebraic series in several variables  + (Bergeron)

• GSAT versus Simulated Annealing  + (Beringer)
• Ausgezeichnete Informatikdissertationen 2011  + (Bernstein)
• Ausgezeichnete Informatikdissertationen 2012  + (Bernstein)
• Ausgezeichnete Informatikdissertationen 2009  + (Bernstein)
• Ausgezeichnete Informatikdissertationen 2006  + (Bernstein)
• Ausgezeichnete Informatikdissertationen 2008  + (Bernstein)
• Ausgezeichnete Informatikdissertationen 2011  + (Bernstein)
• Ausgezeichnete Informatikdissertationen 2007  + (Bernstein)
• Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, Košice, Slovakia, October 7-10, 2014  + (Bertet)
• Preface: Concept Lattices and Applications: Recent Advances and New Opportunities  + (Bertet)
• Stochastic Timed Automata  + (Bertrand)
• Deciding Hyperproperties Combined with Functional Specifications  + (Beutner)
• Humans Reason Skeptically  + (Bhadra)
• The Weak Completion Semantics and Counterexamples  + (Bhadra)
• In Memory of Steffen Hölldobler: From Logic to Formal and Cognitive Reasoning  + (Bhadra)
• Identifying Noise Variables in Singular Decisions using Counterfactual Reasoning  + (Bhadra)
• The Weak Completion Semantics and Counter Examples  + (Bhadra)
• Practical Linked Data Access via SPARQL: The Case of Wikidata  + (Bielefeldt)
• Complexity of Abduction in the EL Family of Lightweight Description Logics  + (Bienvenu)
• Prime Implicate Normal Form for ALC Concepts  + (Bienvenu)
• Detecting Cardinality Constraints in CNF  + (Biere)
• Détection de contraintes de cardinalité dans les CNF  + (Biere)
• Schema-Agnostic Query Rewriting in SPARQL 1.1  + (Bischof)
• Schema-Agnostic Query Rewriting for OWL QL  + (Bischof)
• A Behavioral Characterization of Computational Systems  + (Blanco)