{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:00Z","timestamp":1725544620906},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333395"},{"type":"electronic","value":"9783540333401"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11734673_14","type":"book-chapter","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T21:59:04Z","timestamp":1151963944000},"page":"173-187","source":"Crossref","is-referenced-by-count":1,"title":["Lattice-Based Paraconsistent Logic"],"prefix":"10.1007","author":[{"given":"Wendy","family":"MacCaull","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimiter","family":"Vakarelov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"514","DOI":"10.2307\/2275217","volume":"58","author":"G. Allwein","year":"1993","unstructured":"Allwein, G., Dunn, M.: Kripke models for linear logic. Journal of Symbolic Logic\u00a058, 514\u2013545 (1993)","journal-title":"Journal of Symbolic Logic"},{"key":"14_CR2","first-page":"1","volume":"61","author":"G. Allwein","year":"2001","unstructured":"Allwein, G., MacCaull, W.: A Kripke semantics for the logic of Gelfand quantales. Studia Logica\u00a061, 1\u201356 (2001)","journal-title":"Studia Logica"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1006020529663","volume":"22","author":"O. Arieli","year":"1999","unstructured":"Arieli, O., Avron, A.: A model-theoretic approach for recovering consistent data from inconsistent knowledge-bases. Journal of Automated Reasoning\u00a022, 263\u2013309 (1999)","journal-title":"Journal of Automated Reasoning"},{"key":"14_CR4","first-page":"7","volume-title":"Modern Uses of Multiple-Valued Logic","author":"N. Belnap","year":"1977","unstructured":"Belnap, N.: A useful four-valued logic. In: Epstein, G., Dunn, J.M. (eds.) Modern Uses of Multiple-Valued Logic, pp. 7\u201337. Reidel, Dordrecht (1977)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1305\/ndjfl\/1093891487","volume":"15","author":"N. Costa da","year":"1974","unstructured":"da Costa, N.: On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic\u00a015, 497\u2013510 (1974)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"14_CR6","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BFb0018431","volume-title":"Logics in AI","author":"M. Dunn","year":"1991","unstructured":"Dunn, M.: Gaggle Theory: An abstraction of Galois connections and residuation, with applications to negation, implication, and various logical operators. In: van Eijck, J. (ed.) JELIA 1990. LNCS (LNAI), vol.\u00a0478, pp. 31\u201351. Springer, Heidelberg (1991)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)90014-G","volume":"11","author":"M. Fitting","year":"1991","unstructured":"Fitting, M.: Bilattices and the semantics of logic programming. Journal of Logic Programming\u00a011, 91\u2013116 (1991)","journal-title":"Journal of Logic Programming"},{"key":"14_CR8","first-page":"256","volume":"4","author":"M. Ginsberg","year":"1988","unstructured":"Ginsberg, M.: Multivalued logics: A uniform approach to reasoning in AI. Computer Intelligence\u00a04, 256\u2013316 (1988)","journal-title":"Computer Intelligence"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1020572931854","volume":"71","author":"W. MacCaull","year":"2002","unstructured":"MacCaull, W., Or\u0142owska, E.: Correspondence results for relational proof systems with application to the Lambek Calculus. Studia Logica\u00a071, 389\u2013414 (2002)","journal-title":"Studia Logica"},{"key":"14_CR10","unstructured":"MacCaull, W., Vakarelov, D.: Lattice-based paraconsistent logic. In: D\u00fcntsch, I., Winter, M. (eds.) Proceedings of RelMiCS 8, the 8th International Seminar in Relational Methods in Computer Science, pp. 155\u2013162 (2005)"},{"key":"14_CR11","unstructured":"Or\u0142owska, E., Vakarelov, D.: Lattices with modal operators and lattice based modal logics (to appear)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.4064\/fm-83-3-219-249","volume":"83","author":"C. Rauszer","year":"1974","unstructured":"Rauszer, C.: Semi-Boolean algebras and their applications to intuitionistic logic with dual operations. Fundamenta Informaticae\u00a083, 219\u2013250 (1974)","journal-title":"Fundamenta Informaticae"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02485369","volume":"8","author":"A. Urquhart","year":"1978","unstructured":"Urquhart, A.: A topological representation for lattices. Algebra Universalis\u00a08, 45\u201358 (1978)","journal-title":"Algebra Universalis"},{"key":"14_CR14","first-page":"1087","volume":"22","author":"D. Vakarelov","year":"1974","unstructured":"Vakarelov, D.: Semi-Boolean algebras and semantics for HB-predicate logic. Bull. Acad. Polon. Sci. Ser. Math. Phys.\u00a022, 1087\u20131095 (1974)","journal-title":"Bull. Acad. Polon. Sci. Ser. Math. Phys."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Vakarelov, D.: Consistency, completeness and negation. In: Priest, G., Routley, R., Norman, J. (eds.) Paraconsistent Logic, Essays on the Inconsistent. Philosophia Verlag (1989)","DOI":"10.2307\/j.ctv2x8v8c7.15"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BF00370208","volume":"48","author":"D. Vakarelov","year":"1989","unstructured":"Vakarelov, D.: Intuitive semantics for some three-valued logics connected with information, contrariety and subcontrariety. Studia Logica\u00a048, 565\u2013575 (1989)","journal-title":"Studia Logica"}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734673_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T22:32:55Z","timestamp":1683498775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734673_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333395","9783540333401"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11734673_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}