{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:59Z","timestamp":1725565439470},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156748"},{"type":"electronic","value":"9783642156755"}],"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-15675-5_28","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T04:07:17Z","timestamp":1284350837000},"page":"326-338","source":"Crossref","is-referenced-by-count":0,"title":["An Approximative Inference Method for Solving \u2203\u2009\u2200SO Satisfiability Problems"],"prefix":"10.1007","author":[{"given":"Hanne","family":"Vlaeminck","sequence":"first","affiliation":[]},{"given":"Johan","family":"Wittocx","sequence":"additional","affiliation":[]},{"given":"Joost","family":"Vennekens","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge representation, reasoning and declarative problem solving","author":"C. Baral","year":"2003","unstructured":"Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge university press, Cambridge (2003)"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0743-1066(97)10011-5","volume":"35","author":"C. Baral","year":"1998","unstructured":"Baral, C., Gelfond, M., Kosheleva, O.: Expanding queries to incomplete databases by interpolating general logic programs. J. Log. Program.\u00a035(3), 195\u2013230 (1998)","journal-title":"J. Log. Program."},{"key":"28_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49545-2_1","volume-title":"Logics in Artificial Intelligence","author":"M. Denecker","year":"1998","unstructured":"Denecker, M.: The well-founded semantics is the principle of inductive definition. In: Dix, J., Fari\u00f1as del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol.\u00a01489, pp. 1\u201316. Springer, Heidelberg (1998)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Denecker, M., Cort\u00e9s-Calabuig, A., Bruynooghe, M., Arieli, O.: Towards a logical reconstruction of a theory for locally closed databases. ACM Transactions on Database Systems (2010) (accepted)","DOI":"10.1145\/1806907.1806914"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Denecker, M., Ternovska, E.: A logic of nonmonotone inductive definitions. ACM Trans. Comput. Log.\u00a09(2) (2008)","DOI":"10.1145\/1342991.1342998"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-04238-6_75","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Denecker","year":"2009","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczynski, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 637\u2013654. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.3166\/jancl.16.87-117","volume":"16","author":"P. Doherty","year":"2006","unstructured":"Doherty, P., Magnusson, M., Szalas, A.: Approximate databases: a support tool for approximate reasoning. Journal of Applied Non-Classical Logics\u00a016(1-2), 87\u2013118 (2006)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"28_CR8","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1998","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1998)"},{"key":"28_CR9","unstructured":"Mari\u00ebn, M., Wittocx, J., Denecker, M.: The IDP framework for declarative problem solving. In: Search and Logic: Answer Set Programming and SAT, pp. 19\u201334 (2006)"},{"key":"28_CR10","unstructured":"Mitchell, D.G., Ternovska, E.: A framework for representing and solving np search problems. In: AAAI, pp. 430\u2013435 (2005)"},{"key":"28_CR11","unstructured":"Ping, H., De Cat, B., Denecker, M.: Fo(fd): Extending classical logic with rule-based fixpoint definitions. In: International Conference on Logic Programming, ICLP 2010 (2010)"},{"key":"28_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/11546207_14","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T.C. Son","year":"2005","unstructured":"Son, T.C., Tu, P.H., Gelfond, M., Ricardo Morales, A.: An approximation of action theories of and its application to conformant planning. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 172\u2013184. Springer, Heidelberg (2005)"},{"issue":"4","key":"28_CR13","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF00297245","volume":"4","author":"M.E. Stickel","year":"1988","unstructured":"Stickel, M.E.: A prolog technology theorem prover: Implementation by an extended prolog compiler. J. Autom. Reasoning\u00a04(4), 353\u2013380 (1988)","journal-title":"J. Autom. Reasoning"},{"key":"28_CR14","series-title":"Seminars in Mathematics: Steklov Mathematical Institute","first-page":"115","volume-title":"Studies in Constructive Mathematics and Mathematical Logic II","author":"G.S. Tseitin","year":"1968","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Slisenko, A.O. (ed.) Studies in Constructive Mathematics and Mathematical Logic II. Seminars in Mathematics: Steklov Mathematical Institute, vol.\u00a08, pp. 115\u2013125. Consultants Bureau, New York (1968)"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(93)90024-Q","volume":"47","author":"A. Gelder Van","year":"1993","unstructured":"Van Gelder, A.: The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences\u00a047(1), 185\u2013221 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Wittocx, J.: Finite Domain and Symbolic Inference Methods for Extensions of First-Order Logic. PhD thesis, K.U.Leuven (May 2010)","DOI":"10.3233\/AIC-2010-0474"},{"key":"28_CR17","unstructured":"Wittocx, J., Mari\u00ebn, M., Denecker, M.: Approximate reasoning in first-order logic theories. In: KR, pp. 103\u2013112 (2008)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15675-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T14:10:29Z","timestamp":1591884629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15675-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156748","9783642156755"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15675-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}