...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Theory and Practice of Logic Programming >Program completion in the input language of GRINGO
【24h】

Program completion in the input language of GRINGO

机译：用GRINGO的输入语言完成程序

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

摘要

We argue that turning a logic program into a set of completed definitions can be sometimes thought of as the "reverse engineering" process of generating a set of conditions that could serve as a specification for it. Accordingly, it may be useful to define completion for a large class of Answer Set Programming (ASP) programs and to automate the process of generating and simplifying completion formulas. Examining the output produced by this kind of software may help programmers to see more clearly what their program does, and to what degree its behavior conforms with their expectations. As a step toward this goal, we propose here a definition of program completion for a large class of programs in the input language of the ASP grounder gringo, and study its properties.
机译：我们认为将逻辑程序转换为一组完整的定义有时可以被视为生成一组条件的“逆向工程”过程，该条件可以用作其规范。因此，定义一整套答案集编程（ASP）程序的完成并自动生成和简化完成公式的过程可能很有用。检查这种软件产生的输出可以帮助程序员更清楚地了解他们的程序做什么，以及程序的行为在多大程度上符合他们的期望。作为朝着这个目标迈出的一步，我们在此提出了使用ASP Grounder gringo的输入语言为一大类程序定义程序完成的定义，并研究其属性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号