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
- Complexity of Infimal Observable Superlanguages + (10.1109/TAC.2017.2720424)
- Complexity of Verifying Nonblockingness in Modular Supervisory Control + (10.1109/TAC.2017.2726582)
- Efficient Skew Handling for Outer Joins in a Cloud Computing Environment + (10.1109/TCC.2015.2487965)
- Managing Structured and Semistructured RDF Data Using Structure Indexes + (10.1109/TKDE.2012.134)
- A Hardware/Software Stack for Heterogeneous Systems + (10.1109/TMSCS.2017.2771750)
- Fast Compression of Large Semantic Web Data using X10 + (10.1109/TPDS.2015.2496579)
- Model-Checking Algorithms for Continuous-Time Markov Chains + (10.1109/TSE.2003.1205180)
- Model Checking Markov Chains with Actions and State Labels + (10.1109/TSE.2007.36)
- Fostering Web Intelligence by Semi-automatic OWL Ontology Refinement + (10.1109/WIIAT.2008.36)
- Control of an Engineering-Structured Multilevel Discrete-Event System + (10.1109/WODES.2016.7497833)
- On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components + (10.1142/S0129054109006589)
- Complexity in Union-Free Regular Languages + (10.1142/S0129054111008933)
- A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata + (10.1142/S0129054113500068)
- Model checking meets performance evaluation + (10.1145/1059816.1059819)
- ProbMela and verification of Markov decision processes + (10.1145/1059816.1059821)
- ProbMeLa and Verification of Markov Decision Processes + (10.1145/1059816.1059821)
- Quantitative Analysis of Distributed Randomized Protocols + (10.1145/1081180.1081182)
- Verifying nondeterministic probabilistic channel systems against $ømega$-regular linear-time properties + (10.1145/1297658.1297663)
- Performance evaluation and model checking join forces + (10.1145/1810891.1810912)
- A Better Uncle for OWL: Nominal Schemas for Integrating Rules and Ontologies + (10.1145/1963405.1963496)
- Probabilistic $ømega$-Automata + (10.1145/2108242.2108243)
- Rare-Event Verification for Stochastic Hybrid Systems + (10.1145/2185632.2185665)
- Complexities of Horn Description Logics + (10.1145/2422085.2422087)
- A Logical Geo-Ontology Design Pattern for Quantifying over Types + (10.1145/2424321.2424352)
- Flag & Check: Data Access with Monadically Defined Queries + (10.1145/2463664.2465227)
- Distributed wait state tracking for runtime MPI deadlock detection + (10.1145/2503210.2503237)
- Probabilistic Model Checking for Energy Analysis in Software Product Lines + (10.1145/2577080.2577095)
- Automatic Verification of Liveness Properties of Randomized Systems + (10.1145/259380.259527)
- Expressiveness of guarded existential rule languages + (10.1145/2594538.2594556)
- Trade-off Analysis Meets Probabilistic Model Checking + (10.1145/2603088.2603089)
- Weight Monitoring with Linear Temporal Logic: Complexity and Decidability + (10.1145/2603088.2603162)
- Wikidata: a free collaborative knowledgebase + (10.1145/2629489)
- A Two-tier Index Architecture for Fast Processing Large RDF Data over Distributed Memory + (10.1145/2631775.2631789)
- Robust and Skew-resistant Parallel Joins in Shared-nothing Systems + (10.1145/2661829.2661888)
- High Throughput Indexing for Large-scale Semantic Web Data + (10.1145/2695664.2695920)
- Towards Automated Configuration of Systems with Non-Functional Constraints + (10.1145/3102980.3102999)
- Bisimulations, logics, and trace distributions for stochastic systems with rewards + (10.1145/3178126.3178139)
- Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable + (10.1145/3209108.3209120)
- Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes + (10.1145/3209108.3209184)
- From Verification to Synthesis under Cost-Utility Constraints + (10.1145/3292048.3292052)
- Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms + (10.1145/3310225)
- Modal Logics with Composition on Finite Forests: Expressivity and Complexity + (10.1145/3373718.3394787)
- From Features to Roles + (10.1145/3382025.3414962)
- Display to Labeled Proofs and Back Again for Tense Logics + (10.1145/3460492)
- A Journey to the Frontiers of Query Rewritability + (10.1145/3517804.3524163)
- Determinacy of Real Conjunctive Queries. The Boolean Case + (10.1145/3517804.3524168)
- Deciding Hyperproperties Combined with Functional Specifications + (10.1145/3531130.3533369)
- Wikidata: The Making Of + (10.1145/3543873.3585579)
- On Composing Finite Forests with Modal Logics + (10.1145/3569954)
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views + (10.1145/3572836)
- Bounded Treewidth and the Infinite Core Chase – Complications and Workarounds toward Decidable Querying + (10.1145/3584372.3588659)