On weak positive predicates over a finite set

DOI10.1515/DMA-2020-0019zbMATH Open1445.68142OpenAlexW3035348643MaRDI QIDQ783121FDOQ783121

Authors: Svetlana N. Selezneva 

Publication date: 30 July 2020

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

Full work available at URL: https://doi.org/10.1515/dma-2020-0019

Recommendations

• On bijunctive predicates over a finite set
• On \(m\)-junctive predicates on a finite set
• scientific article; zbMATH DE number 4041859
• On the complexity of reducing weakly positive and weakly negative Boolean functions
• Tractable constraints in finite semilattices

zbMATH Keywords

constraint satisfaction problemconjunctive normal formgeneralized satisfiability problemfunction over finite setpolynomial-time problempredicate over finite setsemilattice functionweak positive predicate

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Logic in computer science (03B70) Computational aspects of satisfiability (68R07)

Cites Work

• Existence theorems for weakly symmetric operations
• 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
• From local to global consistency
• Constraints, consistency and closure
• Tractable constraints on ordered domains
• Title not available (Why is that?)
• On bijunctive predicates over a finite set
• The property of being polynomial for Mal’tsev constraint satisfaction problems

Cited In (4)

• On \(m\)-junctive predicates on a finite set
• Title not available (Why is that?)
• On bijunctive predicates over a finite set
• On properties of multiaffine predicates on a finite set

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

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