Martin D. Davis. A program for Presburger's algorithm. In Summer Institute for Symbolic Logic, pages 215--233, Cornell University, Ithaca, NY, 1957. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Gedanken: A tool for pondering the tractability of correct.. - Ericson (1994) (Correct)
....intractable. In Chapter 5, we review work on the problem of improving the average cost of deciding sentences in languages whose decision problem is in general intractable. First, we examine three sublanguages, in set theory [FOS80, Pol87a] real algebra [CH91, Hon93] and integer linear programming [Dav57, Coo71, Coo72, Sho77, CZ93]. The average case complexity analyses arising in this works tends to be somewhat anecdotal. Several approaches 5 have arisen which give optimistic or at least more definitive average case complexity results. For example, we can search for tiny sublanguages whose decision problem has polynomial ....
....In this chapter, we review work on the problem of improving the average cost of deciding sentences in languages whose decision problem is in general intractable. First, we examine three sublanguages, in set theory ( FOS80] Pol87a] real algebra ( CH91] Hon93] and integer linear programming ([Dav57], Coo71] Coo72] Sho77] CZ93] In reviewing this work we will see that the analysis of the e#ectiveness of heuristics in real algebra and integer linear programming tends toward the anecdotal. Several approaches have arisen which give optimistic results: 1) Search for tiny sublanguages ....
Martin D. Davis. A program for Presburger's algorithm. In Summer Institute for Symbolic Logic, pages 215--233, Cornell University, Ithaca, NY, 1957.
The Average Case Complexity of Multilevel Syllogistic - Cox, Ericson, Mishra (Correct)
....from some class of functions, rela2 tions and types. It is then natural to focus on the problem of improving on the average cost of decision problems that are in general intractable. In this paper we examine two sublanguages, fragments of set theory [FOS80, Pol87] and integer linear programming [Dav57, Coo71, Coo72, Sho77, CZ93] used in the Davis Schwartz approach to correct program technology. Several ways of dealing with the seeming intractability of these languages have been explored. For example, we can search for tiny sublanguages whose decision problem has polynomial time complexity in the worst case [Pra77, ....
Martin D. Davis. A program for Presburger's algorithm. In Summer Institute for Symbolic Logic, pages 215--233, Cornell University, Ithaca, NY, 1957.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC