The E xpressiveness of Locally Stratified P rograms

[1]  Victor W. Marek,et al.  Stable Semantics for Logic Programs and Default Theories , 1989, NACLP.

[2]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.

[3]  John C. Shepherdson.  Unsolvable Problems for SLDNF Resolution , 1991, J. Log. Program..

[4]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[5]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[6]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[7]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[8]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[9]  Teodor C. Przymusinski.  Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.

[10]  Phokion G. Kolaitis.  The Expressive Power of Stratified Programs , 1991, Inf. Comput..

[11]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

[12]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[13]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[14]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[15]  Hajnal Andréka,et al.  The generalized completeness of Horn predicate-logic as a programming language , 1978, Acta Cybern..

[16]  R. Smullyan.  First-Order Logic , 1968 .

[17]  Howard A. Blair,et al.  The Recursion-Theoretical Complexity of the Semantics of Predicate Logic as a Programming Language , 1982, Inf. Control..

[18]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[19]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[20]  Krzysztof R. Apt,et al.  Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.

[21]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[22]  Howard A. Blair,et al.  The Complexity of Local Stratification , 1994, Fundam. Informaticae.