The locality principle and completeness in logic programming

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The locality principle and completeness in logic programming

Full text

Pdf (492 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1994 ACM symposium on Applied computing table of contents

Phoenix, Arizona, United States

Pages: 286 - 291

Year of Publication: 1994

ISBN:0-89791-647-6

Authors

Howard C. Wasserman	Department of Computer Science, Queens College (CUNY)
Zhizhang Shen	Department of Computer Science, Plymouth State College (USNH)

Sponsors

SIGAPL: ACM Special Interest Group on APL Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGICE: ACM Special Interest Group on Individual Computing Environment
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 6, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/326619.326749 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	K. R. Apt , H. A. Blair , A. Walker, Towards a theory of declarative knowledge, Foundations of deductive databases and logic programming, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1988
	2	Cavedon, L. On the completeness of $LDNF- resolution. Technical Report 88/17, Dept. of Computer Science, Univ. of Melbourne, 1988.
	3	Clark, K.L. Negation as failure, in: H. Gallaire and J. Minker (eds.), Logic and Data Bases. Plenum Press, New York, 1978, 293-322.
	4	Clark, K.L. Logic-Programming schemes and their implementation, in: J. Lassez and G. Plotkin (eds.), Computational Logic. MIT Press, 1991.
	5	Hu, Y., and Li, Y.Y. Extended well-founded model semantics for general logic programs, in: K. Furukawa (ed.), Logic Programming: Proc. of the Eighth International Conference. MIT Press, 1991, 412-425.
	6	Kenneth Kunen, Signed data dependencies in logic programs, Journal of Logic Programming, v.7 n.3, p.231-245, Nov. 1989 [doi>10.1016/0743-1066(89)90022-8 ]
	7	J. W. Lloyd, Foundations of logic programming; (2nd extended ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	8	Elliott Mendelson, Introduction to mathematical logic (3rd ed.), Wadsworth Publ. Co., Belmont, CA, 1987
	9	Taisuke Sato, Completed logic programs and their consistency, Journal of Logic Programming, v.9 n.1, p.33-44, Jul. 1990 [doi>10.1016/0743-1066(90)90032-Z ]
	10	J. C. Shepherdson, Correct answers to allowed programs and queries are ground, Journal of Logic Programming, v.11 n.3-4, p.359-362, Oct./Nov. 1991 [doi>10.1016/0743-1066(91)90032-K ]