Jim Cox, Lars Ericson, Bud Mishra  Home/Search
Context
Related
| de/pub/languages/nyu.edu/...tr711.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: de/pub/languages/nyu.ed...reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An approach to the problem of developing provably correct programs has been to enrich a theorem prover for Hoare logic with decision procedures for a number of decidable sublanguages of set theory ( EMLS, MLS, and extensions) and arithmetic (FPILP ) [Sch77]. Citing results of Goldberg [Gol79] on average case behavior of algorithms for SAT , it was hoped that these decision procedures would perform well on average. So far, it has been fairly difficult to prove average case NP-hardness... (Update)
Similar documents (at the sentence level):
20.7%: Gedanken: A tool for pondering the tractability of correct.. - Ericson (1994) (Correct)
Active bibliography (related documents): More All
0.5: SETL for Internet Data Processing - Bacon (2000) (Correct)
0.4: Program Derivation With Verified Transformations - A Case Study - Keller, PAIGE (1995) (Correct)
0.4: Learning Semantic Grammars with Constructive Inductive Logic.. - Zelle, Mooney (1993) (Correct)
Similar documents based on text: More All
0.6: Decision Procedures for flat set-theoretical syllogistics. I.. - Cantone, al. (1992) (Correct)
0.2: Sublanguages - Kittredge (1982) (Correct)
0.1: Enumeration of Tree Properties by Nave Methods - Lars Ericson New (Correct)
BibTeX entry: (Update)
@techreport{ cox95average,
author = "J. Cox and L. Ericson and B. Mishra",
title = "The Average Case Complexity of Multilevel Syllogistic",
number = "TR1995-711",
month = ",",
year = "1995",
url = "citeseer.ist.psu.edu/323997.html" }
Citations (may not include all citations):650 An axiomatic basis for computer programming (context) - Hoare - 1969
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960
356 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
320 Hard and easy distributions of SAT problems - Selman, Mitchell et al. - 1992
223 Assigning meanings to programs (context) - Floyd - 1967
112 Average case complete problems (context) - Levin - 1986
72 Many hard examples for resolution (context) - Chvatal, Szemeredi - 1987
60 Constructions: A higher order proof system for mechanizing m.. (context) - Coquand, Huet - 1985
53 Deciding linear inequalities by computing loop residues (context) - Shostak - 1981
49 Average case completeness - Gurevich - 1991
43 Theorem proving in arithmetic without multiplication (context) - Cooper - 1972
38 Analytica: A theorem prover for mathematica - Clarke, Zhao - 1993
30 Grundlagen der Mathematik (context) - Hilbert, Bernays - 1968
29 the theory of average case complexity - Ben-David, Chor et al. - 1989
26 Two easy theories whose combination is hard - Pratt - 1977
18 Decision procedures for elementary sublanguages of set theor.. (context) - Ferro, Omodeo et al. - 1980
16 Elimination of infrequent variables improves average case pe.. - Franco - 1991
15 Metamathematical extensibility for theorem verifiers (context) - Davis, Schwartz - 1979
14 the probabilistic performance of algorithms for the satisfia.. - Franco - 1986
12 Induction principles formalized in the calculus of construct.. (context) - Huet - 1988
12 Algorithm development in the calculus of constructions (context) - Mohring - 1986
12 Programs for mechanical program verification (context) - Cooper
9 Optimization and complexity issues (context) - Cantone, Omodeo et al. - 1990
9 Randomizing reductions of search problems - Blass, Gurevich - 1991
8 Structural average case complexity (context) - Schuler, Yamakami - 1992
5 Machine Intelligence (context) - Meltzer, Michie - 1972
5 Machine Intelligence (context) - Meltzer, Michie - 1971
5 upper bound on the complexity of Presburger arithmetic (context) - Oppen - 1975
4 Computer Science Department (context) - Policriti, of - 1987
4 The Calculus of Constructions: Documentation and user's guid.. (context) - Huet - 1989
4 Precise average case complexity (context) - Reischuk, Schindelhauer - 1993
3 Technical Report Courant Computer Science Report (context) - Davis, Schwartz et al. - 1977
3 Technical Report Courant Computer Science Report (context) - Schwartz, technology - 1977
3 A Transformational Approach to the Development and Verificat.. (context) - Deak - 1980
3 Department of Computer Science (context) - Snyder, SETL et al. - 1990
3 Le Chesnay Cedex (context) - Huet, engine et al. - 1988
2 Sur l'analogie entre les propositions et les types (context) - Coquand, analogy et al. - 1986
2 A program for Presburger's algorithm (context) - Davis - 1957
2 The SETL2 programming language: Update on current developmen.. (context) - Snyder - 1990
2 Courant Institute of Mathematical Sciences Report No (context) - Goldberg, complexity et al. - 1979
2 Decision algorithms for some fragments of anaysis and relate.. (context) - Cantone, Ferro et al. - 1987
2 Derivation of a related group of searching praas (context) - Deak - 1977
1 the SUP-INF method for proving Presbuger formulas (context) - Shostak - 1977
1 the satisfiability problem for the ground case of first orde.. (context) - Policriti, Tetali - 1992
1 Technical Report Technical Survey No (context) - Schwartz, technology - 1978
1 Gedanken: A tool for pondering the tractability of correct p.. - Ericson - 1994
1 Average case intractability of matrix and Diophantine proble.. (context) - Venkatesan, Rajagopalan - 1992
Documents on the same site (http://ftp.gwdg.de/pub/languages/nyu.edu/tech-reports/reports.html): More
Closed Hashing is Computable and Optimally Randomizable with.. - Siegel, Schmidt (Correct)
Preconditioners for Indefinite Problems - Klawonn (1995) (Correct)
On the Singular Limit of the Quantum-Classical Molecular.. - Bornemann, Schütte (1996) (Correct)
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