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
- LATPub437 + (181-190)
- Regulated Nondeterminism in PDAs: The Non-Regular Case + (181-194)
- Verification of Golog Programs over Description Logic Actions + (181-196)
- Complexity of Terminological Reasoning Revisited + (181-200)
- Hierarchical control with partial observations: Sufficient conditions + (1817-1822)
- Experiments with deterministic $ømega$-automata for formulas of linear temporal logic + (182--195)
- Operational Semantics for a Fuzzy Logic Programming System with Defaults and Constructive Answers + (1827--1832)
- Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract) + (183-186)
- Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvemen + (183-192)
- A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics + (183-197)
- Alternating-Time Stream Logic for Multi-agent Systems + (184--198)
- Justifications for the Description Logics Knowledge Bases under the Fixed-Domain Semantics + (185--200)
- Deciding Bisimilarity and Similarity for Probabilistic Processes + (187--231)
- Did I Damage my Ontology? A Case for Conservative Extensions in Description Logics + (187-197)
- Conservative Extensions in Modal Logics + (187-207)
- Generalized Metrics and Uniquely Determined Logic Programs + (187-219)
- A Deduction Calculus for Cumulated Clauses on FLE Concept Descriptions + (188 - 201)
- Towards a Formal Account on Negative Latency + (188--214)
- A new context-based -subsumption algorithm + (188-191)
- PDL with Negation of Atomic Programs + (189-214)
- Finite-Cliquewidth Sets of Existential Rules – Toward a General Criterion for Decidable yet Highly Expressive Querying + (18:1-18:18)
- Probabilistic acceptors for languages over infinite words + (19--33)
- Effectiveness of Pre-computed Knowledge in Self-adaptation - A Robustness Study + (19--34)
- Symbolic model checking for channel-based component connectors + (19--37)
- Defeasible AceRules: A prototype + (19-22)
- On Indicative Conditionals + (19-30)
- On Indicative Conditionals + (19-30)
- A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method + (19-33)
- Utility and Feasibility of Reasoning beyond Decidability in Semantic Technologies + (19-34)
- Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms + (190--206)
- Web-Mining Defeasible Knowledge from Concessional Statements + (191-203)
- Investigating subclasses of abstract dialectical frameworks + (191-219)
- Consistency Reasoning in Lattice-Based Fuzzy Description Logics + (1917-1938)
- Expressiveness of Two-Valued Semantics for Abstract Dialectical Frameworks + (193--231)
- Optimisation Techniques for Combining Constraint Solvers + (193-210)
- A note on controllability of deterministic context-free systems + (1934-1937)
- Completion-based Generalization Inferences for the Description Logic ELOR with Subjective Probabilities + (1939-1970)
- Ontology-Mediated Probabilistic Model Checking + (194--211)
- Cardinality Restrictions on Concepts + (195-213)
- RFuzzy: Syntax, semantics and implementation details of a simple and expressive fuzzy tool over Prolog + (1951--1970)
- Exploring Relational Structures via FLE + (196 -- 212)
- An FCA Method for the Extensional Exploration of Relational Data + (197 -- 210)
- Models and Temporal Logics for Timed Component Connectors + (198--207)
- Partially-shared zero-suppressed multi-terminal BDDs: concept, algorithms and applications + (198--222)
- State Complexity of Projected Languages + (198-211)
- PDL with Intersection and Converse is 2EXP-complete + (198-212)
- Experiments with Deterministic $ømega$-Automata for Formulas of Linear temporal Logic + (199--212)
- Advanced Solving Technology for Dynamic and Reactive Applications + (199-200)
- The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics + (199-217)
- A Tableau Decision Algorithm for Modalized ALC with Constant Domains + (199-232)
