返回Google圖書搜尋

Computing Circumscriptive Databases

Anil NerodeRaymond T. NgV. S. Subrahmanian

其他書名	Theory and algorithms
出版	Mathematical Sciences Institute, Cornell University, 1992
URL	http://books.google.com.hk/books?id=UvdUAAAAYAAJ&hl=&source=gbs_api

註釋Abstract: "Though circumscription was introduced by McCarthy over a decade ago, there has been relatively little work on algorithms for computing circumscriptive databases. In this paper, we develop algorithms to compute the preferred models of circumscriptive databases at compile- time using mixed integer linear programming techniques. Two advantages of this (bottom-up) approach are that it makes efficient reuse of previous computations and it provides much faster run-time performance. Some other advantages of using linear programming to automate deduction at compile time is that its re-optimization facilities elegantly accommodate database updates and also that it leads to a completely declarative formulation in which ordering of rules and literals in rule bodies plays no real role