The meaning of negative premises in transition system specifications II

Journal of Logic and Algebraic Programming

Volumn 60-61, Issue SUPPL., 2004, Pages 229-258

  Van Glabbeek, R J ^a  

^a Stanford University   (United States)

Author keywords

Logic programming; Negation as failure; Negative premises; Structural operational semantics

Indexed keywords

ALGEBRA; PROBLEM SOLVING; SEMANTICS; SPECIFICATIONS; STRUCTURED PROGRAMMING; THEOREM PROVING;

NEGATION AS FAILURE; NEGATIVE PREMISES; STRUCTURAL OPERATIONAL SEMANTICS; TRANSITION SYSTEM;

LOGIC PROGRAMMING;

EID: 2942582403     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2004.03.007     Document Type: Article

References (14)

1. Apt K.R., Bol R. Logic programming and negation: A survey. Journal of Logic Programming. 19-20:1994;9-71.
2. Bloom B., Istrail S., Meyer A.R. Bisimulation can't be traced. Journal of the ACM. 42(1):1995;232-268.
3. Bol R.N., Groote J.F. The meaning of negative premises in transition system specifications. Journal of the ACM. 43(5):1996;863-914.
4. Clark K.L. Negation as failure. Gallaire H., Minker J. Logic and Databases. 1978;293-322 Plenum Press, New York.
5. Fages F. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Generation Computing. 9(4):1991;425-443.
6. van Gelder A., Ross K., Schlipf J.S. The well-founded semantics for general logic programs. Journal of the ACM. 38(3):1991;620-650.
7. Gelfond M., Lifschitz V. The stable model semantics for logic programming. Kowalski R., Bowen K. Proceedings of 5th International Conference on Logic Programming. 1988;1070-1080 MIT Press, Cambridge, MA.
8. Fokkink W.J., van Glabbeek R.J. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation. 126(1):1996;1-10.
9. Groote J.F. Transition system specifications with negative premises. Theoretical Computer Science. 118(2):1993;263-299.
10. Groote J.F., Vaandrager F.W. Structured operational semantics and bisimulation as a congruence. Information and Computation. 100(2):1992;202-260.
11. G.D. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
12. Przymusinski T.C. On the declarative semantics of deductive databases and logic programs. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;193-216 Morgan Kaufmann Publishers Inc. Los Altos, CA.
13. Przymusinski T.C. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae. XIII(4):1990;445-463.
14. Verhoef C. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing. 2(2):1995;274-302.