A resolution calculus for dynamic semantics

DOI10.1007/3-540-49545-2_13MaRDI QIDQ4246969zbMATH OpenFDO

Authors Christof Monz, Maarten de Rijke

Publication date 16 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49545-2_13

zbMATH Keywords

computational complexitynatural language processingnatural language semanticspronoun bindingresolution theorem proving

Mathematics Subject Classification ID

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

Recommendations

• A tableau calculus for pronoun resolution
• 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

(13)

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

This page was built for publication: A resolution calculus for dynamic semantics

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