On m-junctive predicates on a finite set
DOI10.1134/S199047891903013XzbMATH Open1438.68064OpenAlexW2970425421WikidataQ127312340 ScholiaQ127312340MaRDI QIDQ4973259FDOQ4973259
Authors: 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
Recommendations
- On bijunctive predicates over a finite set
- On weak positive predicates over a finite set
- Universal algebras generated by sets of satisfying vectors of bijunctive and \(r\)-junctive Boolean functions
- scientific article; zbMATH DE number 4041859
- On properties of functions representable in the form of a 2-CNF
conjunctive normal formgeneralized satisfiability problembijunctive predicatenear-unanimity function\(m\)-junctive predicatefunction on a finite setpredicate on a finite set
Analysis of algorithms and problem complexity (68Q25) Descriptive complexity and finite models (68Q19)
Cites Work
- 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
- From local to global consistency
- Constraints, consistency and closure
- Tractable constraints on ordered domains
- An optimal k-consistency algorithm
- On bijunctive predicates over a finite set
- The property of being polynomial for Mal’tsev constraint satisfaction problems
- On weak positive predicates over a finite set
Cited In (5)
This page was built for publication: On \(m\)-junctive predicates on a finite set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973259)
