C. Monz and M. de Rijke. A tableaux calculus for ambiguous quantification. In H. de Swart, editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'98, LNAI 1397, pages 232-- 246. Springer, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....discourses even though there are linear time translations [24] 3 (Automated) Deduction for Discourse Logics There have been several attempts to mechanize dynamic logics, i.e. to develop calculi and inference procedures for the satisfiability, validity and entailment problems for dynamic logics. [20, 18, 17, 9, 23, 16] give deductive calculi that operate either on DRSes or on FO formulae with dynamic (DPL) semantics. 20, 17, 9] present calculi for the validity problem in DRT and [16] for that in DPL. In FOL, it is sufficient to study the validity problem, since it subsumes the entailment problem: FOL admits a ....

....calculi and inference procedures for the satisfiability, validity and entailment problems for dynamic logics. 20, 18, 17, 9, 23, 16] give deductive calculi that operate either on DRSes or on FO formulae with dynamic (DPL) semantics. 20, 17, 9] present calculi for the validity problem in DRT and [16] for that in DPL. In FOL, it is sufficient to study the validity problem, since it subsumes the entailment problem: FOL admits a deduction theorem, so A1 ; An j= C iff A1 : An ) C is valid. Classical DRT [8] does not admit a deduction theorem, since the symmetric merge operator which ....

[Article contains additional citation context not shown here]

C. Monz and M. de Rijke, `A tableaux calculus for ambiguous quantification ', in Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'98, ed., H. de Swart, LNAI 1397, pp. 232--246. Springer, (1998).

....discourses even though there are linear time translations [23] 3 (Automated) Deduction for Discourse Logics There have been several attempts to mechanize dynamic logics, i.e. to develop calculi and inference procedures for the satisfiability, validity and entailment problems for dynamic logics. [19, 17, 16, 9, 22, 15] give deductive calculi that operate either on DRSes or on FO formulae with dynamic (DPL) semantics. 19, 16, 9] present calculi for the validity problem in DRT and [15] for that in DPL. In FOL, it is sufficient to study the validity problem, since it subsumes the entailment problem. FOL admits a ....

....calculi and inference procedures for the satisfiability, validity and entailment problems for dynamic logics. 19, 17, 16, 9, 22, 15] give deductive calculi that operate either on DRSes or on FO formulae with dynamic (DPL) semantics. 19, 16, 9] present calculi for the validity problem in DRT and [15] for that in DPL. In FOL, it is sufficient to study the validity problem, since it subsumes the entailment problem. FOL admits a deduction theorem, so A1 ; An j= C iff A1 : An ) C is valid. Classical DRT [8] does not admit a deduction theorem, since the symmetric merge operator which ....

[Article contains additional citation context not shown here]

C. Monz and M. de Rijke, `A tableaux calculus for ambiguous quantification ', in Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'98, ed., H. de Swart, LNAI 1397, pp. 232--246. Springer, (1998).

No context found.

C. Monz and M. de Rijke. A tableaux calculus for ambiguous quantification. In H. de Swart, editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'98, LNAI 1397, pages 232-- 246. Springer, 1998.

.... in an ambiguous setting things are a bit different: underspecified representations are compact representations of several formulas, i.e. they are syntactically ambiguous, and at the moment it is not obvious how to reason with ambiguous formulas without disambiguating them at least partially, cf. [Jas97, MdR98]. The question is how can we restrict the massive branching of contexts when updating with ambiguous information. If we do not update with total disambiguations but instead interleave updating and disambiguation we might gain a decrease in complexity because further disambiguation steps depend on ....

....Gro95] for a comparison of dynamic entailment relations. Second, our notion of entailment is very weak, because it presupposes that all readings in the premises entail all readings in the conclusion, but for dealing with natural language semantics it seems to be an appropriate definition, see [vD96, MdR98, Rey95] for further discussion and refinements. 220 4 Conclusion Our formalism is monotone and it inherits the properties of eliminativity and distributivity from EDPL. It is more general than DPL based approaches, because it gives an account for pronoun resolution without relying on coindexation and ....

[Article contains additional citation context not shown here]

C. Monz and M. de Rijke. A tableaux calculus for ambiguous quantification. In H. de Swart, editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'98, LNAI 1397, pages 232--246. Springer, 1998.

.... tableau methods are especially well suited for reasoning with natural language semantics, since they are analytic (in contrast to Natural Deduction) and they allow for a more sensitive manipulation of the syntactic structures of the formulas (in contrast to resolution methods) See, for instance, [KK98, MdR98c] for other applications of tableau methods in the area of computational semantics. Future work will be devoted to extending our tableau calculus to more complex cases of anaphora resolution, like presuppositions, or plural pronouns, where contextual information has to contain more structure than ....

....At the same time, it has to be investigated how a more comprehensive framework that allows to reason with different kinds of ambiguity can be set up. We plan to combine our tableau calculus for pronoun resolution with some of our earlier work on reasoning with quantificational ambiguity, cf. [MdR98c]. Acknowledgments. We want to thank the referees for their helpful comments. Christof Monz was supported by the Physical Sciences Council with financial support from the Netherlands Organization for Scientific Research (NWO) project 612 13 001. Maarten de Rijke was supported by the Spinoza ....

C. Monz and M. de Rijke. A tableaux calculus for ambiguous quantification. In H. de Swart, editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'98, Lecture Notes in Artificial Intelligence 1397, pages 232--246. Springer, 1998.

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