{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:57Z","timestamp":1725567597194},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162411"},{"type":"electronic","value":"9783642162428"}],"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-16242-8_15","type":"book-chapter","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T12:51:59Z","timestamp":1286196719000},"page":"202-216","source":"Crossref","is-referenced-by-count":2,"title":["Magically Constraining the Inverse Method Using Dynamic Polarity Assignment"],"prefix":"10.1007","author":[{"given":"Kaustuv","family":"Chaudhuri","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"J. of Logic and Computation"},{"issue":"A","key":"15_CR2","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/BF01213601","volume":"6","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Marchiori, E.: Reasoning about prolog programs from modes through types to assertions. Formal Aspects of Computing\u00a06(A), 743\u2013764 (1994)","journal-title":"Formal Aspects of Computing"},{"issue":"1\/2\/3&4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"Beeri, C., Ramakrishnan, R.: On the power of magic. J. of Logic Programming\u00a010(1\/2\/3&4), 255\u2013299 (1991)","journal-title":"J. of Logic Programming"},{"key":"15_CR4","unstructured":"Chaudhuri, K.: The Focused Inverse Method for Linear Logic. PhD thesis, Carnegie Mellon University, Technical report CMU-CS-06-162 (2006)"},{"key":"15_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-89439-1_33","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K. Chaudhuri","year":"2008","unstructured":"Chaudhuri, K.: Focusing strategies in the sequent calculus of synthetic connectives. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 467\u2013481. Springer, Heidelberg (2008)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K.: Classical and intuitionistic subexponential logics are equally expressive. In: Veith, H. (ed.) CSL 2010. LNCS, vol.\u00a06247, pp. 185\u2013199. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-15205-4_17"},{"key":"15_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/11532231_6","volume-title":"Automated Deduction \u2013 CADE-20","author":"K. Chaudhuri","year":"2005","unstructured":"Chaudhuri, K., Pfenning, F.: A focusing inverse method theorem prover for first-order linear logic. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 69\u201383. Springer, Heidelberg (2005)"},{"issue":"2-3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10817-007-9091-0","volume":"40","author":"K. Chaudhuri","year":"2008","unstructured":"Chaudhuri, K., Pfenning, F., Price, G.: A logical characterization of forward and backward chaining in the inverse method. J. of Automated Reasoning\u00a040(2-3), 133\u2013177 (2008)","journal-title":"J. of Automated Reasoning"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Degtyarev, A., Voronkov, A.: The inverse method. In: Handbook of Automated Reasoning, pp. 179\u2013272. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50006-0"},{"key":"15_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-540-32275-7_31","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K. Donnelly","year":"2005","unstructured":"Donnelly, K., Gibson, T., Krishnaswami, N., Magill, S., Park, S.: The inverse method for the logic of bunched implications. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 466\u2013480. Springer, Heidelberg (2005)"},{"key":"15_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-73595-3_9","volume-title":"Automated Deduction \u2013 CADE-21","author":"S. Heilala","year":"2007","unstructured":"Heilala, S., Pientka, B.: Bidirectional decision procedures for the intuitionistic propositional modal logic IS4. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 116\u2013131. Springer, Heidelberg (2007)"},{"key":"15_CR12","unstructured":"Howe, J.M.: Proof Search Issues in Some Non-Classical Logics. PhD thesis, U. of St Andrews, Research Report CS\/99\/1 (1998)"},{"issue":"46","key":"15_CR13","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1016\/j.tcs.2009.07.041","volume":"410","author":"C. Liang","year":"2009","unstructured":"Liang, C., Miller, D.: Focusing and polarization in linear, intuitionistic, and classical logics. Theoretical Computer Science\u00a0410(46), 4747\u20134768 (2009)","journal-title":"Theoretical Computer Science"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Liang, C., Miller, D.: A unified sequent calculus for focused proofs. In: LICS 24, pp. 355\u2013364 (2009)","DOI":"10.1109\/LICS.2009.47"},{"key":"15_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-45632-5_4","volume-title":"Computational Logic: Logic Programming and Beyond","author":"P. Mascellani","year":"2002","unstructured":"Mascellani, P., Pedreschi, D.: The declarative side of magic. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02408, pp. 83\u2013108. Springer, Heidelberg (2002)"},{"key":"15_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-89439-1_12","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. McLaughlin","year":"2008","unstructured":"McLaughlin, S., Pfenning, F.: Imogen: Focusing the polarized focused inverse method for intuitionistic propositional logic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 174\u2013181. Springer, Heidelberg (2008)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-540-74915-8_35","volume-title":"Computer Science Logic","author":"D. Miller","year":"2007","unstructured":"Miller, D., Nigam, V.: Incorporating tables into proofs. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 466\u2013480. Springer, Heidelberg (2007)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-74915-8_31","volume-title":"Computer Science Logic","author":"D. Miller","year":"2007","unstructured":"Miller, D., Saurin, A.: From proofs to focused proofs: a modular proof of focalization in linear logic. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 405\u2013419. Springer, Heidelberg (2007)"},{"key":"15_CR19","unstructured":"Ullman, J.D.: Principles of Database and Knowledge-base Systems, Volume II: The New Techniques. In: Principles of Computer Science. Computer Science Press, Rockville (1989)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16242-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T14:05:54Z","timestamp":1553177154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16242-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162411","9783642162428"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16242-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}