乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:34:58Z","timestamp":1725748498781},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405631"},{"type":"electronic","value":"9783642405648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_11","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T11:21:30Z","timestamp":1378984890000},"page":"102-115","source":"Crossref","is-referenced-by-count":9,"title":["Hex Semantics via Approximation Fixpoint Theory"],"prefix":"10.1007","author":[{"given":"Christian","family":"Anti\u0107","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Fink","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Anti\u0107, C.: Uniform approximation-theoretic semantics for logic programs with external atoms. Master\u2019s thesis, TU Vienna (2012), http:\/\/www.ub.tuwien.ac.at\/dipl\/2012\/AC07814506.pdf"},{"issue":"2","key":"11_CR2","first-page":"213","volume":"9","author":"S. Baselice","year":"2009","unstructured":"Baselice, S., Bonatti, P.A., Criscuolo, G.: On finitely recursive programs. TPLP\u00a09(2), 213\u2013238 (2009)","journal-title":"TPLP"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(78)90002-6","volume":"6","author":"R.S. Cohen","year":"1978","unstructured":"Cohen, R.S., Gold, A.Y.: \u03c9-computations on Turing machines. TCS\u00a06, 1\u201323 (1978)","journal-title":"TCS"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-30743-0_13","volume-title":"Correct Reasoning","author":"M. Denecker","year":"2012","unstructured":"Denecker, M., Bruynooghe, M., Vennekens, J.: Approximation fixpoint theory and the semantics of logic and answers set programs. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol.\u00a07265, pp. 178\u2013194. Springer, Heidelberg (2012)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 127\u2013144. Kluwer (2000)","DOI":"10.1007\/978-1-4615-1567-8_6"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence, 79\u2013122 (2003)","DOI":"10.1016\/S0004-3702(02)00293-X"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ic.2004.02.004","volume":"192","author":"M. Denecker","year":"2004","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Ultimate approximation and its application in nonmonotonic knowledge representation systems. Inf. Comp.\u00a0192(1), 84\u2013121 (2004)","journal-title":"Inf. Comp."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-04222-5_2","volume-title":"Frontiers of Combining Systems","author":"T. Eiter","year":"2009","unstructured":"Eiter, T., Brewka, G., Dao-Tran, M., Fink, M., Ianni, G., Krennwallner, T.: Combining nonmonotonic knowledge bases with external sources. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol.\u00a05749, pp. 18\u201342. Springer, Heidelberg (2009)"},{"issue":"2","key":"11_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1877714.1877717","volume":"12","author":"T. Eiter","year":"2011","unstructured":"Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R.: Well-founded semantics for description logic programs in the semantic web. ACM TOCL 12(2), 11:1\u201311:41 (2011)","journal-title":"ACM TOCL"},{"key":"11_CR10","unstructured":"Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In: Proc. IJCAI 2005, pp. 90\u201396 (2005)"},{"key":"11_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Logics in Artificial Intelligence","author":"W. Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: Semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"issue":"3-4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing\u00a09(3-4), 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. MIT Press (1992)","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"11_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-24609-1_15","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"V.W. Marek","year":"2003","unstructured":"Marek, V.W., Niemel\u00e4, I., Truszczy\u0144ski, M.: Logic programs with monotone cardinality atoms. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 154\u2013166. Springer, Heidelberg (2003)"},{"key":"11_CR15","unstructured":"Pelov, N., Truszczy\u0144ski, M.: Semantics of disjunctive programs with monotone aggreggates - an operator-based approach. In: Proc. NMR 2004, pp. 327\u2013334 (2004)"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S1471068406002973","volume":"7","author":"N. Pelov","year":"2007","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming\u00a07(3), 301\u2013353 (2007)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"4","key":"11_CR17","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T. Przymusinski","year":"1990","unstructured":"Przymusinski, T.: Well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae\u00a013(4), 445\u2013463 (1990)","journal-title":"Fundamenta Informaticae"},{"key":"11_CR18","unstructured":"Shen, Y.D.: Well-supported semantics for description logic programs. In: Proc. IJCAI 2011, pp. 1081\u20131086. AAAI Press (2011)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M.B. Smyth","year":"1978","unstructured":"Smyth, M.B.: Power domains. Journal of Computer and System Sciences\u00a016, 23\u201336 (1978)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3-4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10472-007-9049-2","volume":"48","author":"M. Truszczy\u0144ski","year":"2006","unstructured":"Truszczy\u0144ski, M.: Strong and uniform equivalence of nonmonotonic theories \u2013 an algebraic approach. Annals of Mathematics and Artificial Intelligence\u00a048(3-4), 245\u2013265 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM\u00a038(3), 619\u2013649 (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\/978-3-642-40564-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T02:59:51Z","timestamp":1646535591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}