{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:55:57Z","timestamp":1762458957766},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614401"},{"type":"electronic","value":"9783540685807"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61440-0_154","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:38:33Z","timestamp":1330292313000},"page":"502-513","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The meaning of negative premises in transition system specifications II"],"prefix":"10.1007","author":[{"given":"R. J.","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19\u201320","author":"K.R. Apt","year":"1994","unstructured":"K.R. Apt & R. Bol (1994): Logic programming and negation: A survey. Journal of Logic Programming 19\u201320, pp. 9\u201371.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"42_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"B. Bloom, S. Istrail & A.R. Meyer (1995): Bisimulation can't be traced. JACM 42(1), pp. 232\u2013268.","journal-title":"JACM"},{"key":"42_CR3","first-page":"481","volume-title":"LNCS 510","author":"R.N. Bol","year":"1991","unstructured":"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\u00edguez, editors: Proceedings 18th ICALP, Madrid, LNCS 510, Springer-Verlag, pp. 481\u2013494. Full version to appear in JACM."},{"key":"42_CR4","first-page":"293","volume-title":"Logic and Databases","author":"K.L. Clark","year":"1978","unstructured":"K.L. Clark (1978): Negation as failure. In H. Gallaire & J. Minker, editors: Logic and Databases, Plenum Press, New York, pp. 293\u2013322."},{"issue":"4","key":"42_CR5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF03037172","volume":"9","author":"F. Fages","year":"1991","unstructured":"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\u2013443.","journal-title":"New Generation Computing"},{"issue":"3","key":"42_CR6","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder van","year":"1991","unstructured":"A. van Gelder, K. Ross & J.S. Schlipf (1991): The well-founded semantics for general logic programs, JACM 38(3), pp. 620\u2013650.","journal-title":"JACM"},{"key":"42_CR7","first-page":"1070","volume-title":"The stable model semantics for logic programming","author":"M. Gelfond","year":"1988","unstructured":"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\u20131080."},{"issue":"2","key":"42_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"J.F. Groote","year":"1993","unstructured":"J.F. Groote (1993): Transition system specifications with negative premises. Theoretical Computer Science 118(2), pp. 263\u2013299.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"42_CR9","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"J.F. Groote & F.W. Vaandrager (1992): Structured operational semantics and bisimulation as a congruence. Information and Computation 100(2), pp. 202\u2013260.","journal-title":"Information and Computation"},{"key":"42_CR10","unstructured":"G.D. Plotkin (1981): A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013216.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61440-0_154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:20:21Z","timestamp":1578536421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61440-0_154"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614401","9783540685807"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61440-0_154","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}