Designing Dependencies

Authors:
Howard A. Blair
Affiliations:
School of Computer and Information Science, Syracuse University, Syracuse, New York, USA
Venue:
Fundamenta Informaticae
Year:
1996

Citing 8
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Metalogic programming and direct universal computability

Meta-programming in logic programming
Logic programming

Handbook of theoretical computer science (vol. B)
Logic for applications

Logic for applications
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Game Characterizations of Logic Program Properties

LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Trees, automata, and games

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The Complexity Of Local Stratification

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a binary recursively enumerable relation R, one or more logic programs over a language L can be constructed and interconnected to produce a dependency relation D on selected predicates within the Herbrand base B L of L isomorphic to R. D can be, optionally, a positive, negative or mixed dependency relation. The construction is applied to representing any effective game of the type introduced by Gurevich and Harrington, which they used to prove Rabin's decision method for S2S, as the dependency relation of a logic program. We allow games over an infinite alphabet of possible moves. We use this representation to reveal a common underlying reason, having to do with the shape of a program's dependency relation, for the complexity of several logic program properties.