Document Type

Report

Date

7-1991

Embargo Period

5-2-2012

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.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-91-27

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.