Skip to content
<title>Channels - Faster Existential FO Model Checking on Posets :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Faster Existential FO Model Checking on Posets
Search for more channels:
Similar Items: Faster Existential FO Model Checking on Posets
Channel Options
View Record
Explore related channels
Quick Look
FO Model Checking of Interval Graphs
Quick Look
FO2(
Quick Look
Deciding definability in FO2(
Quick Look
Uniqueness of directed complete posets based on Scott closed set lattices
Quick Look
On logical hierarchies within FO^2-definable languages
Quick Look
Existential Definability over the Subword Ordering
Quick Look
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
Quick Look
Lower Bounds for Existential Pebble Games and k-Consistency Tests
Quick Look
Existential witness extraction in classical realizability and via a negative translation
Quick Look
Using models to model-check recursive schemes
Quick Look
Model Checking Probabilistic Pushdown Automata
Quick Look
Geometric Model Checking of Continuous Space
Quick Look
On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics
Quick Look
K-promotion on m-packed labelings of posets
Quick Look
Real-Time Model-Checking: Parameters everywhere
Quick Look
Linear Encodings of Bounded LTL Model Checking
Quick Look
Antichains for the Automata-Based Approach to Model-Checking
Quick Look
Intuitionistic implication makes model checking hard
Quick Look
Efficient CSL Model Checking Using Stratification
Quick Look
Model-Checking of Ordered Multi-Pushdown Automata
Quick Look
Model Checking Lower Bounds for Simple Graphs
Quick Look
Model Checking Spatial Logics for Closure Spaces
Quick Look
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Quick Look
Model-Checking Problems as a Basis for Parameterized Intractability
Load more items
View Record
Prev
Explore related channels
Next
