{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:48Z","timestamp":1725663168328},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540502418"},{"type":"electronic","value":"9783540459606"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50241-6_28","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:19:02Z","timestamp":1330183142000},"page":"44-55","source":"Crossref","is-referenced-by-count":3,"title":["Proving finite satisfiability of deductive databases"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Manthey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","unstructured":"Bayer, R. Query Evaluation and Recursion in Deductive Database Systems. Technical Report TUM-18503, Technical University of Munich, 1985."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bry, F., Decker, H. and Manthey, R. A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases. In Advanced in Database Technology \u2014 Proc. EDBT '88. Mar., 1988. Springer-Verlag, LNCS 303.","DOI":"10.1007\/3-540-19074-0_69"},{"key":"4_CR3","unstructured":"Beth, E.W. The Foundation of Mathematics. North Holland, Amsterdam, 1959. cited in [SMUL 68]."},{"key":"4_CR4","unstructured":"Bry, F. and Manthey, R. Checking Consistency of Database Constraints: A Logical Basis. In Proc. 12th Int. Conf. on Very Large Data Bases (VLDB '86). Aug. 25\u201328, 1986."},{"key":"4_CR5","unstructured":"Dreben, B. and Goldfarb, W. The Decision Problem \u2014 Solvable Classes of Quantified Formulas. Addison-Wesley, Reading, Massachussetts, 1979."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Davis, M. and Putnam, H. A Computing Procedure for Quantification Theory. J. of the ACM 7(3), Jul., 1960.","DOI":"10.1145\/321033.321034"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Fagin, R. and Vardi M.Y. The Theory of Data Dependencies \u2014 An Overview. In Proc. of ICALP. 1984.","DOI":"10.1007\/3-540-13345-3_1"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Gallaire, H., Minker, J. and Nicolas, J.-M. Logic and Databases: A Deductive Approach. ACM Computing Surveys 16(2), Jun., 1984.","DOI":"10.1145\/356924.356929"},{"key":"4_CR9","unstructured":"Kuhns, J.L. Answering Questions by Computer \u2014 A Logical Study. Rand Memo RM 5428 PR, Rand Corp., Santa Monica, Calif., 1967."},{"key":"4_CR10","unstructured":"Loveland, D. Automated Theorem Proving: A Logical Basis. North-Holland, Amsterdam, 1978."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Manthey, R. and Bry, F. A Hyperresolution Proof Procedure and its Implementation in Prolog. In Proc. 11th German Workshop on Artificial Intelligence (GWAI '87). Sep. 28\u2013Oct. 2, 1987. Springer-Verlag, IF 152.","DOI":"10.1007\/978-3-642-73005-4_24"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Manthey, R. and Bry, F. SATCHMO: A Theorem Prover Implemented in Prolog. In Proc. 9th Conf. on Automated Deduction (CADE '88). May 23\u201326, 1988. Springer-Verlag, LNCS.","DOI":"10.1007\/BFb0012847"},{"key":"4_CR13","volume-title":"Introduction to Mathematical Logic","author":"E. Mendelson","year":"1969","unstructured":"Mendelson, E. Introduction to Mathematical Logic. Van Nostrand Reinhold, New York, 1969."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Nicolas, J.-M. and Gallaire, H. Database: Theory vs. Interpretation. In Logic and Databases. Plenum, New York, 1978.","DOI":"10.1007\/978-1-4684-3384-5_2"},{"key":"4_CR15","volume-title":"On Conceptual Modelling","author":"R. Reiter","year":"1984","unstructured":"Reiter, R. Towards a Logical Reconstruction of Relational Database Theory. In On Conceptual Modelling. Springer-Verlag, Berlin and New York, 1984."},{"key":"4_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86718-7","volume-title":"First-Order Logic","author":"R. Smullyan","year":"1968","unstructured":"Smullyan, R. First-Order Logic. Springer-Verlag, New York, 1968."},{"key":"4_CR17","unstructured":"Trachtenbrot, B.A. Impossibility of an Algorithm for the Decision Problem in Finite Classes. Dokl. Acad. Nauk. SSSR 70, 1950. in Russian, translated into English in Amer. Soc. Trans., Series 2, 23, 1963."}],"container-title":["Lecture Notes in Computer Science","CSL '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50241-6_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:17:40Z","timestamp":1605629860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50241-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540502418","9783540459606"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-50241-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}