{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:10:02Z","timestamp":1749726602284,"version":"3.41.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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 Logic, Language and Information"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1022362118915","type":"journal-article","created":{"date-parts":[[2003,3,28]],"date-time":"2003-03-28T22:25:21Z","timestamp":1048890321000},"page":"153-182","source":"Crossref","is-referenced-by-count":6,"title":["Optimality Theory as a Family of Cumulative Logics"],"prefix":"10.1007","volume":"12","author":[{"given":"Ph.","family":"Besnard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Fanselow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5115976_CR1","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0304-3975(99)00319-9","volume":"238","author":"P. Besnard","year":"2000","unstructured":"Besnard, Ph. and Schaub, T., 2000, \u201cWhat is a (non-constructive) non-monotone logical system?,\u201d Theoretical Computer Science\n238, 489\u2013494.","journal-title":"Theoretical Computer Science"},{"key":"5115976_CR2","unstructured":"Besnard, Ph., Mercer, R.E., and Schaub T., 2000, Optimality Theory via Default Logic, unpublished."},{"key":"5115976_CR3","first-page":"307","volume":"24","author":"R. Frank","year":"1998","unstructured":"Frank, R. and Satta, G., 1998, \u201cOptimality theory and the generative complexity of constraint violability,\u201d Computational Linguistics\n24, 307\u2013315.","journal-title":"Computational Linguistics"},{"key":"5115976_CR4","first-page":"1","volume-title":"Handbook of Logic in Arti-ficial Intelligence and Logic Programming, Vol. 3: Nonmonotonic Reasoning and Uncertainty Reasoning","author":"M.L. Ginsberg","year":"1994","unstructured":"Ginsberg, M.L., 1994, \u201cAI and nonmonotonic reasoning,\u201d pp. 1\u201333 in Handbook of Logic in Arti-ficial Intelligence and Logic Programming, Vol. 3: Nonmonotonic Reasoning and Uncertainty Reasoning, D.M. Gabbay, C.J. Hogger, and J.A. Robinson, eds., Oxford: Oxford University Press."},{"key":"5115976_CR5","unstructured":"Hammond, M., 2000, The Logic of Optimality Theory, ROA (390), http:\/\/roa.rutgers.edu"},{"key":"5115976_CR6","series-title":"Cambridge Textbooks in Linguistics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511812408","volume-title":"Optimality Theory","author":"R. Kager","year":"1999","unstructured":"Kager, R., 1999, Optimality Theory, Cambridge Textbooks in Linguistics, Cambridge: Cambridge University Press."},{"key":"5115976_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1093\/oso\/9780198537472.003.0002","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3: Nonmonotonic Reasoning and Uncertainty Reasoning","author":"D. Makinson","year":"1994","unstructured":"Makinson, D., 1994, \u201cGeneral patterns in non-monotonic reasoning,\u201d pp. 35\u2013110 in Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3: Nonmonotonic Reasoning and Uncertainty Reasoning, D.M. Gabbay, C.J. Hogger, and J.A. Robinson, eds., Oxford: Oxford University Press."},{"key":"5115976_CR8","unstructured":"Prince, A., 2001, Entailed Ranking Arguments, ROA (500), http:\/\/roa.rutgers.edu"},{"key":"5115976_CR9","series-title":"Technical Report","volume-title":"Optimality theory: Constraint interaction in generative grammars","author":"A. Prince","year":"1993","unstructured":"Prince, A. and Smolensky, P., 1993, \u201cOptimality theory: Constraint interaction in generative grammars,\u201d Technical Report, Rutgers University, New Brunswick (NJ), and Computer Science Department, University of Colorado, Boulder."},{"key":"5115976_CR10","unstructured":"Samek-Lodovici, V. and Prince, A., 1999, Optima, ROA (363), http:\/\/roa.rutgers.edu"},{"key":"5115976_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1162\/002438998553734","volume":"29","author":"B. Tesar","year":"1998","unstructured":"Tesar, B. and Smolensky, P., 1998, \u201cLearnability in optimality theory,\u201d Linguistic Inquiry\n29, 229\u2013268.","journal-title":"Linguistic Inquiry"}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022362118915.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022362118915\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022362118915.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:28:54Z","timestamp":1749724134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022362118915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5115976"],"URL":"https:\/\/doi.org\/10.1023\/a:1022362118915","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"type":"print","value":"0925-8531"},{"type":"electronic","value":"1572-9583"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}