On weak positive predicates over a finite set
type: Item
instance of: scholarly article
title: On weak positive predicates over a finite set
zbMATH Open document ID: 1445.68142
author: Svetlana N. Selezneva
published in: Discrete Mathematics and Applications
publication date: 2020-07-30T00:00:00Z
Mathematics Subject Classification ID: 68R07
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7226074
zbMATH Keywords: predicate over finite set
zbMATH Keywords: function over finite set
zbMATH Keywords: semilattice function
zbMATH Keywords: weak positive predicate
zbMATH Keywords: conjunctive normal form
zbMATH Keywords: generalized satisfiability problem
zbMATH Keywords: constraint satisfaction problem
zbMATH Keywords: polynomial-time problem
MaRDI profile type: Publication
full work available at URL: dma-2020-0019
OpenAlex ID: W3035348643
cites work: Constraints, consistency and closure
cites work: Closure properties of constraints
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: Existence theorems for weakly symmetric operations
cites work: The complexity of satisfiability problems
cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set
cites work: Tractable constraints on ordered domains
cites work: The property of being polynomial for Mal’tsev constraint satisfaction problems
cites work: On bijunctive predicates over a finite set
cites work: Q3268312
cites work: From local to global consistency
DOI: 10.1515/DMA-2020-0019
description: scientific article; zbMATH DE number 7226074