{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:56Z","timestamp":1725565436184},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156748"},{"type":"electronic","value":"9783642156755"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15675-5_11","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T00:07:17Z","timestamp":1284336437000},"page":"104-116","source":"Crossref","is-referenced-by-count":5,"title":["dl2asp: Implementing Default Logic via Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Yin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Hai","family":"Wan","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10472-009-9109-x","volume":"53","author":"A. Bochman","year":"2008","unstructured":"Bochman, A.: Default logic generalized and simplified. Ann. Math. Artif. Intell.\u00a053(1-4), 21\u201349 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S. Bouveret","year":"2008","unstructured":"Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. JAIR\u00a032, 525\u2013564 (2008)","journal-title":"JAIR"},{"issue":"1-2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0004-3702(99)00053-3","volume":"112","author":"P. Cholewinski","year":"1999","unstructured":"Cholewinski, P., Marek, V.W., Truszczynski, M., Mikitiuk, A.: Computing with default logic. Artificial Intelligence (AIJ)\u00a0112(1-2), 105\u2013146 (1999)","journal-title":"Artificial Intelligence (AIJ)"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E. Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv.\u00a033(3), 374\u2013425 (2001)","journal-title":"ACM Comput. Surv."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"11_CR6","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: IJCAI, pp. 386\u2013392 (2007)"},{"key":"11_CR7","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP\/SLP, pp. 1070\u20131080 (1988)"},{"issue":"3\/4","key":"11_CR8","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 Comput.\u00a09(3\/4), 365\u2013386 (1991)","journal-title":"New Generation Comput."},{"key":"11_CR9","unstructured":"Gelfond, M., Przymusinska, H., Lifschitz, V., Truszczynski, M.: Disjunctive defaults. In: KR, pp. 230\u2013237 (1991)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"Gottlob, G.: Complexity results for nonmonotonic logics. Journal of Logic and Computation\u00a02, 397\u2013425 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"11_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-49545-2_15","volume-title":"Logics in Artificial Intelligence","author":"T. Janhunen","year":"1998","unstructured":"Janhunen, T.: On the intertranslatability of autoepistemic, default and priority logics, and parallel circumscription. In: Dix, J., Fari\u00f1as del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol.\u00a01489, pp. 216\u2013232. Springer, Heidelberg (1998)"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Log.\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"11_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-24609-1_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Lierler","year":"2003","unstructured":"Lierler, Y., Maratea, M.: Cmodels-2: Sat-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 346\u2013350. Springer, Heidelberg (2003)"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"M.H. Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. Journal of Automated Reasoning (JAR)\u00a040(1), 1\u201333 (2008)","journal-title":"Journal of Automated Reasoning (JAR)"},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.2131","volume":"28","author":"F. Lin","year":"2007","unstructured":"Lin, F., Chen, Y.: Discovering classes of strongly equivalent logic programs. J. Artif. Intell. Res. (JAIR)\u00a028, 431\u2013451 (2007)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"11_CR16","unstructured":"Nicolas, P., Saubion, F., St\u00e9phan, I.: Gadel: a genetic algorithm to compute default logic extensions. In: ECAI, pp. 484\u2013490 (2000)"},{"issue":"4","key":"11_CR17","first-page":"503","volume":"10","author":"P. Nicolas","year":"2001","unstructured":"Nicolas, P., Saubion, F., St\u00e9phan, I.: Heuristics for a default logic reasoning system. IJAIT\u00a010(4), 503\u2013523 (2001)","journal-title":"IJAIT"},{"key":"11_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-49426-X_16","volume-title":"Applications of Uncertainty Formalisms","author":"P. Nicolas","year":"1998","unstructured":"Nicolas, P., Schaub, T.: The xray system: an implementation platform for local query-answering in default logics. In: Hunter, A., Parsons, S. (eds.) Applications of Uncertainty Formalisms. LNCS (LNAI), vol.\u00a01455, pp. 354\u2013378. Springer, Heidelberg (1998)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-63255-7_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I. Niemel\u00e4","year":"1997","unstructured":"Niemel\u00e4, I., Simons, P.: Smodels - an implementation of the stable model and well-founded semantics for normal lp. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol.\u00a01265, pp. 421\u2013430. Springer, Heidelberg (1997)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-642-02906-6_52","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"M. Dao-Tran","year":"2009","unstructured":"Dao-Tran, M., Eiter, T., Krennwallner, T.: Realizing Default Logic over Description Logic Knowledge Bases. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol.\u00a05590, pp. 602\u2013613. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"11_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence (AIJ)\u00a013(1-2), 81\u2013132 (1980)","journal-title":"Artificial Intelligence (AIJ)"},{"key":"11_CR22","unstructured":"Zhou, Y., Lin, F., Zhang, Y.: General default logic. Annals of Mathematics and Artificial Intelligence (2010) (to appear)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15675-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T06:14:31Z","timestamp":1553062471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15675-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156748","9783642156755"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15675-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}