UPV-EHU ADDI
  • Back
    • English
    • Español
    • Euskera
  • Login
  • English 
    • English
    • Español
    • Euskera
  • FAQ
View Item 
  •   Home
  • INVESTIGACIÓN
  • Artículos, Comunicaciones, Libros
  • Artículos
  • View Item
  •   Home
  • INVESTIGACIÓN
  • Artículos, Comunicaciones, Libros
  • Artículos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View/Open
1403.0222.pdf (793.2Kb)
Date
2014
Author
Chen, Hubert Ming
Metadata
Show full item record
Logical Methods in Computer Science 10(4) : (2014) // Article ID 14
URI
http://hdl.handle.net/10810/17494
Abstract
We consider the quanti fied 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 quanti fication, 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.
Collections
  • Artículos

DSpace software copyright © 2002-2015  DuraSpace
OpenAIRE
OpenAIRE
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesDepartamentos (cas.)Departamentos (eus.)SubjectsThis CollectionBy Issue DateAuthorsTitlesDepartamentos (cas.)Departamentos (eus.)Subjects

My Account

Login

Statistics

View Usage Statistics

DSpace software copyright © 2002-2015  DuraSpace
OpenAIRE
OpenAIRE