Abstract
This paper reviews several methods to associate transition relations to transition system specifications with negative premises in Plotkin's structural operational style. Besides a formal comparison on generality and relative consistency, the methods are also evaluated on their taste in determining which specifications are meaningful and which are not.
This work was supported by ONR under grant number N00014-92-J-1974.
Full version available as Report STAN-CS-TN-95-16, and by ftp from boole.stanford.edu.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K.R. Apt & R. Bol (1994): Logic programming and negation: A survey. Journal of Logic Programming 19–20, pp. 9–71.
B. Bloom, S. Istrail & A.R. Meyer (1995): Bisimulation can't be traced. JACM 42(1), pp. 232–268.
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. RodrÃguez, editors: Proceedings 18th ICALP, Madrid, LNCS 510, Springer-Verlag, pp. 481–494. Full version to appear in JACM.
K.L. Clark (1978): Negation as failure. In H. Gallaire & J. Minker, editors: Logic and Databases, Plenum Press, New York, pp. 293–322.
F. Fages (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.
A. van Gelder, K. Ross & J.S. Schlipf (1991): The well-founded semantics for general logic programs, JACM 38(3), pp. 620–650.
M. Gelfond & V. Lifschitz (1988): The stable model semantics for logic programming. In R. Kowalski & K. Bowen, editors: Proceedings 5thInternational Conference on Logic Programming, MIT Press, Cambridge, USA, pp. 1070–1080.
J.F. Groote (1993): Transition system specifications with negative premises. Theoretical Computer Science 118(2), pp. 263–299.
J.F. Groote & F.W. Vaandrager (1992): Structured operational semantics and bisimulation as a congruence. Information and Computation 100(2), pp. 202–260.
G.D. Plotkin (1981): A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Glabbeek, R.J. (1996). The meaning of negative premises in transition system specifications II. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_154
Download citation
DOI: https://doi.org/10.1007/3-540-61440-0_154
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61440-1
Online ISBN: 978-3-540-68580-7
eBook Packages: Springer Book Archive