The complexity of equivalence, entailment, and minimization in existential positive logic
From MaRDI portal
Publication:473196
DOI10.1016/J.JCSS.2014.10.002zbMath1401.03030OpenAlexW2022388196MaRDI QIDQ473196
Publication date: 24 November 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2014.10.002
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)
Cites Work
This page was built for publication: The complexity of equivalence, entailment, and minimization in existential positive logic