Stewart, I. A. (2003) 'Using program schemes to capture polynomial-time logically on certain classes of structures.', LMS journal of computation and mathematics., 6 . pp. 40-67.
We continue the study of the expressive power of certain classes of program schemes on finite structures, in relation to more mainstream logics studied in finite model theory and to computational complexity. We show that there exists a program scheme, whose constructs are assignments and while-loops with quantifier-free tests and which has access to a stack, that can accept a P-complete problem, the deterministic path system problem, even in the absence of non-determinism so long as problem instances are presented in a functional style. (Our proof leans heavily on Cook's proof that the classes of formal languages accepted by deterministic and non-deterministic logspace auxiliary pushdown machines coincide). However, whilst our result is of independent interest, as it leads to a deterministic model of computation capturing P whose non-deterministic variant also captures P, we then show how our constructed program scheme can be used to build a successor relation in certain classes of structures, namely: the class of strongly-connected locally-ordered digraphs; the class of connected planar embeddings; and the class of triangulations, with the consequence that on these classes of graphs, (a fragment of) path system logic (with no built-in relations) captures exactly the polynomial-time solvable problems.
|Keywords:||Computational complexity. Descriptive complexity. Finite model theory.|
|Full text:||PDF - Accepted Version (224Kb)|
|Publisher Web site:||http://www.lms.ac.uk/jcm/6/lms2002-004/|
|Record Created:||29 Jun 2009 15:35|
|Last Modified:||10 Nov 2011 11:04|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|