{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:28Z","timestamp":1725663328062},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540506676"},{"type":"electronic","value":"9783540460633"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[[1988]]},"DOI":"10.1007\/3-540-50667-5_63","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:29:59Z","timestamp":1330183799000},"page":"119-126","source":"Crossref","is-referenced-by-count":1,"title":["Boolean valued models and incomplete specifications"],"prefix":"10.1007","author":[{"given":"Bernd I.","family":"Dahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"11_CR1","unstructured":"Chang, Ch.-L., Lee, R. Ch.-T.: Symbolic Logic and Mechanical Theorem Proving. New York 1973."},{"key":"11_CR2","unstructured":"Dahn, B. I.: An analog of the least Herbrand model for non-Horn Theories, in: B. Dahn, H. Wolter (eds.), Proc. 6th Easter Conference on Model Theory, Berlin 1988, 33\u201352."},{"key":"11_CR3","unstructured":"Green, C.: Theorem proving by resolution as a basis for question-answering systems, in: Meltzer, B., Michie, D. (eds.), Machine Intelligence, Edinburgh 1969, 183\u2013205"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Jech, T. J.: Lectures in Set Theory with Particular Emphasis on the Method of Forcing, Springer Lecture Notes in Mathematics, vol. 217, 1971","DOI":"10.1007\/BFb0061131"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/0022-0000(87)90027-4","volume":"34","author":"J. A. Makowsky","year":"1987","unstructured":"Makowsky, J. A.: Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples. J. Comp. and System Science, vol. 34 (1987), 266\u2013292","journal-title":"J. Comp. and System Science"},{"key":"11_CR6","unstructured":"Rosser, J. B.: Simplified Independence Proofs, Boolean Valued Models of Set Theory, New York 1969"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50667-5_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T07:50:00Z","timestamp":1549093800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50667-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540506676","9783540460633"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-50667-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}