{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:25Z","timestamp":1725561265448},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206422"},{"type":"electronic","value":"9783540245995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24599-5_17","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:53:55Z","timestamp":1280379235000},"page":"239-253","source":"Crossref","is-referenced-by-count":11,"title":["Answer Set Programming Phase Transition: A Study on Randomly Generated Programs"],"prefix":"10.1007","author":[{"given":"Yuting","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangzhen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Babovich, Y., Erdem, E., Lifschitz, V.: Fages\u2019 theorem and answer set programming. In: Proc. of NMR 2000 (2000)"},{"key":"17_CR2","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI 1991, Sydney, Australia, pp. 331\u2013337 (1991)"},{"key":"17_CR3","first-page":"293","volume-title":"Logics and Databases","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logics and Databases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","first-page":"364","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for non-monotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol.\u00a01265, pp. 364\u2013375. Springer, Heidelberg (1997)"},{"key":"17_CR5","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of clark\u2019s completion and existence of stable of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"17_CR6","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. Fifth International Conference and Symposium on Logic Programming, pp. 1070\u20131080 (1988)"},{"key":"17_CR7","unstructured":"Gent, I.P., Walsh, T.: The SAT phase transition. In: Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI 1994), pp. 105\u2013109 (1994)"},{"issue":"3,4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1023\/A:1018982106545","volume":"25","author":"C. Giannella","year":"1999","unstructured":"Giannella, C., Schlipf, J.: An empirical study of the 4-valued kripke kleene semantics and 4-valued well-founded semantics in random propositional logic programs. Annals of Mathematics and Artificial Intelligence\u00a025(3,4), 275\u2013309 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"17_CR9","volume-title":"Proceedings 15th Canadian Conference on AI","author":"G.-S. Huang","year":"2002","unstructured":"Huang, G.-S., Jia, X., Liau, C.-J., You, J.-H.: Two-literal logic programs and satisfiability representation of stable models: A comparison. In: Proceedings 15th Canadian Conference on AI, Springer, Heidelberg (2002)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0004-3702(87)90033-6","volume":"33","author":"B.A. Huberman","year":"1987","unstructured":"Huberman, B.A., Hogg, T.: Phase transitions in artificial intelligence systems. Artificial Intelligence\u00a033, 155\u2013171 (1987)","journal-title":"Artificial Intelligence"},{"key":"17_CR11","volume-title":"Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002)","author":"F. Lin","year":"2002","unstructured":"Lin, F., Zhao, Y.: Assat: Computing answer sets of a logic program by sat solvers. In: Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002). AAAI Press, Menlo Park (2002)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczynski, M.: Autoepistemic logic. Journal of the ACM\u00a0(38), 588\u2013619 (1991)","DOI":"10.1145\/116825.116836"},{"key":"17_CR13","first-page":"459","volume-title":"Proceedings of the Tenth National Conference on Artificial Intelligence","author":"D.G. Mitchell","year":"1992","unstructured":"Mitchell, D.G., Selman, B., Levesque, H.J.: Hard and easy distributions for SAT problems. In: Rosenbloom, P., Szolovits, P. (eds.) Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 459\u2013465. AAAI Press, Menlo Park (1992)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<414::AID-RSA10>3.0.CO;2-G","volume":"15","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: (2+p)-sat: Relation of typical-case complexity to the nature of the phase transition. Random Structures And Algorithms\u00a015, 414\u2013435 (1999)","journal-title":"Random Structures And Algorithms"},{"key":"17_CR15","unstructured":"Niemela, I., Simons, P.: Efficient implementation of the well-founded and stable model semantics. In: Joint International Conference and Symposium on Logic Programming, pp. 289\u2013303 (1996)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden van","year":"1976","unstructured":"van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. JACM\u00a023, 733\u2013742 (1976)","journal-title":"JACM"},{"key":"17_CR17","unstructured":"Walsh, T.: The interface between p and np: Col, xor, nae, 1-in-k, and horn sat. In: Proceedings of AAAI 2002 (2002)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24599-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T11:33:20Z","timestamp":1552822400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24599-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206422","9783540245995"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24599-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}