ACM Home Page
Please provide us with feedback. Feedback
The well-founded semantics for general logic programs
Full text PdfPdf (2.10 MB)
Source Journal of the ACM (JACM) archive
Volume 38 ,  Issue 3  (July 1991) table of contents
Pages: 619 - 649  
Year of Publication: 1991
ISSN:0004-5411
Authors
Allen Van Gelder  Univ. of California at Santa Cruz, Santa Cruz
Kenneth A. Ross  Sanford Univ., Stanford, CA
John S. Schlipf  Univ. of Cincinnati, Cincinnati, OH
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 107,   Citation Count: 196
Additional Information:

references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/116825.116838
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
2
3
 
4
CHANDRA, A., AND HAREL, D. Structure and complexity of relational queries. J. Comput. Syst. Sci. 25, 1 (I982), 99-128.
 
5
CHANDRA, A., AND HAREL, D. Horn clause queries and generalizations. J. Logic Prog. 2, 1 (1985), 1 - 15.
 
6
CLARK, K.L. Negation as failure. In H. Gallaire and J. Minker, eds., Logic and Databases. Plenum Press, New York, 1978, pp. 293-322.
 
7
DUMMETT, M. A.E. Elements of Intuitionism. Clarendon Press, Oxford, England, 1977.
 
8
DUNG, PH. M., AND KANCHANASUT, K. A natural semantics for logic programs with negation. Tech. Rep. Asian Institute of Technology, Bangkok 10501, Thailand, 1989. (manuscript).
 
9
FITTINC, M. A Kripke-Kleene semantics for logic programs. J. Logic Progr. 2, 4 (1985), 295-312.
 
10
GELFOND, M. On stratified autoepistemic theories. In Proceedings of the 6th National Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., 1987, pp. 207-211.
 
11
GELFOND, M, AND LIFSCHITZ, V. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash.). IEEE, New York, 1988, pp. 1070-1080.
 
12
GUREVrCrI, Y., AND SHELAH, S. Fixed-point extensions of first order logic. Ann. Pure Appl. Logic 32 (1986), 265-280.
 
13
HANKS, S., AND MCDERMOTT, D. Default reasoning, nonmonotonic logics, and the frame problem. In Proceedings of 5th National Conference on Artificial intelligence. Morgan- Kaufmann, San Mateo, Calif., 1986, pp. 328-333.
 
14
 
15
JAFFAR, J., LASSEZ, J.-L., AND LLOYD, J. Completeness of the negation-as-failure rule. In Proceedings of the International Joint Conference on Artificial Intelligence. Morgan- Kaufmann, San Mateo, Calif., 1983, pp. 500-506.
 
16
 
17
 
18
KUNEN, K. Some remarks on the completed database. Tech. Rep. 775. Univ. of Wisconsin, Madison, Wisc., 1988. (Abstract appeared in Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash., Aug.) 1988).
 
19
 
20
 
21
LLOYD, J, W., AND TOPOR, R. W. Making Prolog more expressive. J. Logic Prog. 1. 3 (1984), 225-240.
 
22
 
23
MAREK, W. Stable theories in autoepistemic logic. Tech. Rep., Univ. Kentucky, Lexington, Ky., 1986.
 
24
MAREK, A., AND TRUSZCZYNSKI, M. Autoepistemic logic. Tech. Rep., Umv. Kentucky, Lexington, Ky., 1988.
 
25
 
26
 
27
MORRIS, K. Talk at Workshop XP8.3i, Oregon Graduate Center, July 1987.
 
28
 
29
 
30
PRZYMUSINSKA, H, AND PRZYMUSINSKI, T. C. Weakly perfect model semantics for logic programs. In Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash.), 1988, pp. 1106-1120.
 
31
32
 
33
REITER, R. On closed world databases. In H. Gallaire and J. Minker, Logic and Databases. Plenum Press, New York, 1978, pp. 55-76.
34
 
35
 
36
SCHLIPF, J. S. Negation by securable failure in logic programming. Unpubhshed manuscript, 1987.
 
37
 
38
39
 
40
 
41
 
42
43

CITED BY  198


REVIEW

"Chris Nikolopoulos : Reviewer"

A general logic program is a Horn clause logic program with negations. Two approaches have been tried to extend logic programs with negation: the program completion approach (the closed world assumption and SLDNF resolution augmented with nega  more...

Collaborative Colleagues:
Allen Van Gelder: colleagues
Kenneth A. Ross: colleagues
John S. Schlipf: colleagues