Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
| dc.creator | Martin, Barnaby | |
| dc.date | 2008-08-05 | |
| dc.date.accessioned | 2026-07-07T09:54:47Z | |
| dc.date.available | 2026-07-07T09:54:47Z | |
| dc.description | We study the model checking problem, for fixed structures A, over positive equality-free first-order logic -- a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(A). We prove a complete complexity classification for this problem when A ranges over 1.) boolean structures and 2.) digraphs of size (less than or equal to) three. The former class displays dichotomy between Logspace and Pspace-complete, while the latter class displays tetrachotomy between Logspace, NP-complete, co-NP-complete and Pspace-complete. | |
| dc.identifier | https://arxiv.org/abs/0808.0647 | |
| dc.identifier | http://arxiv.org/abs/0808.0647 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/166442 | |
| dc.subject | Computational Complexity | |
| dc.subject | Logic in Computer Science | |
| dc.title | Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three | |
| dc.type | text |