{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T10:37:06Z","timestamp":1771670226752,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Philosophical Logic"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1023\/a:1017599526096","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T17:59:26Z","timestamp":1041184766000},"page":"155-185","source":"Crossref","is-referenced-by-count":106,"title":["Constraints for Input\/Output Logics"],"prefix":"10.1007","volume":"30","author":[{"given":"David","family":"Makinson","sequence":"first","affiliation":[]},{"given":"Leendert","family":"van der Torre","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"333467_CR1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"C. Alchourr\u00f3n","year":"1985","unstructured":"Alchourr\u00f3n, C., G\u00e4rdenfors, P. and Makinson, D., 1985: On the logic of theory change: partial meet contraction and revision functions, J. Symbolic Logic\n50, 510\u2013530.","journal-title":"J. Symbolic Logic"},{"key":"333467_CR2","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1111\/j.1755-2567.1982.tb00480.x","volume":"48","author":"C. Alchourr\u00f3n","year":"1982","unstructured":"Alchourr\u00f3n, C. and Makinson, D., 1982: On the logic of theory change: contraction functions and their associated revision functions, Theoria\n48, 14\u201337.","journal-title":"Theoria"},{"key":"333467_CR3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.2307\/2214372","volume":"3","author":"B. Hansson","year":"1969","unstructured":"Hansson, B., 1969: An analysis of some deontic logics, Nous\n3, 373\u2013398. Reprinted in R. Hilpinen (ed.), Deontic Logic: Introductory and Systematic Readings, Reidel, Dordrecht, 1971 and 1981, pp. 121\u2013147.","journal-title":"Nous"},{"key":"333467_CR4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-94-017-0487-8_16","volume-title":"Logic and Scientific Methods","author":"S. O. Hansson","year":"1997","unstructured":"Hansson, S. O. and Makinson, D., 1997: Applying normative rules with restraint, in M. L. Dalla Chiara et al. (eds), Logic and Scientific Methods, Kluwer Acad. Publ., Dordrecht, pp. 313\u2013332."},{"key":"333467_CR5","doi-asserted-by":"crossref","unstructured":"Makinson, D., 1994: General patterns in nonmonotonic reasoning, in D. Gabbay et al. (eds), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Oxford University Press, pp. 35\u2013110.","DOI":"10.1093\/oso\/9780198537472.003.0002"},{"key":"333467_CR6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1111\/j.1755-2567.1997.tb00737.x","volume":"63","author":"D. Makinson","year":"1997","unstructured":"Makinson, D., 1997: Screened revision, Theoria\n63, 14\u201323.","journal-title":"Theoria"},{"key":"333467_CR7","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"29","volume-title":"Norms, Logics and Information Systems. New Studies in Deontic Logic and Computer Science","author":"D. Makinson","year":"1999","unstructured":"Makinson, D., 1999: On a fundamental problem of deontic logic, in P. McNamara and H. Prakken (eds), Norms, Logics and Information Systems. New Studies in Deontic Logic and Computer Science, Frontiers in Artificial Intelligence and Applications 49, IOS Press, Amsterdam, pp. 29\u201353."},{"key":"333467_CR8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1023\/A:1004748624537","volume":"29","author":"D. Makinson","year":"2000","unstructured":"Makinson, D. and van der Torre, L., 2000: Input\/output logics, J. Philos. Logic\n29, 383\u2013408.","journal-title":"J. Philos. Logic"},{"key":"333467_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","volume":"36","author":"D. Poole","year":"1988","unstructured":"Poole, D., 1988: A logical framework for default reasoning, Artificial Intelligence\n36, 27\u201347.","journal-title":"Artificial Intelligence"},{"key":"333467_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R., 1980: A logic for default reasoning, Artificial Intelligence\n13, 81\u2013132.","journal-title":"Artificial Intelligence"},{"key":"333467_CR11","series-title":"Tinbergen Institute Research Series","volume-title":"Reasoning about Obligations: Defeasibility in Preference-Based Deontic Logic","author":"L. W. N. van der Torre","year":"1997","unstructured":"van der Torre, L. W. N., 1997: Reasoning about Obligations: Defeasibility in Preference-Based Deontic Logic, Ph.D. Thesis, Erasmus University of Rotterdam, Tinbergen Institute Research Series 140, Amsterdam."},{"key":"333467_CR12","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-49545-2_7","volume-title":"Logics in Artificial Intelligence, Proceedings of the Sixth European Workshop on Logics in AI (JELIA'98)","author":"L. W. N. van der Torre","year":"1998","unstructured":"van der Torre, L. W. N., 1998: Phased labeled logics of conditional goals, in Logics in Artificial Intelligence, Proceedings of the Sixth European Workshop on Logics in AI (JELIA'98), Lecture Notes in Comput. Sci. 1489, Springer, Berlin, pp. 92\u2013106."},{"key":"333467_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1018975332469","volume":"27","author":"L. W. N. van der Torre","year":"1999","unstructured":"van der Torre, L.W. N. and Tan, Y.-H., 1999: Contrary-to-duty reasoning with preferencebased dyadic obligations, Ann. Math. Artificial Intelligence\n27, 49\u201378.","journal-title":"Ann. Math. Artificial Intelligence"}],"container-title":["Journal of Philosophical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017599526096.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1017599526096\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1023\/A:1017599526096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017599526096.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:44:31Z","timestamp":1752147871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1017599526096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["333467"],"URL":"https:\/\/doi.org\/10.1023\/a:1017599526096","relation":{},"ISSN":["0022-3611","1573-0433"],"issn-type":[{"value":"0022-3611","type":"print"},{"value":"1573-0433","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}