{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T04:01:18Z","timestamp":1747627278312,"version":"3.40.5"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1018982106545","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"275-309","source":"Crossref","is-referenced-by-count":1,"title":["An empirical study of the 4\u2010valued Kripke\u2013Kleene and 4\u2010valued well\u2010founded semantics in random propositional logic programs"],"prefix":"10.1007","volume":"25","author":[{"given":"Chris","family":"Giannella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Schlipf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"325526_CR1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579198","volume":"7","author":"B. Bollobas","year":"1987","unstructured":"B. Bollobas and A.G. Thomason, Threshold functions, Combinatorica 7 (1987) 35-38.","journal-title":"Combinatorica"},{"issue":"5","key":"325526_CR2","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/69.542027","volume":"8","author":"W. Chen","year":"1996","unstructured":"W. Chen and D. Warren, Computation of stable models and its integration with logical query processing, IEEE Trans. Knowledge Data Engrg. 8(5) (1996) 742-757.","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"325526_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0304-3975(92)90285-N","volume":"105","author":"P.M. Dung","year":"1992","unstructured":"P.M. Dung, On the relations between the stable semantics and the well-founded semantics, Theoret. Comput. Sci. 105 (1992) 7-25.","journal-title":"Theoret. Comput. Sci."},{"key":"325526_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7 (1960) 201-215.","journal-title":"Journal of the ACM"},{"key":"325526_CR5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"4","author":"M. Fitting","year":"1985","unstructured":"M. Fitting, A Kripke-Kleene semantics for logic programs, J. Logic Programming 4 (1985) 295-312.","journal-title":"J. Logic Programming"},{"key":"325526_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0743-1066(93)90031-B","volume":"17","author":"M. Fitting","year":"1993","unstructured":"M. Fitting, A family of stable models, J. Logic Programming 17 (1993) 197-225.","journal-title":"J. Logic Programming"},{"key":"325526_CR7","unstructured":"M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the 5th International Conference Symposium on Logic Programming (1988) pp. 1070-1080."},{"key":"325526_CR8","unstructured":"C. Giannella and J. Schlipf, An empirical study of the 3-valued Kripke-Kleene semantics in random propositional logic programs, in: Proceedings of the 7th International Workshop on Non-Monotonic Reasoning (NM '98) (1998) pp. 41-49."},{"key":"325526_CR9","unstructured":"Knaster, Un th\u00e9or\u00e8me sur les fonctions d'ensambles, Ann. Soc. Polon. Math. (1928) 133-134."},{"key":"325526_CR10","series-title":"Technical Report","volume-title":"Evidence for a satisfiability threshold for random 3CNF formulas","author":"T. Larrabee","year":"1992","unstructured":"T. Larrabee and Y. Tsuji, Evidence for a satisfiability threshold for random 3CNF formulas, Technical Report, University of California, Santa Cruz, CA (1992)."},{"key":"325526_CR11","doi-asserted-by":"crossref","unstructured":"W. Marek, A. Nerode and J. Remmel, How complicated is the set of stable models of a recursive logic program?, Ann. Pure Appl. Logic (1992) 119-135.","DOI":"10.1016\/0168-0072(92)90069-C"},{"key":"325526_CR12","unstructured":"W. Marek and M. Truszczynski, Autoepistemic logic, Journal of the ACM (1991) 588-619."},{"key":"325526_CR13","unstructured":"D. Mitchell, B. Selman and H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92) (1992) pp. 459-465."},{"key":"325526_CR14","unstructured":"I. Niemel\u00e4 and P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (1996) pp. 289-303."},{"key":"325526_CR15","unstructured":"P. Simons, Towards constraint satisfaction through logic programs and the stable semantics, Technical Report, Digital Systems Laboratory, Helsinki University of Technology (1997)."},{"key":"325526_CR16","doi-asserted-by":"crossref","unstructured":"V.S. Subrahmanian, D. Nau and C. Vago, WFS + Branch and Bound = stable models, IEEE Trans. Knowledge Data Engrg. (1995) 362-377.","DOI":"10.1109\/69.390244"},{"key":"325526_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.","journal-title":"Pacific J. Math."},{"key":"325526_CR18","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, K. Ross and J. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM (1991) 620-650.","DOI":"10.1145\/116825.116838"},{"key":"325526_CR19","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, The alternating fixpoint of logic programs with Negation, in: Proceedings of the 8th ACM Symposium on Principals of Database Systems (1989) pp. 1-10.","DOI":"10.1145\/73721.73722"},{"key":"325526_CR20","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, The alternating fixpoint of logic programs with negation, J. Comput. System Sci. (1993) 185-221.","DOI":"10.1016\/0022-0000(93)90024-Q"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018982106545.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018982106545\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018982106545.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:48:52Z","timestamp":1747547332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018982106545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":20,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["325526"],"URL":"https:\/\/doi.org\/10.1023\/a:1018982106545","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}