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
- A Correspondence between Temporal Description Logics +
- A First Order System with Finite Choice of Premises +
- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL +
- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL +
- A Logic-Based Approach to Dynamic Programming +
- A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics +
- A Tableau System for the Description Logic SHIO +
- A cartesian closed category of approximable concept structures +
- A generalized resolution theorem +
- A nice Cycle Rule for Goal-Directed E-Unification +
- A probabilistic visual sensor model for mobile robot localisation in structured environments +
- A systematic proof theory for several modal logics +
- Applying Formal Concept Analysis to Description Logics +
- Award1000 +
- Award1001 +
- Awards in 2004 +
- Begabtenförderung im MINT-Bereich +
- Combining Interval-based Temporal Reasoning with General TBoxes +
- Computing the Least Common Subsumer w.r.t. a Background Terminology +
- Computing the Least Common Subsumer w.r.t. a Background Terminology +
- Controller Synthesis for Probabilistic Systems +
- Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion +
- Default reasoning over domains and concept hierarchies +
- Description Logics +
- Description Logics with Concrete Domains and Functional Dependencies +
- Description Logics with Concrete Domains and Functional Dependencies +
- E-Connections of Abstract Description Systems +
- Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes +
- Exploring Relational Structures via FLE +
- FCPlanner: A Planning Strategy for First-Order MDPs +
- Fast Indexing of Codebook Vectors Using Dynamic Binary Search Trees With Fat Decision Hyperplanes +
- From the Calculus of Structures to Term Rewriting Systems +
- Generalized Ultrametric Spaces in Quantitative Domain Theory +
- Implementing Matching in ALN +
- Implementing System BV of the Calculus of Structures in Maude +
- Line Drawing, Leap Years, and Euclid +
- Logic Programs and Connectionist Networks +
- Logic Programs, Iterated Function Systems, and Recurrent Radial Basis Function Networks +
- Modal Logics of Topological Relations +
- Modal Logics of Topological Relations +
- Model Checking Action- and State-Labelled Markov Chains +
- Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract) +
- Models and Temporal Logics for Timed Component Connectors +
- Mona as a DL Reasoner +
- NExpTime-complete Description Logics with Concrete Domains +
- On Subsumption and Instance Problem in ELH w.r.t. General TBoxes +
- PDL with Negation of Atomic Programs +
- PROBMELA: a modeling language for communicating probabilistic processes +
- Partial Order Reduction for Probabilistic Systems +
- Plans as Formulae with a Non-commutative Logical Operator - Planning as Concurrency +
