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
- 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)
- 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)
- How (Not) To Minimize Events + (60-71)
- Towards an Error-Tolerant Construction of EL^ -Ontologies from Data Using Formal Concept Analysis + (60-75)
- Complexity of Verifying Nonblockingness in Modular Supervisory Control + (602-607)
- Computing Cores for Existential Rules with the Standard Chase and ASP + (603-613)
- The Triguarded Fragment of First-Order Logic + (604-619)
- Instantiating rule-based defeasible theories in abstract dialectical frameworks and beyond + (605--627)
- SYANCO 2007: International Workshop on Synthesis and Analysis of Component Connectors + (607-608)
- Algorithms for Reasoning in Very Expressive Description Logics under Infinitely Valued Gödel Semantics + (60–101)
- Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes + (61--76)
- Parallel Variable Elimination on CNF Formulas + (61-73)
- Modeling the Suppression Task under Weak Completion and Well-Founded Semantics + (61-85)
- Wikidata: The Making Of + (615--624)
- Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints + (616-623)
- Extending Description Logics to Vague Knowledge in Medicine + (617-635)
- ExpExpExplosion: Uniform Interpolation in General EL Terminologies + (618-623)
- On the Complexity of Universality for Partially Ordered NFAs + (61:1--61:14)
- RFuzzy Framework + (62--76)
- The Fuzzy Description Logic G-FL_0 with Greatest Fixed-Point Semantics + (62-76)
- Lexico-Logical Acquisition of OWL DL Axioms - An Integrated Approach to Ontology Refinement + (62-77)
- Terminological Cycles in KL-ONE-based Knowledge Representation Languages + (621-626)