#### DMCA

## A Higher-Order Extension of Constraint Programming in Discourse Analysis (1993)

Venue: | First Workshop on Principles and Practice of Constraint Programming (Rhode Island |

Citations: | 1 - 1 self |

### Citations

4818 |
Introduction to automata theory, languages, and computation
- Hopcroft, Ullman
- 1979
(Show Context)
Citation Context ...belled transition systems, on the basis of a transformation L that is essentially the familiar construction of a deterministic finite automaton from a non-deterministic one (e.g., Hopcroft and Ullman =-=[7]-=-). The transformation L will play a significant role in our investigations; it is perhaps worth mentioning at this point that it can be employed to extract the DRS's mentioned above from dynamic logic... |

1075 |
The semantics of definite and indefinite noun phrases.
- Heim
- 1982
(Show Context)
Citation Context ...tations. A formalism for analyzing natural language discourse that has received considerable attention in certain linguistic circles is Discourse Representation Theory (DRT), due to Kamp [8] and Heim =-=[6]-=-. The basic idea in DRT is to capture the information a piece of discourse contributes by interpreting a natural language sentence semantically as a binary relation on so-called Discourse Representati... |

1012 | Dynamic Logic.
- Harel, Kozen, et al.
- 2000
(Show Context)
Citation Context ...ese meanings, DRT can be presented through a slight variant, Groenendijk and Stokhof [4]'s Dynamic Predicate Logic (DPL), which is, in turn, based on quantified dynamic logic (see, for example, Harel =-=[5]-=-). DPL translates first-order formulas A to programs A DPL from dynamic logic as follows 2 A DPL = A? for atomic A (A&B) DPL = A DPL ; B DPL (9x A) DPL = x :=? ; A DPL (:A) DPL = : (A DPL ) ; where th... |

807 |
A theory of truth and semantic representation.
- Kamp
- 1981
(Show Context)
Citation Context ... and-or computations. A formalism for analyzing natural language discourse that has received considerable attention in certain linguistic circles is Discourse Representation Theory (DRT), due to Kamp =-=[8]-=- and Heim [6]. The basic idea in DRT is to capture the information a piece of discourse contributes by interpreting a natural language sentence semantically as a binary relation on so-called Discourse... |

777 |
Concurrency and automata on infinite sequences, in:
- Park
- 1981
(Show Context)
Citation Context ... can be said to be "eliminative" (as opposed to the "expansive" growth described in section 1.1, where v is `). Accompanying the abstract notion of a transition system is that of a=-= bisimulation (Park [12]). A relat-=-ion R ` S \Theta S 0 is a bisimulation between transition systems hS; f l !g l2L ; s 0 i and hS 0 ; f l ! 0 g l2L ; s 0 0 i if it satisfies the "back-and-forth" condition that whenever sRs 0... |

462 | Dynamic Predicate Logic’,
- Groenendijk, Stokhof
- 1991
(Show Context)
Citation Context ...s called "force" below.) No claim is (of course) made here that (i) and (ii) represent the "proper" notions of quantification and parallelism; only that there are works (e.g., Groe=-=nendijk and Stokhof [4]-=-, Peleg [13], and the references cited therein) where notions of quantification and parallelism different (in essential ways) from Saraswat [14] are studied (and that such notions are what concern the... |

200 |
Concurrent Constraint Programming Languages.
- Saraswat
- 1989
(Show Context)
Citation Context ...3 Discussion: back to constraint programming As has already been pointed out (in footnote 1), the notions of quantification and parallelism above differ in essential ways from the notions in Saraswat =-=[14]. Extendin-=-g the system above further with constructs for locality ("hiding") and communication are obvious next steps, although some (common) motivation might be helpful for considering these various ... |

116 |
On the interpretation of intuitionistic number theory.
- Kleene
- 1945
(Show Context)
Citation Context ...ion can take the form either of (i) closing the collection of states inductively under a partial function construct, whereupon the interpretation of implication and universal quantification in Kleene =-=[9]-=- can be adapted to ), or, more modestly, of (ii) extending the collection of states by a single application of the powerset construct, and then treating a state given by a set of states as a family of... |

96 |
Constructible falsity,
- Nelson
- 1949
(Show Context)
Citation Context ... closing predicate symbols under so-called anti-extensions, and treating 8; oe andsas primitive, thereby allowing De Morgan's laws to be incorporated into ��. (The map �� goes back at least to=-= Nelson [11]-=-, and has come to be known in the literature as strong negation.) What requires a bit more work is interpreting universal quantification and implication dynamically. That interpretation is most conven... |

57 |
Communication in concurrent dynamic logic.
- Peleg
- 1987
(Show Context)
Citation Context ...orce" below.) No claim is (of course) made here that (i) and (ii) represent the "proper" notions of quantification and parallelism; only that there are works (e.g., Groenendijk and Stok=-=hof [4], Peleg [13]-=-, and the references cited therein) where notions of quantification and parallelism different (in essential ways) from Saraswat [14] are studied (and that such notions are what concern the present pap... |

8 |
Transition Systems and Dynamic Semantics', in
- Fernando
- 1992
(Show Context)
Citation Context ...e computational state. In fact, in relating dynamic logic to the construction of first-order contexts, it is natural to work with states defined only on finitely many variables (as argued in Fernando =-=[1]-=-, appealing, for instance, to Henkin witnesses and back and forth constructions). Accordingly, in place ofsS, let us consider the set S 0 of valuations S 0 = fs j s is a function from a finite subset ... |

6 |
Proof theory: some personal recollections. Appendix to Gaisi Takeuti, Proof Theory, second edition
- Kreisel
- 1987
(Show Context)
Citation Context ...s, I found this subject [intuitionistic logic] distasteful because ... iterated implications made my head spin. They continue to do so, and the same is true of functions of all finite types. (Kreisel =-=[10], p. 397). To keep m-=-atters from getting out of hand, it is useful to cut down functional states s, observing that "all that really matters" in s is its image, which is treated "conjunctively" in (4). ... |

5 | Comparative transition system semantics - Fernando - 1993 |

1 |
The donkey strikes back
- Fernando
(Show Context)
Citation Context ...nalyzed in much the same way as (). Briefly, the difficulty is that the pronoun he in () must refer not only to a particular player, but to every player. The solution below was introduced in Fernando =-=[2]-=-, where applications to natural language are taken up. The point of the present paper (beyond relating the work mentioned to constraint programming) is to examine the rather remarkable feature of the ... |