首页    期刊浏览 2024年11月23日 星期六
登录注册

文章基本信息

  • 标题:CCALC and Satisfiability Planning
  • 本地全文:下载
  • 作者:Asim Ali Shah
  • 期刊名称:Computer Sciences and Telecommunications
  • 印刷版ISSN:1512-1232
  • 出版年度:2005
  • 期号:01
  • 页码:36-42
  • 出版社:Internet Academy
  • 摘要:This paper is described in the spirit of what is known as the logical approach to AI. McCarthy proposed that to address a planning problem in AI by first giving a “formal statement of the premises“ & then to develop a program capable of common sense reasoning about action and change. A program that is able to perform such tasks as prediction, explanation, and planning. The goal here is to take a careful look at the early history of AI and to identify some of the logical and algorithmic ideas related to problems that have emerged over the years. An experiment is presented that summarizes the duration of the computation (in CPU seconds) using Sato when its input is generated by Ccalc.
  • 关键词:Propositional logic system, Transition System, Causal logic, Sat-Planning, Solvers, Ccalc, C.t (Causal Theory), Grounding
国家哲学社会科学文献中心版权所有