• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>World Multiconference on Systemics, Cybernetics and Informatics and 5th International Conference on Information Systems Analysis and Synthesis Vol.5: Computer Science and Engineering, Jul 31-Aug 4, 1999, Orlando, Florida >Logical Formalization of Problems Using Declarative Programs
【24h】

Logical Formalization of Problems Using Declarative Programs

机译：使用声明式程序对问题进行逻辑形式化

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In conventional logic programming, a problem is formalized as a pair of a logic program and a query, and is solved by proving the query from the logic program. A new class of logical formalizations of problems is proposed in which a problem is formalized as a pair of a declarative program and a query. A declarative program is a generalization of a logic program, defined as a set of definite clauses consisting of "atoms" in a generalized object space. Definitions of interpretations, models, and logical consequences for declarative programs are developed. Based on the logical consequence relation (|=) for declarative programs, logical formalizations of problems by means of declarative programs are defined. Minimal models and declarative semantics of declarative programs are introduced, which are used for other characterizations of the proposed logical formalizations. In contrast to atoms in conventional logic, atoms in declarative programs are defined axiomatically. Since the axioms are basic and general, many problems in artificial intelligence can be formulated naturally by the proposed method.
机译：在常规的逻辑编程中，问题被形式化为一对逻辑程序和一个查询，并通过从逻辑程序证明查询来解决。提出了一类新的问题逻辑形式化，其中一个问题形式化为一对声明式程序和一个查询。声明性程序是逻辑程序的泛化，定义为一组由广义对象空间中的“原子”组成的确定子句。开发了声明性程序的解释，模型和逻辑结果的定义。基于声明式程序的逻辑结果关系（| =），定义了通过声明式程序进行问题的逻辑形式化。介绍了声明性程序的最小模型和声明性语义，这些最小模型和声明性语义用于所提出的逻辑形式化的其他特征。与常规逻辑中的原子相反，声明式程序中的原子是公理定义的。由于公理是基本的和通用的，因此所提出的方法自然可以解决人工智能中的许多问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号