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

lmcs:1012 - Logical Methods in Computer Science, December 23, 2014, Volume 10, Issue 4
Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction

Authors: Chen, Hubie

We consider the quantified constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quantification, whether or not the sentence is true on the structure. We present a proof system for certifying the falsity of QCSP instances and develop its basic theory; for instance, we provide an algorithmic interpretation of its behavior. Our proof system places the established Q-resolution proof system in a broader context, and also allows us to derive QCSP tractability results.


Source : oai:arXiv.org:1403.0222
DOI : 10.2168/LMCS-10(4:14)2014
Volume: Volume 10, Issue 4
Published on: December 23, 2014
Submitted on: May 23, 2014
Keywords: Computer Science - Logic in Computer Science,Computer Science - Artificial Intelligence,Computer Science - Computational Complexity


Share

Consultation statistics

This page has been seen 69 times.
This article's PDF has been downloaded 52 times.