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

• An Ontology Selection and Ranking System Based on the Analytic Hierarchy Process.  + (293--300)
• Model Checking Markov Chains as Distribution Transformers  + (293--313)
• On restricted context-free grammars  + (293–304)
• The Fuzzy Description Logic ALC_FH with Hedge Algebras as Concept Modifiers  + (294-305)
• Automatic Verification of Liveness Properties of Randomized Systems  + (295)
• Efficiently Handling Skew in Outer Joins on Distributed Systems  + (295--304)
• Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting  + (295--308)
• Unique Supported-Model Classes of Logic Programs  + (295-302)
• Hybrid Unification in the Description Logic EL  + (295-310)
• Default Reasoning about Actions via Abstract Argumentation  + (297--309)
• Rewriting Concepts Using Terminologies  + (297-308)
• The Combined Approach to Query Answering Beyond the OWL 2 Profiles  + (2971--2977)
• On Defaults in Action Theories  + (298--305)
• Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and—What Else?  + (298-302)
• On the Computational Complexity of Naive-based Semantics for Abstract Dialectical Frameworks  + (2985--2991)
• Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition  + (299-310)
• Answering conjunctive queries in the SHIQ description logic  + (299-404)
• Standpoint Logic: Multi-Perspective Knowledge Representation  + (3 - 17)
• A Brief Introduction to Formal Concept Analysis  + (3--16)
• Probabilistic automata over infinite words: expressiveness, efficiency, and decidability  + (3--16)
• On the Semantic Foundations of Probabilistic Synchronous Reactive Programs  + (3--28)
• BCU Mathematics Contest 2001 — Problems and Solutions  + (3-16)
• A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic  + (3-24)
• Description Logics  + (3-28)
• SmartWeb: Mobile Access to the Semantic Web  + (3-4)

• A "Converse" of the Banach Contraction Mapping Theorem  + (3-6)

• Generalized Ultrametric Spaces in Quantitative Domain Theory  + (30--49)
• A Behavioral Characterization of Computational Systems  + (30-33)
• SAT-Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies  + (30-44)
• Towards Farsighted Dependencies for Existential Rules  + (30-45)
• A Two-tier Index Architecture for Fast Processing Large RDF Data over Distributed Memory  + (300-302)
• Computing in Civil Engineering  + (301-307)
• Combination Techniques and Decision Problems for Disunification  + (301-315)
• A categorical view on algebraic lattices in formal concept analysis  + (301-328)
• Sound, Complete, and Minimal Query Rewriting for Existential Rules  + (3017-3025)
• Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination (Technical Report)  + (301–310)
• A Purely Logical Account of Sequentiality in Proof Search  + (302-316)
• KI-96: Abvances in Artificial Intelligence  + (303-306)
• Concurrent Classification of EL Ontologies  + (305-320)
• Embedding Defaults into Terminological Representation Systems  + (306-317)
• A Probabilistic Quantitative Analysis of Probabilistic-Write/Copy-Select  + (307--321)
• A Framework for Semantic-based Similarity Measures for ELH-Concepts  + (307-319)
• Nominal Schemas in Description Logics: Complexities Clarified  + (308-317)
• On reduction criteria for probabilistic reward models  + (309--320)
• What Is a Reasonable Argumentation Semantics?  + (309-324)
• Combination Problems for Commutative/Monoidal Theories: How Algebra Can Help in Equational Reasoning  + (309-337)
• About the Expressive Power and Complexity of Order-Invariance with Two Variables  + (30:1--30:28)
• Simple Default Reasoning in Theories of Action  + (31--40)
• Bisimulations, logics, and trace distributions for stochastic systems with rewards  + (31--40)
• Situation Recognition for Service Management Systems Using OWL 2 Reasoners  + (31-36)
• A Logic-Based Approach to Dynamic Programming  + (31-36)