A computational framework for dialectical reasoning
A computational framework for dialectical reasoning
复制标题
辩证推理的计算框架
DOI：
10.1145/222092.222224
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
P. Bratley
中科院分区：
文献类型：
--
作者：
P. St;D. Poulin;P. Bratley
辩证法不仅在法律上很重要，而且在知识不确定的每一个领域都很重要；也就是说，任何地方都必须做出假设。在回顾了计算辩证法及其相关领域的最新进展之后，我们提出了一个从基于规则的法律表示构建辩证论点的系统框架。在该系统中，元级别推理用于允许规则的多次使用。在对象级别，分组在模块中的规则代表“基础”知识。在元级，模块包含元级规则，这些规则在对象级或某个元级向其他模块查询参数。在参数构造过程中，元级规则使用一种过滤机制，其工作原理类似于简单的正则表达式。该机制根据它们的上下文选择较低级别的规则。系统的对象规则用解释性上下文标记，以允许不同的观点，同时保持知识的同构表示。规则之前可以有明确的否定，而矛盾规则的存在允许建立相互冲突的论点。文中给出了实例，并对今后的工作进行了讨论。
Dialectics are important not only in law but in every domain where knowledge is not certain; that is, everywhere assumptions must be made. After a review of recent advances in computational dialectics and related fields, we present the framework of a system for constructing dialectical arguments from a rule-based representation of law. In this system, meta level reasoning serves to allow for multiple utilisations of the rules. At the object level, rules grouped in modules represent “ground” knowledge. At the meta level, modules contain meta level rules that query other modules, at the object level or at some meta level, for arguments. During the construction of arguments, meta level rules use a filtering mechanism that works like simple regular expressions. This mechanism selects lower level rules according to their contexts. The object rules of the system are marked with interpretative contexts to permit varying points of view while maintaining an isomorphic representation of knowledge. The rules can be preceded by explicit negation, and the presence of contradictory rules allows conflicting arguments to be built. Examples are given and a discussion of future work concludes the paper.