On m-Junctive Predicates on a Finite Set

DOI10.1134/S199047891903013XzbMath1438.68064OpenAlexW2970425421WikidataQ127312340 ScholiaQ127312340MaRDI QIDQ4973259

Svetlana N. Selezneva

Publication date: 2 December 2019

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199047891903013x

zbMATH Keywords

conjunctive normal formgeneralized satisfiability problembijunctive predicatenear-unanimity function\(m\)-junctive predicatefunction on a finite setpredicate on a finite set

Mathematics Subject Classification ID

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

Related Items (1)

On properties of multiaffine predicates on a finite set

Cites Work

• On weak positive predicates over a finite set
• An optimal k-consistency algorithm
• From local to global consistency
• Constraints, consistency and closure
• On bijunctive predicates over a finite set
• The property of being polynomial for Mal’tsev constraint satisfaction problems
• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• Closure properties of constraints
• Classifying the Complexity of Constraints Using Finite Algebras
• Function Algebras on Finite Sets
• The complexity of satisfiability problems
• Tractable constraints on ordered domains

This page was built for publication: On m-Junctive Predicates on a Finite Set