Some Frills for the Modal Tic-Tac-Toe of Davies and Isard: Semantics of Predicate Complement Constructions
Proceedings of the Third International Joint Conference on Artificial Intelligence. Natural Language; Semantics and Parsing. Pages 352-354.
© 1973 International Joint Conferences on Artificial Intelligence
Abstract
Predicate complement constructions are a rich source of semantic problems. The semantics of these constructions is explored in the context of the tictac-toe game playing setting of Davies and Isard {1972). Even in this limited setting, the implementations of these constructions are quite nontrivial, suggesting that such restricted settings provide a good testing ground for many key linguistic problems. Descriptive terms: language understanding systems, semantics, game playing, predicate complement constructions, presuppositions.
- l, Davies, D.J.M. and Isard, S.D., '~tterances as programs," Presented at the 7th International Machine Intelligence Workshop, Edinburgh, June, 1972.
- Isard, S.D., and Longuet-Higgins, •c., ''Modal Tic- tac-toe," unpublished (1971).
- Karttunen, L., "On the semantics of complement sentences," Papers from the 6th Regional Meeting, Chicago Linguistics Society, April, 1970. 4. 5.
- Kiparsky, P. and Kiparsky, c., "Fact", in Recent Advances in L1 sties {ed. M. Bierwish and H. Heidolph , Mouton and Co., The Hague, 1970.
- Rosenbaum, P., Predicate Complement Constructions in English, M.I.T. Press, Cambridge, 1969.
- Winograd, T., Understanding Natural Language, Academic Press, New York, 1972.
References were extracted automatically from the PDF and may contain errors.
Full text extracted automatically from the PDF; figures, tables and equations may differ. The PDF is the version of record.
1. Introduction
Restricted settings such as those considered by Winograd (1972) and Davies and Isard {1972) appear to be useful for studying many key linguistic problems.
In this paper, we will try to explore the se mantics of predicate complement constructions (i.e., verbs requiring predicate complements e.g., prevent, force, pretend, help, etc.) in the context of the tic-tac-toe game playing setting of Davies and Isard (1972).
After giving a short sketch of the predicate complement constructions and briefly describing the work of Davies and Isard, we will give a number of examples to illustrate the problems involved in the implementations of these constructions. The major conclusions have been summaried in Section 4.
This system is being implemented in LISP.
* The Moore School of Electrical Engineering and De partment of Linguistics, University of Pennsylvania, Philadelphia.
**The Moore School of Electrical Engineering, Uni versity of Pennsylvania, Philadelphia.
This work was partially supported by NSF Grant GS35125 and a Ford Foundation Fellowship.
We are indebted to the two referees of this paper for their valuable comments which helped us to improve the accuracy and the style of presentation.
- Bill prevented Mary from leaving.
- Mary did not leave.
Verbs such as fail are negative implicative verbs (v(S):;, ...s, ...... v"(S'f":;, S). Two other classes are factive and counterfactive. An example of a factive verb is realize.
- John realized that Mary stayed horne.
- John did not realize that Mary stayed horne.
Asserting (9) or (9a) requires the speaker to pre suppose the truth of (10).
- Mary stayed horne.
It should be clear now what is meant by a counter facti ve verb. An example of a counterfactive verb is pret end.
It appears worthwhile exploring in some detail implementations of these constructions in the tic-tac toe game playing setting of Davies and Isard (1972). Admittedly, many of these constructions receive sterile int erpretations in this context, but many others, to gether with the modal constructions of Davies and Isard, raise some interesting problems concerning their implementation.
We will illustrate these problems by several examples and try to draw same general conclusions about implementation of these constructions in the type of settings mentioned above.
3. Modal tic-tac-toe of Davies and Isard and the semantics of same pc-verbs:
3.1 Davies and Isard (1972) have chosen the sett ing of a game of tic-tac-toe in order to explore the semantics of modal verbs. (mi~t, ~' will, etc.) and hypotheticals (if you had ···· This is a simple enough, yet nontrivial, setting. It provides them a universe of discourse in which they can discuss the notion of possible courses of events -- what might happen in the future as well as what might have happened, but did not. Their program plays tic-tac t oe against a human opponent and can answer questions about the course of the game.
We will use this setting to explore the semantics of same pc-verbs. In particular, we will be interested in const ruct ions in which both a modal and a pc-verb occur. Some pc-verbs will require consideration of the possible courses of events even without the presence of a modal verb.
There appear to be at least four different factors we have t o consider. These are as follows. (Let H and M denote the human opponent and the machine respective1¥·)
- Instead of j ust one possible course of events, we will be concerned with a set or sets of possible courses of events.
- M will be concerned with possible courses of events not only with respect to its own play but also
with respect to H's play because M is required to act as if it is H.
- Whether or not certain presuppositions hold has to be checked by M not only with respect to one possible course of events but also with respect to a set of possible courses of event s.
- M has to deal with possible courses of events because M has to act as if its own goal is changed.
- It was not clear from Davies and Isard (1972) whether all these factors were considered by them. A referee has pointed out to us that their program does cope to some extent with these factors.
- We shall see the effect of these factors in a number of example situations.
Notation: H: human opponent; M: machine; m,n ···· position of square on the tic-tac-toe board. The squares are numbered 1, 2, 3 ··· , 9 from left to right and from top to bottom. Y, Z: number of move; Y will range over M's moves and Z over H's moves.
prevent {not in the sense of forbid) {negative-if verb):
- H: Could I have prevented you from taking m on the Yth move?
In order to answer affirrnati vely, M has to check that there is at least one possible course of events up to the (Y-l)th move such that if this course of events had actually occurred it would not have been wise for M to take m on the Yth move. Thus M is required to con struct a set of possible courses of events and check whether at least one of them satisfies a certain property.
M also has to check the presupposition that the actual course of events was such that indeed on the Yth move M took m; otherwise the question about preventing M does not arise. The presuppositions of prevent are not always completely clear. For example, consider ''Not only could I have prevented you from winning, I could even have prevented you from drawing the game. " There appears to be no presupposition for the second prevent. (This example is due to a referee.) Of course, here we have a composition of prevent and ~ only - but also. In general, whenever we have a compo sition of two pc-verbs or a pc-verb and a connective, the presuppositions became less obvious. We will come across this phenomenon several times in the following.
- {2) H: On the Zth move, could I have prevented you from winning?
M has to start with the actual state of affairs as of the (Z-l)th move and check whether, on the Zth move, there was a nonlosing strategy for H. Alternatively, it has to check whether, for any Zth move of H, M has a winning strategy. If so, the reply is affirmative; otherwise, i t is negative.
Again we see that M has to verify a certain proper ty for a set of possible courses of events rather than a specified course of events.
The presupposition here is that M did win; other wise, the question of preventing M from winning is unnatural. Again if we have a composition such as "It was still possible for you to win as late as the 6th move, but I could have prevented you from winning as early as the 3rd move", the presuppositions are less obvious (example is due to a referee).
We can also consider the possibility of M re flecting on its performance by asking questions as in (2) to itself and coming out with uninvited responses such as the following.
- M: On the Yth move, I could have prevented you from winning.
- M: I realize that, on the Yth move, I could have prevented you from winning.
(Note that we have here a composition of pc-verbs: realize and prevent. Realize in our context is semantically almost vacuous.)
Parallel to ( 3) and ( 4) we could also have
- (3') M: On the Zth move, you could have prevented me from winning.
- (4') M: I realize that, on the Zth move, I could have prevented you from winning.
force (if verb):
- M: On the Zth move, could I have forced you to lose?
Starting with the state of affairs as of the (Z-l)th move, M checks to see whether there was a winning strategy for H.
The presupposition is either (i) at least after the Zth move, M was still not forced to lose, or (ii) M did not lose. The second presupposition seems more natural, at least for the rather trivial game under consideration.
have the opportunity, be in a position, etc. (on1y-if verbs):
- M: On the Yth move, were you in a position (did you have the opportunity) to win?
We have two interpretations here: M checks whether
- (i) On the Yth move, there is a winning strategy for M.
- (ii) On the Yth move, there is no winning strategy for H.
There is a third possibility (unnatural in such a trivial game as tic-tac-toe) which is as follows. move could have finished the game with M winning, somehow M missed the opportunity. Yth but
The presupposition is either (i) M did not win or
- (ii) M won, but H is asking the question because H wants to know when M's win was guaranteed. The first presupposition is consistent with be in a position being an only-if verb; however, the second one is not .
We can compose force and have the opport uni t y as follows.
- H: On the Yth move, were you in a position to force a win?
The answer is affirmative if, on the Yth move, there was a winning strategy available to M; otherwise , it is negative.
The presupposition seems to be that M did not force a win on or before the Yth move.
- H: On the Yth move, could you have forced a win?
The interpretation and the presuppositions are t he same as in (7) above.
help (if-verb):
Assume that it is H's turn. Prior to making his move H asks M the following question.
- H: Can you help me?
The understood complement is either to win or not to lose. Let us assume that it is to win~as t o- see whether there is a winning strategy for· H. One way is by switching turns i.e., by acting as i f i t is i t s own turn and checking to see whether it has a winni ng strategy. If there i s such a strategy, M tells H t he next move.
If the understood complement is not to lose, we replace "winning strategy" by "nonlosing strategy" i n the above interpretation.
- H can put the question not as in (9) but as in (10) below where no pc-verb occurs.
(10) H: What would be your move, if you were me ?
M would interpret (10) in exactly the same way as it did (9). There is a difference, however. In (10), His explicitly asking M to switch turns and thereby indirectly helping H. In (9), M has to switch turns if it wants to help H. If it didn't switch turns, M wouldn't really be helping H. As a matt er of fact, · this is exactly the way M would have to behave if i t has to respond to the following ques t ion.
- H: What would be your move, if you were pretending to help me (to win)?
Note that pretend is a pc-verb (counterfact ive verb), We have here a composite pc-verb -- pretend help, Thus the set of possible courses of events con sidered by M depends on whose turn M is taking; its own or H's, Of course, there remains the possibility of M responding to (9) as if it is responding to (ll) i,e,, it will not switch turns when it ought to have!
There is yet another way H can ask M's help. Assume that it isM's turn, M is about to make its move and H asks M the following question.
{12) H: Can you help me?
Asstune that the understood complement is to win, M has to check whether there is a winning strategy for H. This can be done by M by switching its normal goal of not losing to losing, Hence, M must have the ability to play the game with its goal being either not losing or losing,
The possible courses of events M has to consider, therefore, depend on whether M switches turns or goals,
4, Conclusions
- l, The examples in the previous section clearly show that the implementations of the predicate complement constructions are not trivial in the setting considered,
- 2, pc-verbs can be composed, although not all products are possible, Any semantic account of pc-verbs has to explain how it can be extended to the products. This is rarely done in any great detail {see Karttunen {1970) for some examples), The restricted settings we have considered are good places to carry out this kind of detailed checking, We have seen already that the compositions {of pc-verbs, pc-verbs and modals, or pc-verbs and connectives) are far from clear in their presuppositions.
- 3, In our restricted se.tting many pairs of verbs are very nearly synonymous, As an example {perhaps not thoroughly convincing) consider
- H: What would be your move, if you were helping me (to win)?
- H: What would be your move, if you were allowing me to win ?
- is perhaps more natural than (14), but in our setting (14) would be interpreted in the same way as {13), Thus help and allow {not in the sense of giving permission, but in the sense of making it possible) appear to be locally synonymous (i.e,, synonymous in our setting).
The whole class of pc-verbs is very rich, There are subtle differences between apparently synonymous verbs, However, one has the feeling that even in ordinary discourse, we often ignore these differences when the setting is well understood. It might be interesting to study settings from the point of view of the local synonymies they induce,
- 4, The last coument is somewhat paradoxical, Our restricted setting, which appears to be clearly defined, may not be so well defined after all; we have some difficulty in deciding on the correct interpretation for some of our examples,
@inproceedings{ijcai1973p45,
title = {Some Frills for the Modal Tic-Tac-Toe of Davies and Isard: Semantics of Predicate Complement Constructions},
author = {Joshi, Aravind K. and Weischedel, Ralph M.},
booktitle = {Proceedings of the Third International Joint Conference on
Artificial Intelligence, {IJCAI-73}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Nils J. Nilsson},
pages = {352--354},
year = {1973},
month = {8},
note = {Natural Language; Semantics and Parsing},
url = {https://ijcai.org/proceedings/1973/45},
}
TY - CPAPER TI - Some Frills for the Modal Tic-Tac-Toe of Davies and Isard: Semantics of Predicate Complement Constructions AU - Joshi, Aravind K. AU - Weischedel, Ralph M. T2 - Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 PB - International Joint Conferences on Artificial Intelligence PY - 1973 SP - 352 EP - 354 UR - https://ijcai.org/proceedings/1973/45 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: