{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:44:00Z","timestamp":1743151440228,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688211"},{"type":"electronic","value":"9783540688259"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68825-9_4","type":"book-chapter","created":{"date-parts":[[2008,5,19]],"date-time":"2008-05-19T04:05:55Z","timestamp":1211169955000},"page":"36-47","source":"Crossref","is-referenced-by-count":1,"title":["Some Simplified Forms of Reasoning with Distance-Based Entailments"],"prefix":"10.1007","author":[{"given":"Ofer","family":"Arieli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Zamansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Arieli, O.: Commonsense reasoning by distance semantics. In: Proc. TARK 2007, pp. 33\u201341 (2007)","DOI":"10.1145\/1324249.1324258"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Arieli, O.: Distance-based paraconsistent logics. International Journal of Approximate Reasoning (in press, 2008) doi = 10.1016\/j.ijar.2007.07.002","DOI":"10.1016\/j.ijar.2007.07.002"},{"issue":"8\u20139","key":"4_CR3","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.artint.2007.03.001","volume":"171","author":"M.L. Bonet","year":"2007","unstructured":"Bonet, M.L., Levy, J., Many\u00e1, F.: Resolution for Max-SAT. Artificial Intelligence\u00a0171(8\u20139), 606\u2013618 (2007)","journal-title":"Artificial Intelligence"},{"key":"4_CR4","unstructured":"Cholvy, L., Garion, C.: A logic to reason on contradictory beliefs with a majority approach. In: IJCAI 2001 Workshop on Inconsistency in Data and Knowledge (2001)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00247909","volume":"17","author":"A. Grove","year":"1988","unstructured":"Grove, A.: Two modellings for theory change. J. Phil. Logic\u00a017, 157\u2013180 (1988)","journal-title":"J. Phil. Logic"},{"key":"4_CR6","first-page":"68","volume-title":"Proc. AAAI 2006","author":"F. Heras","year":"2006","unstructured":"Heras, F., Larrosa, J.: New inference rules for efficient Max-SAT solving. In: Proc. AAAI 2006, pp. 68\u201373. AAAI Press, Menlo Park (2006)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Joy, S., Mitchell, J., Borchers, B.: A branch-and-cut algorithm for max-sat and weighted max-sat. Satisfiability Problem: Theory and Applications\u00a035 (1997)","DOI":"10.1090\/dimacs\/035\/13"},{"key":"4_CR8","volume-title":"Proc. FOCS 1997","author":"H. Karloff","year":"1997","unstructured":"Karloff, H., Zwick, U.: A 7\/8-approximation algorithm for MAX 3SAT? In: Proc. FOCS 1997, IEEE Press, Los Alamitos (1997)"},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1093\/logcom\/12.5.773","volume":"12","author":"S. Konieczny","year":"2002","unstructured":"Konieczny, S., Pino P\u00e9rez, R.: Merging information under constraints: a logical framework. Journal of Logic and Computation\u00a012(5), 773\u2013808 (2002)","journal-title":"Journal of Logic and Computation"},{"key":"4_CR10","volume-title":"Computational complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational complexity. Addison-Wesley, Reading (1994)"},{"issue":"1\u20132","key":"4_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.artint.2005.01.004","volume":"164","author":"Z. Xing","year":"2005","unstructured":"Xing, Z., Zhang, W.: axSolver: An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence\u00a0164(1\u20132), 47\u201380 (2005)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68825-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:31:16Z","timestamp":1558265476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68825-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540688211","9783540688259"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68825-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}