Search by property
From International Center for Computational Logic
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
- Kontraktionssätze auf verallgemeinerten metrischen Räumen + (6)
- BCU Mathematics Contest 2001 — Problems and Solutions + (6)
- Efficient Skew Handling for Outer Joins in a Cloud Computing Environment + (6)
- Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas + (6)
- Smoke Test Planning using Answer Set Programming + (6)
- Models and temporal logical specifications for timed component connectors + (6)
- Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator + (60)
- Deciding Bisimilarity and Similarity for Probabilistic Processes + (60)
- Using Sums-of-Products for Non-standard Reasoning + (6031)
- Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures + (607)
- A Generic Approach for Correcting Access Restrictions to a Consequence + (6088)
- On conditional decomposability + (61)
- Modeling component connectors in Reo by constraint automata + (61)
- Towards Approximative Most Specific Concepts by Completion for EL with Subjective Probabilities + (613)
- Proceedings of the First International Workshop on Uncertainty in Description Logics + (613)
- Conceptual Knowledge Acquisition Using Automatically Generated Large-Scale Semantic Networks + (6208)
- Complexity in Union-Free Regular Languages + (6224)
- The Credo Methodology (Extended Version) + (6286)
- Complexity of Infimal Observable Superlanguages + (63)
- Complexity of Verifying Nonblockingness in Modular Supervisory Control + (63)
- A Core Method for the Weak Completion Semantics with Skeptical Abduction + (63)
- A Rule-Based Language for Complex Event Processing and Reasoning + (6333)
- On the Semantic Relationship between Datalog and Description Logics + (6333)
- Query-Based Access Control for Ontologies + (6333)
- Efficient Inferencing for OWL EL + (6341)
- SAT Encoding of Unification in EL + (6397)
- Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics + (6397)
- Design and Verification of Systems with Exogenous Coordination Using Vereofy + (6416)
- Integrated Metamodeling and Diagnosis in OWL 2 + (6496)
- SPARQL Beyond Subgraph Matching + (6496)
- Succinctness and tractability of closure operator representations + (658, Part B)
- On the Verification of Qualitative Properties of Probabilistic Processes under Fairness Constraints + (66)
- Some Complexity Results about Essential Closed Sets + (6628)
- Modeling and Verification of Components and Connectors + (6659)
- On the Complexity of Boolean Unification + (67)
- Extensions of Concept Languages for a Mechanical Engineering Application + (671)
- Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets + (6717)
- General A- and AX-Unification via Optimized Combination Procedures + (677)
- Description Logics That Count, and What They Can and Cannot Count + (68)
- Unification in the Description Logic EL without the Top Concept + (6803)
- State Complexity of Projected Languages + (6808)
- On boolean combinations forming piecewise testable languages + (682)
- Retractable Complex Event Processing and Stream Reasoning + (6826)
- A Declarative Framework for Matching Iterative and Aggregative Patterns against Event Streams + (6826)
- Utility and Feasibility of Reasoning beyond Decidability in Semantic Technologies + (6828)
- Foundations of Description Logics + (6848)
- Computing Intensional Answers to Questions - An Inductive Logic Programming Approach + (69)
- An Overview of Tableau Algorithms for Description Logics + (69)
- Combination Techniques and Decision Problems for Disunification + (690)
- A Compositional Framework for Controller Synthesis + (6901)
