{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:35Z","timestamp":1725456215743},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012866","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T01:12:39Z","timestamp":1132708359000},"page":"685-693","source":"Crossref","is-referenced-by-count":1,"title":["Logical matrix generation and testing"],"prefix":"10.1007","author":[{"given":"Peter K.","family":"Malkin","sequence":"first","affiliation":[]},{"given":"Errol P.","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","volume-title":"Entailment: The Logic of Relevance and Necessity","author":"A.R. Anderson","year":"1975","unstructured":"Anderson A.R. and Belnap N.D. Jr. (1975), Entailment: The Logic of Relevance and Necessity, Princeton, Princeton University Press."},{"key":"47_CR2","unstructured":"Gelernter, H. (1959), Realization of a geometry-theorem proving machine, Proceedings of the International Conference on Information Processing, UNESCO House, pp. 273\u2013282. Reprinted in Siekmann and Wrightson (1983), pp. 99\u2013117."},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Jaffar, J. and Lassez, J-L. (1987), Constraint Logic Programming, Proceedings of the Fourteenth ACM Symposium on Principles of Programming Languages, pp.111\u2013119.","DOI":"10.1145\/41625.41635"},{"key":"47_CR4","volume-title":"Symbolical construction of truth value domain for logic program, Proceedings of the 4th International Conference on Logic Programming","author":"S. Morishita","year":"1987","unstructured":"Morishita, S., Numao, M. and Hirose, S. (1987), Symbolical construction of truth value domain for logic program, Proceedings of the 4th International Conference on Logic Programming (ed. J-L. Lassez), Cambridge, Mass., MIT Press."},{"key":"47_CR5","unstructured":"Pritchard, P.A. (1978), And now for Something Completely Different, ms., Australian National University."},{"key":"47_CR6","unstructured":"Pritchard, P.A. (1979), Son of Something Completely Different, ms., University of Queensland."},{"key":"47_CR7","unstructured":"Pritchard, P.A. and Meyer, R.K., (1977), On computing matrix models of propositional calculi, ms. ANU."},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Siekmann, J. and Wrightson, G. (1983), Automation of Reasoning: Classical Papers on Computational Logic, 2 vols. Springer-Verlag.","DOI":"10.1007\/978-3-642-81955-1"},{"key":"47_CR9","unstructured":"Slaney, J.K. (1980), Computers and Relevant Logic: A project in computing matrix model structures for propositional logics, Ph.D. thesis, Australian National University."},{"key":"47_CR10","volume-title":"Automated Theorem-Proving in Non-Classical Logics","author":"P.B. Thistlewaite","year":"1988","unstructured":"Thistlewaite, P.B., McRobbie, M.A., and Meyer, R.K. (1988). Automated Theorem-Proving in Non-Classical Logics, London, Pitman."}],"container-title":["Lecture Notes in Computer Science","9th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0012866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:24:08Z","timestamp":1586564648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0012866","relation":{},"subject":[]}}