Ari Kristinn Jónsson  Home/Search
Context
Related
| nasa.gov/people/jonsson/Pap...thesis.ps 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: nasa.gov/people/jonsson/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Constraint satisfaction is an important area of computer science, in particular for artificial intelligence. Many of the problems we want to solve by automated reasoning, can quite naturally be specified in the form of constraint satisfaction problems. Furthermore, constraint satisfaction plays an important role in other areas of artificial intelligence, as many AI techniques give rise to subproblems that involve finding assignments or instantiations that satisfy a set of constraints. (Update)
Active bibliography (related documents): More All
0.8: Dynamic Backtracking - Ginsberg, Crawford, Etherington (1996) (Correct)
0.5: Procedural Reasoning in Constraint Satisfaction - Jónsson, Ginsberg (1996) (Correct)
0.3: Synthesis of High-Performance Transportation Schedulers - Smith, Parra, Westfold (1995) (Correct)
Similar documents based on text: More All
1.2: Modeling Beliefs In Dynamic Systems - Friedman (1997) (Correct)
1.1: The Networked Information Economy: Applied And Theoretical.. - Ketchpel (1998) (Correct)
1.0: Wrappers For Performance Enhancement And Oblivious Decision Graphs - Kohavi (1995) (Correct)
BibTeX entry: (Update)
@misc{ nsson-procedural,
author = "Ari Kristinn Jónsson",
title = "Procedural Reasoning in Constraint Satisfaction",
url = "citeseer.ist.psu.edu/593181.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
473 Foundations of Constraint Satisfaction (context) - Tsang - 1993
459 A computing procedure for quantification theory (context) - Davis, Putman - 1960
340 Temporal constraint networks (context) - Dechter, Meiri et al. - 1991
278 Depth-first iterative deepening: An optimal admissible tree .. (context) - Korf - 1985
271 The Oz programming model - Smolka - 1995
266 Heuristics: Intelligent Search Strategies for Computer Probl.. (context) - Pearl - 1984
211 Enhancement schemes for constraint processing: Backjumping (context) - Dechter - 1990
155 Forward reasoning and dependency -directed backtracking in a.. (context) - Stallman, Sussman - 1977
145 Planning as satisfiability - Kautz, Selman - 1992
135 Solving large-scale constraint satisfaction and scheduling p.. (context) - Minton, Johston et al. - 1990
134 Experimental results on the crossover point in satisfiabilit.. - Crawford, Auton - 1993
112 Performance measurement and analysis of certain search algor.. (context) - Gaschnig - 1979
103 Local search strategies for satisfiability testing - Selman, Kautz et al. - 1993
93 Journal of Artificial Intelligence Research (context) - Ginsberg - 1993
91 Artificial Intelligence (context) - Ginsberg - 1995
78 Look-ahead techniques for micro-opportunistic job shop sched.. - Sadeh - 1992
60 Gsat and dynamic backtracking - Ginsberg, McAllester - 1994
54 Symmetry breaking predicates for search problems - Crawford, Ginsberg et al. - 1996
54 Systematic and nonsystematic search strategies (context) - Langley - 1992
50 Slack-based heuristics for constraint satisfaction schedulin.. (context) - Smith, Cheng - 1993
48 Experimental results on the application of satisfiability al.. - Crawford, Baker - 1994
46 A complexity analysis of spacebounded learning algorithms fo.. - Jr, Miranker - 1996
40 Pushing the envelope: Planning (context) - Kautz, Selman - 1996
37 Backtrack-free and backtrack-bounded search (context) - Freuder - 1988
30 Passive and active decision postponement in plan generation - Joslin, Pollack - 1995
30 Domain filtering can degrade intelligent backtracking search (context) - Prosser - 1993
25 Improved limited discrepancy search - Korf - 1996
20 Nonsystematic Backtracking Search - Harvey - 1995
11 The application of theorem proving to question answering sys.. (context) - Green - 1969
9 Reasoning with constraints within O-Plan - Tate, Drabble et al. - 1994
9 Introduction to Operations Research (context) - Hillier, Lieberman - 1986
8 A new algorithm for generative planning - Ginsberg - 1996
8 Hybrid reasoning using universal attachment (context) - Myers - 1994
4 Logic programs with external procedures - Maluszynski, Bonnier et al. - 1993
4 Planning as refinement search: a unified framework for evalu.. (context) - Kambhampati, Knoblock et al. - 1995
3 Synthesis of constraint algorithms - Smith, Westfold - 1995
1 A disjunctive decomposition conrtrol schema for constraint s.. (context) - Freuder, Hubbe - 1995
1 Integrating Specialized Procedures into Proof Systems (context) - Sikka - 1997
1 Ginsberg and William D (context) - Mathhew - 1992
1 Structure and desgin of global search algorithms (context) - Smith - 1987
1 Noise strategies for local search for satisfiability testing (context) - Selman, Kautz et al. - 1994
Documents on the same site (http://ic.arc.nasa.gov/people/jonsson/index.html): More
Cyclic Scheduling - Draper, Jonsson, Clements, Joslin (Correct)
Next Generation Remote Agent Planner - Jónsson, Morris, al. (1999) (Correct)
Run-Time Satellite Tele-Communications Call Handling.. - Plaunt.. (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