Constraint satisfaction, irredundant axiomatisability and continuous colouring

DOI10.1007/s11225-012-9372-4zbMath1294.03021OpenAlexW2026679370MaRDI QIDQ361864

Marcel Jackson, Belinda Trotta

Publication date: 19 August 2013

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-012-9372-4

zbMATH Keywords

quasivarietyconstraint satisfaction problemsantivarietygraph dualitiesirredundant axiomatisabilitystandard topological quasivarieties

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Model theory of finite structures (03C13) Quasivarieties (08C15) Applications of model theory (03C98) Basic properties of first-order languages and structures (03C07)

Related Items (3)

Axiomatisability and hardness for universal Horn classes of hypergraphs ⋮ Relativised homomorphism preservation at the finite level ⋮ Boolean topological graphs of semigroups: the lack of first-order axiomatization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-equational bases for graphs of semigroups, monoids and groups.
• Residual properties of pre-bipartite digraphs
• The axiomatizability of topological prevarieties
• On the quasivarieties generated by finite semigroups
• On pseudovarieties
• On classes of relations and graphs determined by subobjects and factorobjects
• Open questions related to the problem of Birkhoff and Maltsev
• Antivarieties and colour-families of graphs.
• Finiteness properties of varieties and the restriction to finite algebras.
• Duality theorems for finite structures (characterising gaps and good characterisations)
• On digraph coloring problems and treewidth duality
• Standard topological algebras: syntactic and principal congruences and profiniteness
• RESIDUAL PROPERTIES OF SIMPLE GRAPHS
• Theorems on Compact Totally Disconnected Semigroups and Lattices
• Homomorphism preservation theorems
• EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
• FINITE SEMIGROUPS WITH INFINITE IRREDUNDANT IDENTITY BASES
• Flat algebras and the translation of universal Horn logic to equational logic
• A Characterisation of First-Order Constraint Satisfaction Problems
• Simple compact topological lattices

This page was built for publication: Constraint satisfaction, irredundant axiomatisability and continuous colouring