scientific article; zbMATH DE number 1301754

MaRDI QIDQ4246969zbMATH OpenFDO

Authors Christof Monz, Maarten de Rijke

Publication date 16 June 1999

zbMATH Keywords

computational complexitynatural language processingresolution theorem provingnatural language semanticspronoun binding

Mathematics Subject Classification ID

Logic of natural languages (03B65) Mechanization of proofs and logical operations (03B35) Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 1341480
• scientific article; zbMATH DE number 1689575
• scientific article; zbMATH DE number 2222011
• An approach to natural-language semantics in logic programming
• Computing meaning. Vol. 1

Cited in

(12)

• Pragmatics, and that's an order
• A neurocomputational approach to prepositional phrase attachment ambiguity resolution
• scientific article; zbMATH DE number 67830 (Why is no real title available?)
• Type reconstruction for \(\lambda\)-DRT applied to pronoun resolution
• scientific article; zbMATH DE number 1418380 (Why is no real title available?)
• scientific article; zbMATH DE number 1189107 (Why is no real title available?)
• scientific article; zbMATH DE number 1689575 (Why is no real title available?)
• Plausible reasoning and the resolution of quantifier scope ambiguities
• Logical Aspects of Computational Linguistics
• scientific article; zbMATH DE number 5173934 (Why is no real title available?)
• Reasoning without believing: on the mechanisation of presuppositions and partiality
• Towards the use of automated reasoning in discourse disambiguation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246969)