On bijunctive predicates over a finite set

DOI10.1515/dma-2019-0006zbMath1410.68149OpenAlexW2917672728WikidataQ128315480 ScholiaQ128315480MaRDI QIDQ1741483

Svetlana N. Selezneva

Publication date: 3 May 2019

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2019-0006

zbMATH Keywords

constraint satisfaction problemmajority functionconjunctive normal formpolynomial problemgeneralized satisfiability problembijunctive predicatefunction over a finite setpredicate over a finite set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Descriptive complexity and finite models (68Q19)

Related Items (3)

On properties of multiaffine predicates on a finite set ⋮ On m-Junctive Predicates on a Finite Set ⋮ On weak positive predicates over a finite set

Cites Work

• Unnamed Item
• From local to global consistency
• Constraints, consistency and closure
• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• Closure properties of constraints
• Classifying the Complexity of Constraints Using Finite Algebras
• The complexity of satisfiability problems
• Tractable constraints on ordered domains

This page was built for publication: On bijunctive predicates over a finite set