{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:33Z","timestamp":1725664653210},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594871"},{"type":"electronic","value":"9783540492825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59487-6_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:19:09Z","timestamp":1330276749000},"page":"113-126","source":"Crossref","is-referenced-by-count":9,"title":["Computing the well-founded semantics faster"],"prefix":"10.1007","author":[{"given":"Kenneth A.","family":"Berman","sequence":"first","affiliation":[]},{"given":"John S.","family":"Schlipf","sequence":"additional","affiliation":[]},{"given":"John V.","family":"Franco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"9_CR1","unstructured":"J. Dix. A classification theory of semantics of normal logic programs: II. Weak properties. To appear in JCSS."},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W. F. Dowling","year":"1984","unstructured":"W. F. Dowling and J. H. Gallier. Linear time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 1 (1984), 267\u2013284.","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"9_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2(4):295\u2013312, 1985.","journal-title":"Journal of Logic Programming"},{"key":"9_CR4","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. 5th Int'l Conf. Symp. on Logic Programming, 1988."},{"key":"9_CR5","unstructured":"V. Lifschitz and H. Turner. Splitting a logic program. Preprint."},{"key":"9_CR6","volume-title":"Technical Report No. 243","author":"A. Itai","year":"1982","unstructured":"A. Itai and J. Makowsky, On the complexity of Herbrand's theorem. Technical Report No. 243, Department of Computer Science, Israel Institute of Technology, Haifa (1982)."},{"issue":"3","key":"9_CR7","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"W. Marek and M. Truszczy\u0144ski. Autoepistemic logic. Journal of the ACM 38(3), pages 588\u2013619, 1991.","journal-title":"Journal of the ACM"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"J. Reif. A topological approach to dynamic graph connectivity. Information Processing Letters 25(1), pages 65\u201370.","DOI":"10.1016\/0020-0190(87)90095-0"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"J. S. Schlipf. The expressive powers of the logic programming semantics. To appear in JCSS. A preliminary version appeared in Ninth ACM Symposium on Principles of Database Systems, pages 196\u2013204, 1990. Expanded version available as University of Cincinnati Computer Science Technical Report CIS-TR-90-3.","DOI":"10.1145\/298514.298564"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0743-1066(90)90026-2","volume":"8","author":"M. G. Scutell\u00e0","year":"1990","unstructured":"M. G. Scutell\u00e0. A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability. Journal of Logic Programming 8, pages 265\u2013273, 1990.","journal-title":"Journal of Logic Programming"},{"key":"9_CR11","unstructured":"V. S. Subrahmanian, personal communication."},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan, \u201cDepth first search and linear graph algorithms,\u201d SIAM Journal on Computing 1 (1972), 146\u2013160.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"A. Van Gelder. The alternating fixpoint of logic programs with negation. In Eighth ACM Symposium on Principles of Database Systems, pages 1\u201310, 1989. Available from UC Santa Cruz as UCSC-CRL-88-17.","DOI":"10.1145\/73721.73722"},{"issue":"3","key":"9_CR14","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. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM 38(3), pages 620\u2013650, 1991.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59487-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:27:27Z","timestamp":1605648447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59487-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594871","9783540492825"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-59487-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}