Existential graphs and dynamic predicate logic

被引:0
|
作者
vandenBerg, H
机构
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Using first-order logic to represent the meaning of natural language sentences forces a non-compositional analysis of cross-sentential anaphora and donkey-anaphora, Groenendijk and Stokhof developed Dynamic Predicate Logic, in syntax equal to first-order logic, but with a different semantics. Using Dynamic Predicate Logic, anaphora can be analyzed in a compositional way. The same results can be achieved using Existential Graphs, developed by C.S. Peirce. The advantages of using Existential Graphs are that Existential Graphs are less complicated and easier to use than Dynamic Predicate Logic, and that Existential Graphs do not require a change of semantics. We discuss two types of anaphora, describe Dynamic Predicate Logic and Existential Graphs, give logical properties of both formalisms, and compare the two approaches.
引用
收藏
页码:338 / 352
页数:15
相关论文
共 50 条