作者
Stephen A Cook, Yongmei Liu
发表日期
2003/8/1
期刊
Journal of Logic and Computation
卷号
13
期号
4
页码范围
581-594
出版商
Oxford University Press
简介
Blocks World (BW) has been one of the most popular model domains in AI history. However, there has not been serious work on axiomatizing the state constraints of BW and giving justification for its soundness and completeness. In this paper, we model a state of BW by a finite collection of finite chains, and call the theory of all these structures BW theory. We present seven simple axioms and prove that their consequences are precisely BW theory, using Ehrenfeucht-Fraïssé games. We give a simple decision procedure for the theory which can be implemented in exponential space, and prove that every decision procedure (even if nondeterministic) for the theory must take at least exponential time. We also give a characterization of all nonstandard models for the theory. Finally, we present an expansion of BW theory and show that it admits elimination of quantifiers. As a result, we are able to characterize all …
引用总数
2002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202411122312111111132231
学术搜索中的文章