论文信息 - Optimal Fixedpoints of Logic Programs

Optimal Fixedpoints of Logic Programs

Abstract From a declarative programming point of view, Manna and Shamir's optimal fixedpoint semantics is more appealing than the least fixedpoint semantics. However in standard formalisms of recursive programming the optimal fixedpoint is not computable while the least fixedpoint is. In the context of logic programming we show that the optimal fixedpoint is equal to the least fixedpoint and is computable. Furthermore the optimal fixedpoint semantics is consistent with Van Emden and Kowalski's semantics of logic programs.

Michael J. Maher | Jean-Louis Lassez

[1] Zohar Manna,et al. The Theoretical Aspects of the Optimal Fixed Point , 1976, SIAM J. Comput..

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

[3] Alan Mycroft,et al. Logic Programs and Many-Valued Logic , 1984, STACS.

[4] Michael J. Maher,et al. The Denotational Semantics of Horn Clauses as a Production System , 1983, AAAI.

[5] Krzysztof R. Apt,et al. Contributions to the Theory of Logic Programming , 1982, JACM.

[6] Zohar Manna,et al. The optimal approach to recursive programs , 1977, Commun. ACM.

[7] Robert A. Kowalski,et al. Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[8] Emil L. Post. Introduction to a General Theory of Elementary Propositions , 1921 .

[9] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .

[10] Zohar Manna,et al. A new approach to recursive programs. , 1975 .

[11] Michael J. Maher,et al. Closures and Fairness in the Semantics of Programming Logic , 1984, Theor. Comput. Sci..

[12] Michael J. Maher,et al. Logic Programming Language Scheme , 1986, Logic Programming: Functions, Relations, and Equations.