Complexity of existential positive first-order logic

DOI10.1007/978-3-642-03073-4_4MaRDI QIDQ6828860zbMATH OpenFDO

Authors Manuel Bodirsky, Miki Hermann, Florian Richoux

Publication date 28 July 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03073-4_4

zbMATH Keywords

computational complexityconstraint satisfaction problemsexistential positive first-order logic

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Complexity of existential positive first-order logic

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