{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:59:42Z","timestamp":1743011982520,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637004"},{"type":"electronic","value":"9783540696315"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052166","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T04:43:12Z","timestamp":1149655392000},"page":"346-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantitative constraint logic programming for weighted grammar applications"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Riezler","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,16]]},"reference":[{"key":"19_CR1","volume-title":"The Balancing Act","author":"S. Abney","year":"1996","unstructured":"Steven Abney. Statistical methods and linguistics. In Judith Klavans and Philip Resnik, editors, The Balancing Act. The MIT Press, Cambridge, Massachusetts, 1996."},{"key":"19_CR2","unstructured":"Steven Abney. Stochastic attribute-value grammars. Unpublished manuscript, University of T\u00fcbingen, September 1996."},{"issue":"5","key":"19_CR3","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/T-C.1973.223746","volume":"C-22","author":"T. L. Booth","year":"1973","unstructured":"Taylor L. Booth and Richard A. Thompson. Applying probability measures to abstract languages. IEEE Transactions on Computers, C-22(5):442\u2013450, 1973.","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR4","unstructured":"Jochen D\u00f6rre and Michael Dorna. CUF \u2014 a formalism for linguistic knowledge representation. In Jochen D\u00f6rre, editor, Computational Aspects of Constraint-Based Linguistic Description I, pages 3\u201322. DYANA-2 Deliverable R1.2.A, 1993."},{"key":"19_CR5","unstructured":"Jochen D\u00f6rre and Andreas Eisele. A comprehensive unification-based grammar formalism. Technical report, DYANA Deliverable R3.1.B, 1991."},{"key":"19_CR6","unstructured":"Didier Dubois, J\u00e9r\u00d4me Lang, and Henri Prade. Towards possibilistic logic programming. In Proceedings of the 8th International Conference on Logic Programming (ICLP '91), pages 581\u2013595, Paris, 1991."},{"key":"19_CR7","unstructured":"Andreas Eisele. Towards probabilistic extensions of constraint-based grammars. In Jochen D\u00f6rre, editor, Computational Aspects of Constraint-Based Linguistic Description II, pages 3\u201321. DYANA-2 Deliverable R1.2.B, 1994."},{"key":"19_CR8","unstructured":"Gregor Erbach. Towards a theory of degrees of grammaticality. CLAUS Report 34, Computational Linguistics at the Univerity of the Saarland, 1993."},{"key":"19_CR9","volume-title":"PhD thesis","author":"G. Erbach","year":"1995","unstructured":"Gregor Erbach. Bottom-Up Earley Deduction for Preference-Driven Natural Language Processing. PhD thesis, Computational Linguistics, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, August 1995."},{"key":"19_CR10","unstructured":"Thilo G\u00f6tz. Compiling HPSG constraint grammars into logic programs. In Workshop on Computational Logic and Natural Language Processing, Edinburgh, 1995."},{"key":"19_CR11","volume-title":"LILOG Report 53","author":"M. H\u00f6hfeld","year":"1988","unstructured":"Markus H\u00f6hfeld and Gert Smolka. Definite relations over constraint languages. LILOG Report 53, IBM Deutschland, Stuttgart, 1988."},{"key":"19_CR12","unstructured":"Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. Technical report 74, Department of Computer Science, Monash University, 1986."},{"key":"19_CR13","unstructured":"Frank Keller. Extraction from complex noun phrases. A case study in graded grammaticality. Master's thesis, Institut f\u00fcr maschinelle Sprachverarbeitung, Universit\u00e4t Stuttgart, August 1996."},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1515\/9783110821895-004","volume-title":"Natural Language Processing and Speech Technology. Results of the 3rd KONVENS Conference","author":"F. Keller","year":"1996","unstructured":"Frank Keller. How do humans deal with ungrammatical input? Experimental evidence and computational modelling. In Dafydd Gibbon, editor, Natural Language Processing and Speech Technology. Results of the 3rd KONVENS Conference, pages 27\u201334, Berlin, 1996. Mouton de Gruyter."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0743-1066(92)90007-P","volume":"12","author":"M. Kifer","year":"1992","unstructured":"Michael Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. Journal of Logic Programming, 12:335\u2013367, 1992.","journal-title":"Journal of Logic Programming"},{"key":"19_CR16","unstructured":"Paul J. King. An expanded logical formalism for head-driven phrase structure grammar. Arbeitspapiere des Sonderforschungsbereichs 340 59, University of T\u00fcbingen, 1994."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Laks V. S. Lakshmanan. An epistemic foundation for logic programming with uncertainty. In Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 1994.","DOI":"10.1007\/3-540-58715-2_116"},{"key":"19_CR18","unstructured":"Laks V. S. Lakshmanan and Fereidoon Sadri. Probabilistic deductive databases. In Proceedings of the International Logic Programming Symposium (ILPS '94), Ithaca, NY, 1994."},{"key":"19_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0890-5401(92)90061-J","volume":"101","author":"R. Ng","year":"1992","unstructured":"Raymond Ng and V. S. Subrahmanian. Probabilistic logic programming. Information and Computation, 101:150\u2013201, 1992.","journal-title":"Information and Computation"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00881836","volume":"10","author":"R. Ng","year":"1993","unstructured":"Raymond Ng and V. S. Subrahmanian. A semantical framework for supporting subjective and conditional probabilities in deductive databases. Journal of Automated Reasoning, 10:191\u2013235, 1993.","journal-title":"Journal of Automated Reasoning"},{"key":"19_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09438-9","volume-title":"Principles of Artificial Intelligence","author":"N. J. Nilsson","year":"1982","unstructured":"Nils J. Nilsson. Principles of Artificial Intelligence. Springer, Berlin, Heidelberg, New York, 1982."},{"key":"19_CR23","volume-title":"Head-Driven Phrase Structure Grammar","author":"C. Pollard","year":"1994","unstructured":"Carl Pollard and Ivan A. Sag. Head-Driven Phrase Structure Grammar. University of Chicago Press, Chicago, 1994."},{"key":"19_CR24","volume-title":"LILOG Report 33","author":"G. Smolka","year":"1988","unstructured":"Gert Smolka. A feature logic with subsorts. LILOG Report 33, IBM Deutschland, Stuttgart, 1988."},{"key":"19_CR25","first-page":"173","volume-title":"On the semantics of quantitative logic programs","author":"V. S. Subrahmanian","year":"1987","unstructured":"V. S. Subrahmanian. On the semantics of quantitative logic programs. In Proceedings of the 4th IEEE Symposium on Logic Programming, pages 173\u2013182, Washington D.C., 1987. Computer Society Press."},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0743-1066(86)90003-8","volume":"1","author":"M. H. van Emden","year":"1986","unstructured":"M. H. van Emden. Quantitative deduction and its fixpoint theory. The Journal of Logic Programming, 1:37\u201353, 1986.","journal-title":"The Journal of Logic Programming"},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L. A. Zadeh","year":"1965","unstructured":"L. A. Zadeh. Fuzzy sets. Information and Control, 8:338\u2013353, 1965.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:16:55Z","timestamp":1676675815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0052166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637004","9783540696315"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0052166","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"16 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}