{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:58Z","timestamp":1725455938102},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540536864"},{"type":"electronic","value":"9783540469827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0018445","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T00:30:30Z","timestamp":1132619430000},"page":"234-250","source":"Crossref","is-referenced-by-count":3,"title":["A constraint logic approach to modal deduction"],"prefix":"10.1007","author":[{"given":"Alan M.","family":"Frisch","sequence":"first","affiliation":[]},{"given":"Richard B.","family":"Scherl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"16_CR1","unstructured":"Yves Auffray and Patrice Enjalbert. Modal theorem proving: an equational viewpoint. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 441\u2013445, Detroit, August 1989."},{"issue":"2","key":"16_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0004-3702(88)90001-X","volume":"36","author":"W. Buntine","year":"1988","unstructured":"Wray Buntine. Generalized substumption and its applications to induction and redundancy. Artificial Intelligence, 36(2):149\u2013176, September 1988.","journal-title":"Artificial Intelligence"},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-2794-5","volume-title":"Proof Methods for Modal and Intuitionist Logics","author":"M. C. Fitting","year":"1983","unstructured":"Melvin C. Fitting. Proof Methods for Modal and Intuitionist Logics. D. Reidel Publishing Co., Dordrecht, 1983."},{"key":"16_CR4","unstructured":"Alan M. Frisch. A general framework for sorted deduction: Fundamental results on hybrid reasoning. In Ronald J. Brachman, Hector J. Levesque, and Raymond Reiter, editors, Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, Toronto, May 1989."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Alan M. Frisch. The substitutional framework for sorted deduction: fundamental results on hybrid reasoning. Artificial Intelligence, to appear, 1991.","DOI":"10.1016\/0004-3702(91)90009-9"},{"key":"16_CR6","volume-title":"Logical Foundations of Artificial Intelligence","author":"M. R. Genesereth","year":"1987","unstructured":"Michael R. Genesereth and Nils J. Nilsson. Logical Foundations of Artificial Intelligence. Morgan Kaufman, Los Altos, California, 1987."},{"key":"16_CR7","volume-title":"An Introduction to Modal Logic","author":"G.E. Hughes","year":"1968","unstructured":"G.E. Hughes and M.J. Cresswell. An Introduction to Modal Logic. Methuen and Co., London, 1968."},{"key":"16_CR8","first-page":"177","volume-title":"A General Proof Method for Modal Predicate Logic, chapter 8","author":"P. Jackson","year":"1989","unstructured":"Peter Jackson and Han Reichgelt. A General Proof Method for Modal Predicate Logic, chapter 8, pages 177\u2013228. MIT Press, Cambridge, Massachusetts, 1989."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings of the 14th ACM Principles of Programming Languages Conference, pages 111\u2013119, Munich, January 1987.","DOI":"10.1145\/41625.41635"},{"key":"16_CR10","first-page":"83","volume":"16","author":"S. Kripke","year":"1963","unstructured":"S. Kripke. Semantical consideration on modal logic. Acta Philosophica Fennica, 16:83\u201394, 1963.","journal-title":"Acta Philosophica Fennica"},{"key":"16_CR11","unstructured":"Robert Moore. Reasoning About Knowledge and Action. Technical Note 191, SRI International, October 1980."},{"key":"16_CR12","unstructured":"Hans Juergen Ohlbach. A Resolution Calculus for Modal Logics. SEKI Report SR-88-08, Universit\u00e4t Kaiserslautern, 1988."},{"key":"16_CR13","first-page":"500","volume-title":"Lecture Notes in Computer Science, Volume 310","author":"H. J. Ohlbach","year":"1988","unstructured":"Hans J\u00fcrgen Ohlbach. A resolution calculus for modal logic. In E. Lusk and R. Overbeek, editors, 9th International Conference on Automated Deduction, pages 500\u2013516, Lecture Notes in Computer Science, Volume 310, Springer-Verlag, Berlin, May 1988."},{"key":"16_CR14","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. Hentenryk Van","year":"1989","unstructured":"Pascal Van Hentenryk. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, 1989."},{"key":"16_CR15","volume-title":"Automated Proof Search in Non-Classical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics","author":"L. A. Wallen","year":"1990","unstructured":"Lincoln A. Wallen. Automated Proof Search in Non-Classical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics. The MIT Press, Cambridge, Massachusetts, 1990."}],"container-title":["Lecture Notes in Computer Science","Logics in AI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T11:00:29Z","timestamp":1548068429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540536864","9783540469827"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0018445","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}