Selman, B., Levesque, H., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pp. 440--446 San Jose, California. AAAI Press. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Knowledge Compilation and Theory Approximation - Selman, Kautz (1996) (56 citations) Self-citation (Selman) (Correct)
No context found.
B. Selman, Levesque H.J., and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of AAAI-92, pages 440--446, San Jose, CA, 1992. 45
Journal of Artificial Intelligence Research 15 (2001).. - Jose Luis Ambite (Correct)
No context found.
Selman, B., Levesque, H., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pp. 440--446 San Jose, California. AAAI Press.
A Nitpick Analysis of Mobile IPv6 - Jackson, Ng, Wing (1999) (4 citations) (Correct)
No context found.
Selman, B., Levesque, H. and Mitchell, D.: A new method for solving hard satisfiability problems. Proc. 10th National Conference on Artificial Intelligence (AAAI-92), San Jose, CA, July 1992.
Backbone Guided Dynamic Local Search for Propositional.. - Ferreira Jr. (Correct)
No context found.
Selman, B., Levesque, H.J., Mitchell, D.: A new method for solving hard satisfiability problems. In Rosenbloom, P., Szolovits, P., eds.: Proceedings of the 10th National Conference on Artificial Intelligence (AAAI'92), Menlo Park, California, AAAI Press/The MIT Press (1992) 440--446
Evolving Algorithms for Constraint Satisfaction - Bain, Thornton, Sattar (2004) (Correct)
No context found.
Bart Selman, Hector J. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Paul Rosenbloom and Peter Szolovits, editors, AAAI'92, pages 440--446, Menlo Park, California, 1992. AAAI Press.
Stochastic Local Search for Distributed Constraint.. - Miguel Salido Federico (Correct)
No context found.
Bart Selman, Hector Levesque, and David Mitchell. A New Method for Solving Hard Satisfiability Problems. Proceedings of the Tenth National Conference on Artificial Intelligence, 440--446, 1992.
Computational Forensic Techniques for Intellectual.. - Wong, Kirovski.. (2003) (Correct)
No context found.
B. Selman, H.J. Levesque, and D.Mitc hell. A New Method for Solving Hard Satisfiability Problems. NationalConferenc onArtific;W Intelligencb 1992.
Integration of a Refinement Solver and a Local-Search Server - Nareyek, Smith, Ohler (Correct)
No context found.
Selman, B.; Levesque, H.; and Mitchell, D. A New Method for Solving Hard Satisfiability Problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), 440--446, 1992.
Conflict-directed A* and Its Role in Model-based Embedded.. - Williams, Ragno (Correct)
No context found.
B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of AAAI-92, 1992, pp. 440--446.
Using Neural Network to Weight the Partial - Rules Application To (Correct)
No context found.
Selman, B., Levesque, H.J., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Proc. 10th National Conference on Artificial Intelligence, AAAI Press (1992) 440--446
Improving Multiclass ILP by Combining Partial - Rules With Winnow (2004) (Correct)
No context found.
Selman, B., Levesque, H.J., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Proc. 10th National Conference on Artificial Intelligence, AAAI Press (1992) 440--446
Phase Transitions and Stochastic Local Search in k-Term.. - Rückert, Kramer, De Raedt (Correct)
No context found.
Selman, B., and Kautz, H. A. (1992) A new method for solving hard satisfiability problems. Proceedings of the 10th National Conference on Artificial Intelligence, San Jose, CA, 440-446
Using Mini-Bucket Heuristics for Max-CSP - Kask, Dechter (2000) (Correct)
No context found.
B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. National Conference on Artificial Intelligence (AAAI-92), 1992.
Conflict-directed A* and Its Role in Model-based Embedded.. - Williams, Ragno (2003) (Correct)
No context found.
B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of AAAI-92, 1992, pp. 440--446.
Physical Systems for the Solution of Hard Computational Problems - Mattsson (2003) (Correct)
No context found.
Selman B, Levesque HJ and Mitchell DG, A new method for solving hard satisfiability problems , Proc. AAAI-92, San Jose, CA 440--446 (1992)
Emergence of Collective Intelligence in Stochastic Local.. - Thuillard (2003) (Correct)
No context found.
B. Selman, H. Levesque, and D. Mitchell, "A New Method for Solving Hard Satisfiability Problems,". Proc AAAI'92, MIT Press, 1992, pp. 440-446.
A Monte Carlo Study of Randomised Restarted Search in ILP - Zelezny, Srinivasan, Page (2004) (Correct)
No context found.
B. Selman, H. J. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Paul Rosenbloom and Peter Szolovits, editors, Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440--446, Menlo Park, California, 1992. AAAI Press.
Scaling and Probabilistic Smoothing: Efficient Dynamic.. - Hutter, Tompkins, Hoos (2002) (1 citation) (Correct)
No context found.
B. Selman, H. Levesque and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proc. AAAI-92, pp. 440--446, AAAI Press, 1992.
Maximum Satisfiability: How good are tabu search and.. - Mastrolilli, Gambardella (2004) (Correct)
No context found.
B. Selman, H. J. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In P. Rosenbloom and P. Szolovits, editors, Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440--446. AAAI Press, 1992.
Empirical and Analytic Approaches to Understanding Local Search.. - Carson (2001) (Correct)
No context found.
B. Selman, H. J. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceeding of the Tenth National Conference on Artificial Intelligence, 1992
Stochastic Local Search for Distributed Constraint.. - Miguel Salido Federico (Correct)
No context found.
Bart Selman, Hector Levesque, and David Mitchell. A New Method for Solving Hard Satisfiability Problems. Proceedings of the Tenth National Conference on Artificial Intelligence, 440--446, 1992.
Adaptive Multiresolution Search: How to Beat Brute Force? - Thuillard (Correct)
No context found.
B. Selman, D.G. Levesque, and A. Mitchell, A new method for solving hard satisfiability problems, Proc. AAAI-92, San Jose, CA, 1992, pp. 440-446.
Constraint-Based Agents - An Architecture For (Correct)
No context found.
Selman, B.; Levesque, H.; and Mitchell, D. 1992. A New Method for Solving Hard Satisfiability Problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), 440--446.
A Parallel Architecture for Solving Constraint.. - Mendes, Pereira, Neves (2001) (Correct)
No context found.
B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proceedings of AAAI92, 1992.
A Sharp Threshold in Proof Complexity Yields Lower.. - Achlioptas, Beame.. (2003) (Correct)
No context found.
B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings Tenth National Conference on Artificial Intelligence (AAAI-92), pages 440--446, 1992.
First 50 documents Next 50
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