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

• Next directions in experimental data for seismic hazard mitigation  + (535-546)
• PSpace Reasoning with the Description Logic ALCF(D)  + (535-568)
• Connecting Many-Sorted Theories  + (535-583)
• On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops  + (537-552)
• Non-commutativity and MELL in the Calculus of Structures  + (54-68)
• The Complexity of Enriched µ-Calculi  + (540-551)
• Presburger Concept Cardinality Constraints in Very Expressive Description Logics – Allegro sexagenarioso ma non ritardando  + (542-561)
• Finite Entailment of Local Queries in the Z family of Description Logics  + (5487--5494)
• EMIL: Extracting Meaning from Inconsistent Language: Towards argumentation using a controlled natural language interface  + (55--84)
• The Basics of Display Calculi  + (55-100)
• Semantic Modularity and Module Extraction in Description Logics  + (55-59)
• On the Undecidability of Fuzzy Description Logics with GCIs and Product t-norm  + (55-70)
• EMIL: Extracting Meaning from Inconsistent Language: Towards argumentation using a controlled natural language interface  + (55-84)
• Expressivity of Planning with Horn Description Logic Ontologies  + (5503--5511)
• A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions  + (554-565)
• The Logical Difference for ELHr-Terminologies using Hypergraphs  + (555-560)
• Efficient Skew Handling for Outer Joins in a Cloud Computing Environment  + (558 - 571)
• Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies  + (55–75)
• Where do business students turn for help? An empirical study on dictionary use in foreign-language learning  + (55–99)
• Pcasso -- a Parallel CooperAtive Sat SOlver  + (56)
• Unfolding the Well-founded Semantics  + (56-59)
• Business lexicography  + (561-582)
• Answering Queries with Negation over Existential Rules  + (5626-5633)
• Rushing and Strolling among Answer Sets - Navigation Made Easy  + (5651-5659)
• Metric Semantics for True Concurrent Real Time  + (568--579)

• Extending Unification in EL Towards General TBoxes  + (568-572)

• Deciding Hyperproperties Combined with Functional Specifications  + (56:1--56:13)
• Smoke Test Planning using Answer Set Programming  + (57--65)
• PROBMELA: a modeling language for communicating probabilistic processes  + (57--66)
• Some Experimental Results on Randomly Generating Formal Contexts  + (57-69)
• New CNF Features and Formula Classification  + (57-71)
• The Varieties of Ought-implies-Can and Deontic STIT Logic  + (57-76)
• The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules  + (574–584)
• Control of Distributed Systems: Tutorial and Overview  + (579-602)
• A note on the attractor-property of infinite-state Markov chains  + (58--63)
• Fuzzy DLs over Finite Lattices with Nominals  + (58-70)
• Schema-Agnostic Query Rewriting in SPARQL 1.1  + (584-600)
• Runtime Verification Using the Temporal Description Logic ALC-LTL Revisited  + (584-613)
• Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication  + (585-608)
• Contextual abduction and its complexity issues  + (58–70)
• Weak Bisimulation for Fully Probabilistic Processes  + (59--68)
• Models and temporal logical specifications for timed component connectors  + (59--82)
• Constructible differentially finite algebraic series in several variables  + (59-66)
• Strategies in Flexible Dispute Derivations for Assumption-Based Argumentation  + (59-72)
• Complexity of Language Equations With One-Sided Concatenation and All Boolean Operations  + (59-73)
• A Database Approach for Modeling and Querying Video Data  + (6-13)
• Real-Time Complex Event Recognition and Reasoning-a Logic Programming Approach  + (6-57)
• The Weak Completion Semantics and Counter Examples  + (60--73)
• Metric Temporal Description Logics with Interval-Rigid Names  + (60--76)
• Generating compact MTBDD-representations from Probmela specifications  + (60--76)
• Characterizing logic programming semantics with level mappings  + (60-67)