A tableaux calculus for ambiguous quantification

DOI10.1007/3-540-69778-0_25MaRDI QIDQ3838816zbMATH OpenFDO

Authors Christof Monz, Maarten de Rijke

Publication date 13 August 1998

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

Full work available at URL https://doi.org/10.1007/3-540-69778-0_25

zbMATH Keywords

ambiguous quantificationautomated reasoninglogic of natural languagestableaux calculus

Mathematics Subject Classification ID

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

Review text

The paper presents some approach for representing and reasoning with a quantificational ambiguity. A sound and complete tableaux calculus for reasoning with statements involving ambiguous quantification is given. The calculus integrates two processes: disambiguation and deductive reasoning. It permits to minimize and postpone branching in the proof process and decreases the search space. For the entire collection see [Zbl 0888.00018].

Recommendations

• Reasoning with ambiguity
• The logic of ambiguity: the propositional case
• A tableau calculus for pronoun resolution
• A logic for reasoning about ambiguity
• A resolution calculus for dynamic semantics

Cited in

(4)

• The logic of ambiguity: the propositional case
• Reasoning with ambiguity
• A tableau calculus for pronoun resolution
• scientific article; zbMATH DE number 1950270 (Why is no real title available?)

This page was built for publication: A tableaux calculus for ambiguous quantification

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