The Complexity Of Local Stratification

Authors:
Peter Cholak;Howard A. Blair
Affiliations:
(Research supported in part by the Army Research Office through the Mathematical Sciences Institute of Cornell University) Mathematical Sciences Institute, Cornell University, Ithaca, New York 148 ...;(Research supported in part by the Army Research Office through the Mathematical Sciences Institute of Cornell University and by the Systems Sciences Laboratory of the Xerox Corporation's Webster ...
Venue:
Fundamenta Informaticae
Year:
1994

Citing 6
Cited 3

Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs

Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
Arithmetic classification of perfect models of stratified programs

Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Unsolvable problems for SLDF resolution

Journal of Logic Programming
Computability of Recursive Functions

Journal of the ACM (JACM)

Locally stratified Boolean grammars

Information and Computation
Designing Dependencies

Fundamenta Informaticae
Computing stable models for nonmonotonic existential rules

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The class of locally stratified logic programs is shown to be Pi-1-1 complete by the construction of a reducibility of the class of infinitely branching nondeterministic finite register machines.