Skip to content
<title>Channels - The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
Search for more channels:
Similar Items: The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
Channel Options
View Record
Explore related channels
Quick Look
Small Promise CSPs that reduce to large CSPs
Quick Look
Universal Structures and the logic of Forbidden Patterns
Quick Look
Tractable Combinations of Temporal CSPs
Quick Look
On Ramsey properties of classes with forbidden trees
Quick Look
Monadic second-order definable graph orderings
Quick Look
Defining Recursive Predicates in Graph Orders
Quick Look
Existential Definability over the Subword Ordering
Quick Look
Forbidden-Context & Ordered Grammar Systems
Quick Look
Partial Order Infinitary Term Rewriting
Quick Look
Partially Ordered Automata and Piecewise Testability
Quick Look
Learning Concepts Definable in First-Order Logic with Counting
Quick Look
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix
Quick Look
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
Quick Look
Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
Quick Look
Advanced Model Consistency Restoration with Higher-Order Short-Cut Rules
Quick Look
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
Quick Look
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
Quick Look
Inferring Phylogenetic Networks from Allowed and Forbidden LCA-Constraints
Quick Look
A note on the expressive power of linear orders
Quick Look
On the Expressive Power of Higher-Order Pushdown Systems
Quick Look
Ellipses and Lambda Definability
Quick Look
Definable isomorphism problem
Quick Look
Deciding definability in FO2(
Quick Look
Software-Defined Networking powered by AI-driven Anomaly Detection
Load more items
View Record
Prev
Explore related channels
Next
