Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction

DOI10.2168/LMCS-10(4:14)2014zbMath1325.03071arXiv1403.0222OpenAlexW1817491722MaRDI QIDQ2938767

Hubie Chen

Publication date: 15 January 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.0222

zbMATH Keywords

proof systemQ-resolutionquantified constraint satisfaction

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity of proofs (03F20)

Related Items (2)

Quantified Constraints in Twenty Seventeen ⋮ How many variables are needed to express an existential positive query?

This page was built for publication: Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction