Verifying local stratifiability of logic programs and databases II

New Generation Computing

Volumn 14, Issue 3, 1996, Pages 317-341

  Shen, Yi Dong ^a,b,c  

^a CHONGQING UNIVERSITY   (China)

^b UNIVERSITÉ DE VALENCIENNES   (France)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Deductive Databases; Infinite Extending Paths; Local Stratifiability; Logic Programming; Verification

Indexed keywords

COMPUTATIONAL METHODS; DATABASE SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; TESTING;

INFINITE EXTENDING PATHS; LOCAL STRATIFIABILITY; VERIFICATION;

LOGIC PROGRAMMING;

EID: 0029710107     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037486     Document Type: Article

References (7)

1. Apt, K. R., Blair, H. A., and Walker, A., "Towards a Theory of Declarative Knowledge," in Foundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publishers, Los Altos, CA, pp. 89-148, 1988.
2. Cholak, P., "Post Correspondence Problem and Prolog Programs," Technical Report, University of Wisconsin, Madison, 1988.
3. McCarthy, J., "Applications of Circumscription to Formalizing Common Sense Knowledge," Artificial Intelligence, 28, 1, pp. 89-116, 1986.
4. Palopoli, L., "Testing Logic Programs for Local Stratification," Theoretical Computer Science, 103, pp. 205-234, 1992.
5. Przymusinski, T., "On the Declarative Semantics of Deductive Databases and Logic Programs," in Foundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publishers, Los Altos, CA, pp. 193-216, 1988.
6. Shen, Y. D., "Verifying Local Stratifiability of Logic Programs and Databases," New Generation Computing, 11, 1, Ohmsha, Ltd., Tokyo, pp. 23-46, 1992.
7. Van Gelder, A., "Negation as Failure Using Tight Derivations for General Logic Programs," in Foundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publishers, Los Altos, CA, pp. 149-176, 1988.