James L. Caldwell, Ian P. Gent, Judith Underwood  Home/Search
Context Related
| uwyo.edu/~jlc/papers/TCS_search.ps uwyo.edu/~jlc/papers/TCS_search.ps dcs.stand.ac.uk/~...search_paper.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: uwyo.edu/~jlc/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we take an abstract view of search by describing search procedures via particular kinds of proofs in type theory. We rely on the proofs-as-programs interpretation to extract programs from our proofs. Using these techniques we explore, in depth, a large family of search problems by parameterizing the specification of the problem. A constructive proof is presented which has as its computational content a correct search procedure for these problems. We show how a classical extension ... (Update)
Context of citations to this paper: More
...this algorithm is notoriously difficult to understand or prove correct. While we have relied on the analysis of Caldwell, et al. [4] for our understanding of conflict sets, we are unaware of any description of the algorithm as a form of labeling. While search bjbt behaves...
.... use of conflict sets is very common in the literature, a precise definition is difficult to achieve; we base ours on that of Caldwell, et al. 1997). If a conflict set exists for a state, then evidently no extension of that state can be a solution. Note that a conflict set...
Cited by: More
Naïve Type Theory - Constable (2002) (Correct)
Extracting Recursion Operators in Nuprl's Type Theory - Caldwell (2001) (Correct)
Modular Lazy Search for Constraint Satisfaction Problems - Nordin, Tolmach (2001) (Correct)
Similar documents (at the sentence level):
71.0%: Search Algorithms in Type Theory - Caldwell, Gent, Underwood (1997) (Correct)
Active bibliography (related documents): More All
0.7: The Logic of Search Algorithms: Theory and Applications - Gent, Underwood (1997) (Correct)
0.5: Classical Tools for Constructive Proof Search - Caldwell, Underwood (1996) (Correct)
0.5: Intuitionisitic Tableau Extracted - Caldwell (Correct)
Similar documents based on text: More All
0.2: Solution Learning and Solution Directed Backjumping, Revisited - Gent, Rowley (2004) (Correct)
0.2: Decidability Extracted: Synthesizing ``Correct-by-Construction'' .. - Caldwell (1998) (Correct)
0.2: Automatic Generation of a Navigation Structure for Adaptive.. - Masthoff (2002) (Correct)
Related documents from co-citation: More All
3: Moving proofs-as-programs into practice - Caldwell - 1997
3: A Non-Type-Theoretic Semantics for Type-Theoretic Language (context) - Allen - 1987
3: Type Theory and Functional Programming (context) - Thompson - 1991
BibTeX entry: (Update)
J. L. Caldwell, I. P. Gent, and J. Underwood. Search algorithms in type theory. In Submitted to: Theoretical Computer Science: Special Issue on Proof Search in Type-theoretic Languages, September 1997. http://citeseer.ist.psu.edu/caldwell98search.html More
@article{ caldwell00search,
author = "James L. Caldwell and Ian P. Gent and Judith Underwood",
title = "Search algorithms in type theory",
journal = "Theoretical Computer Science",
volume = "232",
number = "1--2",
pages = "55--90",
year = "2000",
url = "citeseer.ist.psu.edu/caldwell98search.html" }
Citations (may not include all citations):4212 Computers and intractability : a guide to the theory of NP-c.. (context) - Garey, Johnson - 1979
329 Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
266 Information and Computation (context) - Coquand, Huet et al. - 1988
265 Increasing tree search efficiency for constraint satisfactio.. (context) - Haralick, Elliott - 1980
254 The revised 4 report on the algorithmic language scheme - Clinger, Rees - 1991
235 First Order Logic (context) - Smullyan - 1968
211 Hybrid algorithms for the constraint satisfaction problem (context) - Prosser - 1993
190 Using CSP look-back techniques to solve real-world SAT insta.. - Jr, Schrag - 1997
141 Constructive mathematics and computer programming (context) - Martin-Lof - 1982
134 calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
119 Contradicting conventional wisdom in constraint satisfaction - Sabin, Freuder - 1994
112 Performance measurement and analysis of certain search algor.. (context) - Gaschnig - 1979
93 Journal of Artificial Intelligence Research (context) - Ginsberg - 1993
87 A theoretical evaluation of selected backtracking algorithms - Kondrak, van Beek - 1997
86 Implementing Mathematics with The Nuprl Development System (context) - Constable, Allen et al. - 1986
84 Computation and Reasoning: A Type Theory for Computer Scienc.. (context) - Luo - 1994
66 Abstracting control - Danvy, Filinski - 1990
60 Extracting Constructive Content from Classical Proofs (context) - Murthy - 1990
47 Sparse constraint graphs and exceptionally hard problems - Smith, Grant - 1995
46 Paradigms of Artificial Intelligence Programming: Case Studi.. (context) - Norvig - 1992
41 An evaluation semantics for classical proofs (context) - Murthy - 1991
41 Using CSP look-back techniques to solve exceptionally hard S.. - Jr, Schrag - 1996
36 Intelligent backtracking on constraint satisfaction problems.. - Baker - 1995
35 Typing first-class continuations in ML - Harper, Duba et al. - 1993
24 Program extraction from classical proofs (context) - Berger, Schwichtenberg - 1994
19 The phase transition behaviour of maintaining arc consistenc.. - Grant, Smith - 1996
19 Implementing metamathematics as an approach to automatic the.. (context) - Constable, Howe - 1990
18 Programming with continuations (context) - Friedman, Haynes et al. - 1984
13 A symmetric lambda calculus for classical program extraction (context) - Barbanera, Berardi - 1996
13 Moving proofs-as-programs into practice - Caldwell - 1997
12 Reasoning about functional programs in Nuprl - Howe - 1993
11 A formulas-as-types notion of control (context) - Griffin - 1990
9 Distributed Asynchronous Scheduling (context) - Prosser - 1990
8 Applications of constraint programming (context) - Puget - 1995
7 The logic of search algorithms: Theory and applications - Gent, Underwood - 1997
6 An enumerative algorithm for finding Hamiltonian circuits in.. (context) - Martello - 1983
6 Witness extraction in classical logic through normalization (context) - Barbanera, Berardi - 1993
5 Itas: A portable interactive transportation scheduling tool .. - Burstein, Smith - 1996
5 The tableau algorithm for intuitionistic propositional calcu.. (context) - Underwood - 1993
4 Synthesis of planning and scheduling software - Smith, Parra et al. - 1996
4 Classical propositional decidability via Nuprl proof extract.. - Caldwell - 1998
3 Manuscript available at http://www (context) - Jackson, proof et al. - 1995
3 Continuations and concurrency (context) - Dybvig, Hieb - 1990
3 Available as report ECS-LFCS (context) - Pollack, of et al. - 1995
3 A high-level derivation of global search algorithms - Pepper, Smith - 1996
1 Decidability Extracted: extracting tableau procedures for cl.. (context) - Caldwell - 1998
1 Also Department of Computer Science technical report TR (context) - Underwood, the et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://meru.cs.uwyo.edu/~jlc/papers.html): More
Hierarchical Approach to Specification and Verification of.. - II, Butler, Di Vito (1990) (Correct)
Classical Tools for Constructive Proof Search - Caldwell, Underwood (1996) (Correct)
Intuitionisitic Tableau Extracted - Caldwell (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