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

• Admissibility in Probabilistic Argumentation  + (87-98)
• System BV is NP-complete  + (87-99)
• Boolean Functions with Ordered Domains in Answer Set Programming  + (879--885)
• On the Semantic Relationship between Datalog and Description Logics  + (88-102)
• A computational logic approach to human syllogistic reasoning  + (883-888)
• Generating Clique Coloring Problem Formulas  + (89)
• Generic CDCL – A Formalization of Modern Propositional Satisfiability Solvers  + (89-102)
• Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy  + (89-102)
• Interval-based Temporal Reasoning with General TBoxes  + (89-94)
• Using Queries as Schema-Templates for Graph Databases  + (89-98)
• Causality-Based Game Solving  + (894--917)
• Mixing Materialization and Query Rewriting for Existential Rules  + (897-902)
• Solving a PSPACE-complete problem by gene assembly  + (897-908)
• OntoComP: A Protege Plugin for Completing OWL Ontologies  + (898-902)
• Report on the Sixth Conference on Artificial General Intelligence  + (9-125)
• Terminologie und Multilinguales Semantic Web in Symbiose – TBX, RDF und OWL  + (9-13)
• A Semantics for Open Normal Defaults via a Modified Preferential Approach  + (9-16)
• A Generalized Next-Closure Algorithm — Enumerating Semilattice Elements from a Generating Set  + (9-20)
• A Data Warehouse Conceptual Data Model for Multidimensional Aggregation: a preliminary report  + (9-21)
• A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices  + (9-24)
• Reasoning with Concrete Domains  + (90-95)
• Compositional Matrix-Space Models of Language  + (907-916)
• Efficient Data Redistribution to Speedup Big Data Analytics in Large Systems  + (91-100)
• Automata-based Axiom Pinpointing  + (91-129)
• Temporal Tableaux  + (91-134)

• A Note on Unification Type Zero  + (91-93)

• The Inverse Method Implements the Automata Approach for Modal Satisfiability  + (92-106)
• Restricted chase (non)termination for existential rules with disjunctions  + (922-928)
• The cf2 argumentation semantics revisited  + (925-949)
• Chase Termination Beyond Polynomial Time  + (93)
• Semantic MediaWiki  + (935-942)
• On a structural property in the state complexity of projected regular languages  + (93–105)
• Satisfiability of ECTL* with tree constraints  + (94 - 108)
• Materializing Knowledge Bases via Trigger Graphs  + (943-956)
• Semantic Node-RED for rapid development of interoperable industrial IoT applications  + (949-975)
• On the Combination of Partial Action Descriptions  + (95-106)
• Fallverwaltung in heterogenen Fallwissensbasen  + (95-107)
• A Probability Theoretic Analysis of Score Systems  + (95-108)
• Semantic Characterizations of AGM Revision for Tarskian Logics  + (95-110)
• Admissibility in Probabilistic Argumentation  + (957-1004)
• Linear Logic and Noncommutativity in the Calculus of Structures  + (96)
• Probabilistic Model Checking for Energy-Utility Analysis  + (96--123)
• Computing Least Common Subsumers in Description Logics with Existential Restrictions  + (96-101)
• Model Checking Probabilistic Systems  + (963--999)
• Extending Decidable Existential Rules by Joining Acyclicity and Guardedness  + (963-968)
• A bridge between decentralized and coordination control  + (966-972)
• Tuple-Generating Dependencies Capture Complex Values (extended abstract)  + (97--103)
• All But Not Nothing: Left-Hand Side Universals for Tractable OWL Profiles  + (97--108)
• Design and Verification of Systems with Exogenous Coordination Using Vereofy  + (97--111)
• Partial Order Reduction for Probabilistic Branching Time  + (97--116)
• Combination of Compatible Reduction Orderings that are Total on Ground Terms  + (97-106)