Investigating Reasoning with Constraint Diagrams
Investigating Reasoning with Constraint Diagrams
复制标题
用约束图研究推理
DOI：
10.1016/j.entcs.2004.08.047
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Jean Flower
中科院分区：
文献类型：
--
作者：
A. Fish;Jean Flower
约束图是一种可视化的符号，用于表示逻辑约束。用一个阅读树（实际上是量词的偏序）来扩充图，可以确保每个图都有唯一的语义解释。在本文中，我们讨论的例子，推理规则增强约束图表现出有趣的属性或困难时，可能会出现这样一个图形系统的规则。我们不提出一套完整的规则，但调查出现的一般问题，提供解决方案。一个问题对应于量词的嵌套，另一个问题涉及全称量化的域。这些问题可能是一个重要的考虑，在定义其他逻辑推理系统，明确表示量化图解。
Constraint diagrams are a visual notation designed to express logical constraints. Augmenting the diagrams with a reading tree (effectively a partial ordering of quantifiers) ensures that each diagram has a unique semantic interpretation. In this paper, we discuss examples of reasoning rules for augmented constraint diagrams which exhibit interesting properties or difficulties that can arise when developing rules for such a diagrammatic system. We do not present a complete set of rules, but investigate the generic problems arising, providing solutions. One problem corresponds to the nesting of quantifiers and another relates to the domain of universal quantification. These issues may be an important consideration in the definition of other logical reasoning systems which explicitly represent quantification diagrammatically.