Anne Dugourd

Learn More
70 This paper discusses the representational and algorithmic power of the conceptual graph model for natural language semantics and knowledge processing. Also described is a Prolog-like resolution method for conceptual graphs, which allows one to perform deduction on very large semantic domains. The interpreter that we have developed is similar to a Prolog(More)
ion operator was introduced as the lambda abstraction operator because this semantic model is based on a particular interpretation of the typed lambda calculus used to denote natural language semantics. Thus, a particular “pen” can be denoted by the 0-order expression h()[pen 1231, the class of all pens can be defined by the 1-order expression h(x)[pen(x)],(More)
  • 1