The complexity of equivalence, entailment, and minimization in existential positive logic
type: Item
instance of: scholarly article
title: The complexity of equivalence, entailment, and minimization in existential positive logic
zbMATH Open document ID: 1401.03030
author: Simone Bova
author: Hubie Chen
published in: Journal of Computer and System Sciences
publication date: 2014-11-24T00:00:00Z
Mathematics Subject Classification ID: 03B20
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6372037
zbMATH Keywords: existential positive logic
zbMATH Keywords: equivalence
zbMATH Keywords: entailment
zbMATH Keywords: finite-variable logics
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.jcss.2014.10.002
OpenAlex ID: W2022388196
cites work: The complexity of constraint satisfaction games and QCSP
cites work: On the complexity of existential positive queries
cites work: The core of a graph
cites work: Q3221403
cites work: Equivalences Among Relational Expressions with the Union and Difference Operators
DOI: 10.1016/J.JCSS.2014.10.002
description: scientific article; zbMATH DE number 6372037