{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:19:54Z","timestamp":1725761994071},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452208"},{"type":"electronic","value":"9783642452215"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45221-5_1","type":"book-chapter","created":{"date-parts":[[2013,12,5]],"date-time":"2013-12-05T04:28:23Z","timestamp":1386217703000},"page":"1-17","source":"Crossref","is-referenced-by-count":2,"title":["An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Della Monica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sciavicco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem proving procedures. In: Proc. of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"1_CR2","unstructured":"Chang, C., Lee, R.C.: Symbolic Logic and Mechanical Theorem Proving, 1st edn. Academic Press, Inc. (1997)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer (1987)","DOI":"10.1007\/978-3-642-83189-8"},{"key":"1_CR4","unstructured":"Kautz, H., Mcallester, D., Selman, B.: Encoding plans in propositional logic. In: Proc. of the 5th KR, pp. 374\u2013384 (1996)"},{"key":"1_CR5","unstructured":"Riesbeck, C., Schank, R.: Inside Case-based Reasoning. Artificial intelligence series. Lawrence Erlbaum (1989)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Brachman, R., Levesque, H.: Knowledge Representation and Reasoning. Morgan Kaufmann Publishers Inc. (2004)","DOI":"10.1016\/B978-155860932-7\/50099-6"},{"key":"1_CR7","unstructured":"Brusoni, V., Console, L., Terenziani, P., Dupr\u00e9, D.T.: Characterizing temporal abductive diagnosis. In: Proc. of the 6th DX, pp. 34\u201340 (1995)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","volume":"44","author":"M. Cadoli","year":"1992","unstructured":"Cadoli, M.: The complexity of model checking for circumscriptive formulae. Information Processing Letters\u00a044, 113\u2013118 (1992)","journal-title":"Information Processing Letters"},{"issue":"3-4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0020-0190(00)00023-5","volume":"74","author":"D.J. Kavvadias","year":"2000","unstructured":"Kavvadias, D.J., Sideri, M., Stavropoulos, E.: Generating all maximal models of a Boolean expression. Inf. Process. Lett.\u00a074(3-4), 157\u2013162 (2000)","journal-title":"Inf. Process. Lett."},{"key":"1_CR10","unstructured":"Knuth, D.: The Art of Computer Programming: Combinatorial Algorithms, Part 1, 1st edn., vol.\u00a04A. Addison-Wesley Professional (2011)"},{"key":"1_CR11","unstructured":"Schmidt, J.: Enumeration: Algorithms and complexity. Unpublished (2009)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press (2002)","DOI":"10.1017\/CBO9781107050884"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Aceto, L., Della Monica, D., Ing\u00f3lfsd\u00f3ttir, A., Montanari, A., Sciavicco, G.: A complete classification of the expressiveness of interval logics of Allen\u2019s relations over dense linear orders. In: Proc. of the 20th TIME (2013)","DOI":"10.1109\/TIME.2013.16"},{"key":"1_CR14","unstructured":"Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Expressiveness of the interval logics of Allen\u2019s relations on the class of all linear orders: Complete classification. In: Proc. of the 22nd IJCAI, pp. 845\u2013850 (2011)"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.entcs.2011.10.004","volume":"278","author":"P. Balbiani","year":"2011","unstructured":"Balbiani, P., Goranko, V., Sciavicco, G.: Two-sorted point-interval temporal logics. Electr. Notes Theor. Comput. Sci.\u00a0278, 31\u201345 (2011)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1145\/115234.115351","volume":"38","author":"J. Halpern","year":"1991","unstructured":"Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM\u00a038(4), 935\u2013962 (1991)","journal-title":"Journal of the ACM"}],"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-45221-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T00:36:35Z","timestamp":1558744595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45221-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452208","9783642452215"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45221-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}