Bart Selman, Henry Kautz, David McAllester  Home/Search
Context Related
| att.com/~kautz/papersft...challenge.ps cornell.edu/home/s...ijcai.challenge.ps ii.uam.es/~delval/ps2/challenge.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: att.com/~kautz/papersftp...index (more) From: cornell.edu/home/selman/...papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The past several years have seen much progress in the area of propositional reasoning and satisfiability testing. There is a growing consensus by researchers on the key technical challenges that need to be addressed in order to maintain this momentum. This paper outlines concrete technical challenges in the core areas of systematic search, stochastic search, problem encodings, and criteria for evaluating progress in this area. 1 Introduction Propositional reasoning is a core problem in many... (Update)
Similar documents based on text: More All
0.4: Frugal Propositional Encodings for Planning - Mali, Kambhampati (Correct)
0.4: Hardening Soft Information Sources - Cohen, Kautz, McAllester (2000) (Correct)
0.4: Encoding Plans in Propositional Logic - Kautz, McAllester, Selman (1996) (Correct)
BibTeX entry: (Update)
B. Selman, H. Kautz and D. McAllester, `Ten Challenges in Propositional Reasoning and Search', in Proc. of the 16 th IJCAI, pp. 50--54, Nagoya, Japan, (1997). http://citeseer.ist.psu.edu/selman97ten.html More
@inproceedings{ selman97ten,
author = "Bart Selman and Henry A. Kautz and David A. McAllester",
title = "Ten Challenges in Propositional Reasoning and Search",
booktitle = "Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence ({IJCAI}'97)",
pages = "50--54",
year = "1997",
url = "citeseer.ist.psu.edu/selman97ten.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1993
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960
416 A new method for solving hard satisfiability problems - Selman, Levesque et al. - 1992
376 Fast planning through planning graph analysis - Blum, Furst - 1995
320 Hard and easy distributions of SAT problems - Mitchell, Selman et al. - 1992
272 Pushing the envelope: planning - Kautz, Selman - 1996
145 Planning as Satisfiability - Kautz, Selman - 1992
123 A model-based approach to reactive self-configuring systems - Williams, Nayak - 1996
52 The intractability of resolution (context) - Haken - 1985
39 Finding Hard Instances of the Satisfiability Problem: A Surv.. - Cook, Mitchell - 1993
32 Noise Strategies for Local Search (context) - Selman, Kautz et al. - 1994
31 cutting plane solution of inference problems: Some computati.. (context) - Hooker, Hooker - 1988
20 Efficient generation of test patterns using Boolean satisfia.. - Larrabee - 1992
7 Boosting complete techniques thanks to local search methods (context) - Mazure, Sais et al. - 1996
1 DIMACS Series in Discrete Mathematics and Theoretical Comput.. (context) - San, CA et al. - 1996
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://akpublic.research.att.com/~kautz/papers-ftp/index.html): More
Knowledge Compilation Using Horn Approximations - Selman, Kautz (1991) (Correct)
An Experiment in the Design of Software Agents - Kautz, Selman, Coen.. (1994) (Correct)
Creating Models of Real-World Communities with ReferralWeb - Kautz, Selman (1998) (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