C. Monz and M. de Rijke. A tableau calculus for pronoun resolution. In N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'99, LNAI. Springer, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Abductive Coreference by Model Construction - Baumgartner, Kühn (1999) (1 citation) (Correct)
.... to the question which expres1 sions cannot serve as antecedent referent due to structural constrains e.g. in conditional or negated clauses [GS91, KR93] The challenging question how to establish the coreference between anaphora and possible antecedents in a logical framework is attacked e.g. in [MdR98, MdR99]. We follow the line of Hobbs et al. who use a weighted abduction scheme on horn clauses to deal with reference [HSAM93] but instead of working on horn clauses, weincorporate an abductive inference into the disjunctive model construction procedure of hyper tableaux [BFN96, Kuh97] which we argue ....
....clausal transformation step for abductive reasoning and established a formal completeness result for hyper tableaux with this abductive transformation. Finally, the algorithm is given that realizes our abductive inference in the incremental setting of hyper tableaux as promised at the beginning. [MdR99] also presents a tableaux calculus to deal whith anaphora resolution. Since they stay in a purely deductive framework, they do not generate referent hypotheses but only check the entailment of a given hypothesis. Their approach is restricted to pronouns with the gender information encoded as a ....
C. Monz and M. de Rijke. A tableau calculus for pronoun resolution. In N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'99, LNAI. Springer, 1999.
Abducing Coreference by Model Construction - Peter Baumgartner, Michael Kühn (1999) (8 citations) (Correct)
.... paid to the question which expressions cannot serve as antecedent referent due to structural constrains e.g. in conditional or negated clauses [10, 13] The challenging question how to establish the coreference between anaphora and possible antecedents in a logical framework is attacked e.g. in [17, 16]. We follow the line of Hobbs et al. who use a weighted abduction scheme on horn clauses to deal with reference [12] but instead of working on horn clauses, we incorporate an abductive inference into the disjunctive model construction procedure of hyper tableaux [3, 14] which we argue to be ....
....clausal transformation step for abductive reasoning and established a formal completeness result for hyper tableaux with this abductive transformation. Finally, the algorithm is given that realizes our abductive inference in the incremental setting of hyper tableaux as promised at the beginning. [16] also presents a tableaux calculus to deal whith anaphora resolution. Since they stay in a purely deductive framework, they do not generate referent hypotheses but only check the entailment of a given hypothesis. Their approach is restricted to pronouns with the gender information encoded as a ....
C. Monz and M. de Rijke. A tableau calculus for pronoun resolution. In N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'99, LNAI. Springer, 1999.
Deductions with Meaning - Monz, de Rijke (1998) Self-citation (Monz De rijke) (Correct)
No context found.
C. Monz and M. de Rijke. A tableau calculus for pronoun resolution. In N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'99, LNAI. Springer, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC