Universal Structures and the logic of Forbidden Patterns

DOI10.2168/LMCS-5(2:13)2009MaRDI QIDQ3636812zbMATH OpenFDO

Authors Florent R. Madelaine

Publication date 30 June 2009

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-5(2:13)2009

Mathematics Subject Classification ID

Logic in computer science (03B70) Model theory of finite structures (03C13) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Universal Structures and the Logic of Forbidden Patterns
• Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems
• Constraint Satisfaction, Logic and Forbidden Patterns
• The tractability of CSP classes defined by forbidden patterns
• Forbidden lifts (NP and CSP for combinatorialists)

Cited in

(8)

• Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems
• Universal Structures and the Logic of Forbidden Patterns
• A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
• Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
• On guarded extensions of MMSNP
• On guarded extensions of MMSNP
• Homogeneity and homogenizability: hard problems for the logic SNP
• GMSNP and finite structures

This page was built for publication: Universal Structures and the logic of Forbidden Patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636812)