The notion of abduction was first introduced by the philosopher and logician C. S. Pierce, who claims de-duction, abduction and induction are three different forms of human reasoning. Broadly speaking, abduction is a ...The notion of abduction was first introduced by the philosopher and logician C. S. Pierce, who claims de-duction, abduction and induction are three different forms of human reasoning. Broadly speaking, abduction is a rea-soning process invoked to explain a puzzling observation. The study of logic-based abduction has been the most activeresearch in AI, and there are many results around the subject. This paper surveys the state-of-the-art research andpresents some problems for future work.展开更多
AI Plannig and Scheduling are a classical problem of Artificial Intelligene. It is a highlight of AI for it' s significance in many application domains. Recenctly,dramatic advances have been made in this field. In...AI Plannig and Scheduling are a classical problem of Artificial Intelligene. It is a highlight of AI for it' s significance in many application domains. Recenctly,dramatic advances have been made in this field. In this paper,we introduce our study on Graphplan which is one of the best methods and it's descendent technologys. First,we will analyse Graphplan's algorithm and it's key for success, then briefly introduce it's descendants,at the end of the paper,we suggest areas for future research.展开更多
文摘The notion of abduction was first introduced by the philosopher and logician C. S. Pierce, who claims de-duction, abduction and induction are three different forms of human reasoning. Broadly speaking, abduction is a rea-soning process invoked to explain a puzzling observation. The study of logic-based abduction has been the most activeresearch in AI, and there are many results around the subject. This paper surveys the state-of-the-art research andpresents some problems for future work.
文摘AI Plannig and Scheduling are a classical problem of Artificial Intelligene. It is a highlight of AI for it' s significance in many application domains. Recenctly,dramatic advances have been made in this field. In this paper,we introduce our study on Graphplan which is one of the best methods and it's descendent technologys. First,we will analyse Graphplan's algorithm and it's key for success, then briefly introduce it's descendants,at the end of the paper,we suggest areas for future research.
