(Enter summary)
Abstract: sentations (McCarthy and Hayes 1969)
should go hand-in-hand with the study of practical
reasoning algorithms, rather than being carried out
as a separate activity.)
ffl The use of powerful new general reasoning algorithms
such as Walksat (Selman, Kautz, and Cohen
1994). Many researchers in different areas of computer
science are creating faster SAT engines every
year. Furthermore, these researchers have settled on
common representations that allow algorithms and
code to be freely shared and... (Update)
Cited by: More
On the Hybrid Propositional Encodings of Planning - Mali (1999)
(Correct)
A Case for Goal-oriented Programming Semantics - Umar Saif Hubert (2003)
(Correct)
Using Temporal Logics to Express Search Control Knowledge.. - Bacchus, Kabanza (1999)
(Correct)
Similar documents (at the sentence level):
56.2%: Unifying STRIPS and SAT with BLACKBOX - Kautz, Selman
(Correct)
35.4%: Unifying SAT-based and Graph-based Planning - Kautz, Selman (1999)
(Correct)
Active bibliography (related documents): More All
0.5: Constraint Based Planning by Stochastic Search - Scholz, Stützle, Thielscher
(Correct)
0.2: Boundary Region Relations - Remolina, Kuipers (1998)
(Correct)
0.0: Exploiting Variable Dependency in Local Search - Kautz, McAllester, Selman (1997)
(Correct)
Similar documents based on text: More All
0.3: A Bayesian Approach to Tackling Hard Computational Problems - Horvitz, Ruan, Gomes (2001)
(Correct)
0.2: When to Test Less - Menzies, Cukic (2000)
(Correct)
0.2: Control Knowledge in Planning: Benefits and Tradeoffs - Huang, Selman, Kautz (1999)
(Correct)
Related documents from co-citation: More All
40: Fast planning through planning graph analysis
- Blum, Furst - 1995
25: Pushing the envelope: Planning (context) - Kautz, Selman - 1996
23: Extending Planning Graphs to an Adl Subset
- Koehler, Nebel et al. - 1997
BibTeX entry: (Update)
Kautz, H., and Selman, B. 1998. BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving. Workshop Planning as Combinatorial Search, AIPS-98, Pittsburgh, PA, 1998. http://citeseer.ist.psu.edu/kautz98blackbox.html More
@misc{ kautz98blackbox,
author = "H. Kautz and B. Selman",
title = "BLACKBOX: A New Approach to the Application of Theorem Proving to Problem
Solving",
text = "Kautz, H., and Selman, B. 1998. BLACKBOX: A New Approach to the Application
of Theorem Proving to Problem Solving. Workshop Planning as Combinatorial
Search, AIPS-98, Pittsburgh, PA, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/kautz98blackbox.html" }
Citations (may not include all citations):
663
Some philosophical problems from the standpoint of artificia.. (context) - McCarthy, Hayes - 1969
451
Planning for conjunctive goals (context) - Chapman - 1985
376
Fast planning through planning graph analysis
- Blum, Furst - 1995
32
Noise Strategies for Local Search (context) - Selman, Kautz et al. - 1994
4
Pushing the envelope: planning (context) - ECAI-, Austria et al. - 1996
3
and Kautz (context) - Gomes, Selman - 1998
2
Heuristics based on unit propagation for satisfiability prob.. (context) - Search, Randomization et al. - 1997
2
STRIPS: A New Approach to the Application of Theorem Proving.. (context) - of, problems et al. - 1971
2
TR AI-TR (context) - TR, Ernst et al. - 1997
2
PDDL --- The Planning Domain Definition Language (context) - Intelligence, Michie et al. - 1998
1
Planning as Satisfiability (context) - Nagoya, Kautz et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://akpublic.research.att.com/~kautz/blackbox/index.html):
Using CSP Look-Back Techniques to Solve Real-World SAT Instances - Bayardo (1997)
(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