Abstract

data structures for these that allow the definition of efficient algorithms. This half of the paper is marred by incoherence in the only complicated example (2.48-49 on p. 52), but it is one of the best articles at an accessible level on this still very current topic. An updated version with discussion of typed theories would be welcome. The second half of Fenstad et al.'s paper is a 24-page development of situation semantics. It first introduces a proof theory for a situation-theoretic logic using a generalization of a Gentzen calculus (needed to deal with strong and weak negation simultaneously). The theorem prover is put to use in a question-answering system, but the report on the nonsemantic details of the system (morphology, parser, generator) unfortunately leaves little room for the development of a number of intriguing points on the potential and implementation of situation theory for computational semantics. 131 These concern the Prolog implementation of partial logics, the t

Citations