{"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":1725456215560},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012830","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:12:39Z","timestamp":1132726359000},"page":"151-161","source":"Crossref","is-referenced-by-count":2,"title":["Consistency of rule-based expert systems"],"prefix":"10.1007","author":[{"given":"Marc","family":"Bezem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Rule-based expert systems: the Mycin experiments of the Stanford Heuristic Programming Project","author":"B.G. Buchanan","year":"1984","unstructured":"B.G. Buchanan, E.H. Shortliffe, Rule-based expert systems: the Mycin experiments of the Stanford Heuristic Programming Project. Addison-Wesley, Reading, Massachusetts (1984)."},{"key":"11_CR2","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey, D.S. Johnson, Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, California (1979)."},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T. Imielinski","year":"1984","unstructured":"T. Imielinski, W. Lipski jr., Incomplete information in relational databases. Journal of the ACM 31, 4, pp. 761\u2013791 (1984).","journal-title":"Journal of the ACM"},{"key":"11_CR4","volume-title":"Knowledge representation and inference in rule-based expert systems. Report CSR8613","author":"P.J.F. Lucas","year":"1986","unstructured":"P.J.F. Lucas, Knowledge representation and inference in rule-based expert systems. Report CSR8613, Centre for Mathematics and Computer Science, Amsterdam (1986)."},{"key":"11_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9452-5","volume-title":"Mathematical Logic","author":"J.D. Monk","year":"1976","unstructured":"J.D. Monk, Mathematical Logic, Springer-Verlag, Berlin (1976)."},{"key":"11_CR6","first-page":"227","volume":"1","author":"J.A. Robinson","year":"1965","unstructured":"J.A. Robinson, Automatic deduction with hyper-resolution. International Journal of Computer Mathematics 1, pp. 227\u2013234 (1965).","journal-title":"International Journal of Computer Mathematics"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/322186.322189","volume":"27","author":"R. Reiter","year":"1980","unstructured":"R. Reiter, Equality and domain closure in first order databases. Journal of the ACM 27, 2, pp. 235\u2013249 (1980).","journal-title":"Journal of the ACM"},{"key":"11_CR8","volume-title":"A many-sorted calculus based on resolution and paramodulation","author":"C. Walther","year":"1987","unstructured":"C. Walther, A many-sorted calculus based on resolution and paramodulation. Pitman, London (1987)."}],"container-title":["Lecture Notes in Computer Science","9th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012830.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:06:38Z","timestamp":1607353598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0012830","relation":{},"subject":[]}}