Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Chan. Constructive negation based on the completed database. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 111–125, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.
J. Komorowski. A Specification of an Abstract Prolog Machine and its Application to Partial Evaluation. PhD thesis, University of Linkoping, 1981.
J. Komorowski. Synthesis of Programs in the Framework of Partial Deduction. Research report A-81, Abo Akademi, Abo, Finland, July 1989.
J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, New York, N.Y., second edition, 1987.
J.W. Lloyd and J.C. Shepherdson. Partial Evaluation in Logic Programming. Research report CS-87-09, University of Bristol, 1987. (to appear in the Journal of Logic Programming).
T. C. Przymusinski and W. Drabent. Constructive Negation for Well-Founded Semantics. Research report, University of Linkoping, Sweden, 1991.
A. Pettorossi and M. Proietti. Decidability Results and Characterization of Strategies for the Development of Logic Programs. In Proc. Sixth Intl. Conf. on Logic Programming, pages 539–553, 1989.
H. Przymusinska and T. C. Przymusinski. Semantic issues in deductive databases and logic programs. In R. Banerji, editor, Formal Techniques in Artificial Intelligence, pages 321–367, North-Holland, Amsterdam, 1990.
T. C. Przymusinski. Every logic program has a natural stratification and an iterated fixed point model. In Proceedings of the Eighth Symposium on Principles of Database Systems, pages 11–21, ACM SIGACT-SIGMOD, 1989.
T. C. Przymusinski. On constructive negation in logic programming. In Proceedings of the North American Logic Programming Conference, Cleveland, Ohio, October 1989, page (Addendum), Association for Logic Programming, MIT Press, Cambridge, Mass., 1989.
T. C. Przymusinski and D. S. Warren. Well-founded Semantics: Theory and Implementation. Research report, UT El Paso and SUNY at Stony Brook, 1991. (in preparation).
K. Ross. A procedural semantics for well founded negation in logic programs. In Proceedings of the Eighth Symposium on Principles of Database Systems, pages 22–33, ACM SIGACT-SIGMOD, 1989.
P. Sestoft and A.V. Zamulin. Literature list for partial evaluation and mixed computation. In Proceedings of IFIP Workshop on Partial Evaluation and Mixed Computation, Denmark, 1987.
A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 1990. (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Przymusinska, H., Przymusinski, T., Seki, H. (1992). Soundness and completeness of partial deductions for well-founded semantics. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013044
Download citation
DOI: https://doi.org/10.1007/BFb0013044
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55727-2
Online ISBN: 978-3-540-47279-7
eBook Packages: Springer Book Archive