{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T12:31:14Z","timestamp":1725971474739},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319763477"},{"type":"electronic","value":"9783319763484"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-76348-4_27","type":"book-chapter","created":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T11:10:42Z","timestamp":1521630642000},"page":"273-282","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Theory Prime Implicates in Modal Logic"],"prefix":"10.1007","author":[{"given":"Manoj K.","family":"Raut","sequence":"first","affiliation":[]},{"given":"Tushar V.","family":"Kokane","sequence":"additional","affiliation":[]},{"given":"Rishabh","family":"Agarwal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,22]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1613\/jair.2754","volume":"36","author":"M Bienvenu","year":"2009","unstructured":"Bienvenu, M.: Prime implicates and prime implicants: from propositional to modal logic. J. Artif. Intell. Res. (JAIR) 36, 71\u2013128 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"unstructured":"Bienvenu, M.: Consequence finding in modal logic. Ph.D. thesis, Universit\u00e9 Paul Sabatier, 7 May 2009","key":"27_CR2"},{"key":"27_CR3","volume-title":"Modal Logic","author":"P Blackburn","year":"2002","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)"},{"doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd ACM Symposium on the Theory of Computing, pp 151\u2013158. ACM Press (1971)","key":"27_CR4","DOI":"10.1145\/800157.805047"},{"key":"27_CR5","first-page":"137","volume":"10","author":"M Cadoli","year":"1998","unstructured":"Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Commun. Eur. J. AI 10, 137\u2013150 (1998)","journal-title":"AI Commun. Eur. J. AI"},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(87)90018-5","volume":"4","author":"LFD Cerro","year":"1987","unstructured":"Cerro, L.F.D., Penttonen, M.: A note on the complexity of the satisfiability of modal Horn clauses. J. Logic Program. 4, 1\u201310 (1987)","journal-title":"J. Logic Program."},{"issue":"2","key":"27_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0747-7171(08)80029-6","volume":"9","author":"A Kean","year":"1990","unstructured":"Kean, A., Tsiknis, G.: An incremental method for generating prime implicants\/implicates. J. Symb. Comput. 9(2), 185\u2013206 (1990)","journal-title":"J. Symb. Comput."},{"unstructured":"de Kleer, J.: An improved incremental algorithm for generating prime implicates. In: Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI 1992, pp. 780\u2013785. AAAI Press (1992)","key":"27_CR8"},{"unstructured":"Marquis, P.: Knowledge compilation using theory prime implicates. In: Proceedings of International Joint conference on Artificial Intelligence, IJCAI 1995, pp. 837\u2013843 (1995)","key":"27_CR9"},{"issue":"1","key":"27_CR10","first-page":"1","volume":"1","author":"MK Raut","year":"2004","unstructured":"Raut, M.K., Singh, A.: Prime implicates of first order formulas. IJCSA 1(1), 1\u201311 (2004)","journal-title":"IJCSA"},{"doi-asserted-by":"crossref","unstructured":"Raut, M.K.: An incremental algorithm for computing prime implicates in modal logic. In: Proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation (TAMC), LNCS 8402, pp. 188\u2013202 (2014)","key":"27_CR11","DOI":"10.1007\/978-3-319-06089-7_13"},{"unstructured":"Raut, M.K.: Computing Theory Prime Implicates in Modal logic. https:\/\/arxiv.org\/abs\/1512.08366","key":"27_CR12"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Systems Design and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-76348-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T02:47:01Z","timestamp":1570934821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-76348-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319763477","9783319763484"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-76348-4_27","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018]]}}}