The meaning of negative premises in transition system specifications II

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1099, Issue , 1996, Pages 502-513

  van Glabbeek, R J ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS;

RELATIVE CONSISTENCY; TRANSITION RELATIONS; TRANSITION SYSTEM SPECIFICATION;

SPECIFICATIONS;

EID: 84947780127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_154     Document Type: Conference Paper

References (11)

1. K.R. apt & R. Bol (1994): Logic programming and negation: A survey. Journal of Logic Programming 19-20, pp. 9-71.
2. b. bloom, S. Istrail & A.R. Meyer (1995): Bisimulation can't be traced. JACM 42(1), pp. 232-268.
3. R.N. bol & J.F. groote (1991): The meaning of negative premises in transition system specifications (extended abstract). In J. Leach Albert, B. Monien & M. Rodriguez, editors: Proceedings 18"" ICALP, Madrid, LNCS 510, Springer-Verlag, pp. 481-494. Pull version to appear in JACM.
4. K.L. clark (1978): Negation as failure. In H. Gallaire Sz J. Minker, editors: Logic and Databases, Plenum Press, New York, pp. 293-322.
5. F. faces (1991): A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Generation Computing 9(4), pp. 425-443.
6. A. van gelder, K. Ross & J.S. schlipf (1991): The well-founded semantics for general logic programs, JACM 38(3), pp. 620-650.
7. th International Conference on Logic Programming, MIT Press, Cambridge, USA, pp. 1070-1080.
8. J.F. GROOTE (1993): Transition system, specifications with negative premises. Theoretical Computer Science 118(2), pp. 263-299.
9. J.F. GROOTE & F.W. vaandrager (1992): Structured operational semantics and bisimulation as a congruence. Information and Computation 100(2), pp. 202-260.
10. G.D. PLOTKIN (1981): A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University.
11. T.C. przymusinski (1988): On the declarative semantics of deductive databases and logic programs. In Jack Minker, editor: Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, Inc., pp. 193-216.