Document Type
Report
Date
7-1991
Keywords
logic programming
Language
English
Disciplines
Computer Sciences
Description/Abstract
The class of locally stratified logic programs is shown to be Π11-complete by the construction of a reducibility of the class of infinitely branching nondeterministic finite register machines.nondeterministic finite register machines.
Recommended Citation
Cholak, Peter and Blair, Howard A., "The Complexity of Local Stratification" (1991). Electrical Engineering and Computer Science - Technical Reports. 106.
https://surface.syr.edu/eecs_techreports/106
Source
local
Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-91-27