-
1
-
-
0030415775
-
Calculating criticalities
-
R. Sebastiani, A. Bundy, F. Giunchiglia and T. Walsh. Calculating criticalities. Artificial Intelligence, 88(1-2):39-67, 1996.
-
(1996)
Artificial Intelligence
, vol.88
, Issue.1-2
, pp. 39-67
-
-
Sebastiani, R.1
Bundy, A.2
Giunchiglia, F.3
Walsh, T.4
-
2
-
-
77953825821
-
DPPlan: An algorithm for fast solution extraction from a planning graph
-
M. Baioletti, S. Marcugini, and A. Milani. DPPlan: An algorithm for fast solution extraction from a planning graph. In Proc. AIPS’00, 2000.
-
(2000)
Proc. AIPS’00
-
-
Baioletti, M.1
Marcugini, S.2
Milani, A.3
-
3
-
-
0028430255
-
Partial order planning: Evaluating possible efficiency gains
-
A. Barrett and D. Weld. Partial order planning: Evaluating possible efficiency gains. Artificial Intelligence, 67:71-112, 1994.
-
(1994)
Artificial Intelligence
, vol.67
, pp. 71-112
-
-
Barrett, A.1
Weld, D.2
-
5
-
-
0031074857
-
Fast planning through planning graph analysis
-
A. Blum and M. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2):279-298, 1997.
-
(1997)
Artificial Intelligence
, vol.90
, Issue.1-2
, pp. 279-298
-
-
Blum, A.1
Furst, M.2
-
6
-
-
0035369022
-
Planning as heuristic search
-
B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001.
-
(2001)
Artificial Intelligence
, vol.129
, Issue.1-2
, pp. 5-33
-
-
Bonet, B.1
Geffner, H.2
-
7
-
-
0035178618
-
On the relative complexity of resolution refinements and cutting planes proof systems
-
M. Bonet, J. Esteban, N. Galesi, and J. Johansen. On the relative complexity of resolution refinements and cutting planes proof systems. SIAM Journal of Computing, 30(5):1462-1484, 2001.
-
(2001)
SIAM Journal of Computing
, vol.30
, Issue.5
, pp. 1462-1484
-
-
Bonet, M.1
Esteban, J.2
Galesi, N.3
Johansen, J.4
-
8
-
-
84957616496
-
Resolution and the weak pigeon-hole principle
-
S. Buss and T. Pitassi. Resolution and the weak pigeon-hole principle. In Proc. CSL’97, pages 149-156, 1997.
-
(1997)
Proc. CSL’97
, pp. 149-156
-
-
Buss, S.1
Pitassi, T.2
-
9
-
-
0028498153
-
The computational complexity of propositional STRIPS planning
-
Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
-
(1994)
Artificial Intelligence
, vol.69
, Issue.1-2
, pp. 165-204
-
-
Bylander, T.1
-
11
-
-
33750361538
-
Beyond hypertree width: Decomposition methods without decompositions
-
H. Chen and V. Dalmau. Beyond hypertree width: Decomposition methods without decompositions. In Proc. CP’05, 2005.
-
(2005)
Proc. CP’05
-
-
Chen, H.1
Dalmau, V.2
-
12
-
-
85029411632
-
Searching for backbones and fat: A limit-crossing approach with applications
-
S. Climer and W. Zhang. Searching for backbones and fat: A limit-crossing approach with applications. In Proc. AAAI-02, 2002.
-
(2002)
Proc. AAAI-02
-
-
Climer, S.1
Zhang, W.2
-
13
-
-
0001601465
-
The relative efficiency of propositional proof systems
-
S. Cook and R. Reckhow. The relative efficiency of propositional proof systems. Journal of Symbolic Logic, 44:26-50, 1979.
-
(1979)
Journal of Symbolic Logic
, vol.44
, pp. 26-50
-
-
Cook, S.1
Reckhow, R.2
-
15
-
-
84881072062
-
A computing procedure for quantification theory
-
M. Davis and H. Putnam. A computing procedure for quantification theory. J. ACM, 7(3):201-215, 1960.
-
(1960)
J. ACM
, vol.7
, Issue.3
, pp. 201-215
-
-
Davis, M.1
Putnam, H.2
-
16
-
-
0025228149
-
Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition
-
R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence, 41(3):273-312, 1990.
-
(1990)
Artificial Intelligence
, vol.41
, Issue.3
, pp. 273-312
-
-
Dechter, R.1
-
18
-
-
0002812045
-
Planning with pattern databases
-
S. Edelkamp. Planning with pattern databases. In Proc. ECP’01, pages 13-24, 2001.
-
(2001)
Proc. ECP’01
, pp. 13-24
-
-
Edelkamp, S.1
-
19
-
-
33746044707
-
Effective preprocessing in SAT through variable and clause elimination
-
N. Een and A. Biere. Effective preprocessing in SAT through variable and clause elimination. In Proc. SAT-05, 2005.
-
(2005)
Proc. SAT-05
-
-
Een, N.1
Biere, A.2
-
21
-
-
2842560201
-
STRIPS: A new approach to the application of theorem proving to problem solving
-
R. Fikes and N. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208, 1971.
-
(1971)
Artificial Intelligence
, vol.2
, pp. 189-208
-
-
Fikes, R.1
Nilsson, N.2
-
23
-
-
0040377599
-
The SAT phase transition
-
I. Gent and T. Walsh. The SAT phase transition. In Proc. ECAI’94, pages 105-109, 1994.
-
(1994)
Proc. ECAI’94
, pp. 105-109
-
-
Gent, I.1
Walsh, T.2
-
25
-
-
0000076101
-
The intractability of resolution
-
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-308, 1985.
-
(1985)
Theoretical Computer Science
, vol.39
, pp. 297-308
-
-
Haken, A.1
-
26
-
-
33646193722
-
New admissible heuristics for domain-independent planning
-
P. Haslum, B. Bonet, and H. Geffner. New admissible heuristics for domain-independent planning. In Proc. AAAI’05, 2005.
-
(2005)
Proc. AAAI’05
-
-
Haslum, P.1
Bonet, B.2
Geffner, H.3
-
27
-
-
13444260042
-
A planning heuristic based on causal graph analysis
-
Malte Helmert. A planning heuristic based on causal graph analysis. In Proc. ICAPS’04, pages 161-170, 2004.
-
(2004)
Proc. ICAPS’04
, pp. 161-170
-
-
Helmert, M.1
-
29
-
-
33748987920
-
-
Journal of Artificial Intelligence Research, Submitted
-
J. Hoffmann, S. Edelkamp, S. Thiebaux, R. Englert, F. Liporace, and S. Trüg. Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4. Journal of Artificial Intelligence Research, 2006. Submitted.
-
(2006)
Engineering Benchmarks for Planning: The Domains Used in The Deterministic Part of IPC-4
-
-
Hoffmann, J.1
Edelkamp, S.2
Thiebaux, S.3
Englert, R.4
Liporace, F.5
Trüg, S.6
-
30
-
-
33646177692
-
Branching matters: Alternative branching in graphplan
-
J. Hoffmann and H. Geffner. Branching matters: Alternative branching in graphplan. In Proc. ICAPS’03, pages 22-31, 2003.
-
(2003)
Proc. ICAPS’03
, pp. 22-31
-
-
Hoffmann, J.1
Geffner, H.2
-
32
-
-
0036377352
-
The FF planning system: Fast plan generation through heuristic search
-
J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302, 2001.
-
(2001)
Journal of Artificial Intelligence Research
, vol.14
, pp. 253-302
-
-
Hoffmann, J.1
Nebel, B.2
-
34
-
-
31144454040
-
Where ‘ignoring delete lists’ works: Local search topology in planning benchmarks
-
Jörg Hoffmann. Where ‘ignoring delete lists’ works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research, 24:685-758, 2005.
-
(2005)
Journal of Artificial Intelligence Research
, vol.24
, pp. 685-758
-
-
Hoffmann, J.1
-
37
-
-
84880708762
-
Optimal refutations for constraint satisfaction problems
-
T. Hulubei and B. Sullivan. Optimal refutations for constraint satisfaction problems. In Proc. IJCAI05, 2005.
-
(2005)
Proc. IJCAI05
-
-
Hulubei, T.1
Sullivan, B.2
-
38
-
-
84958059041
-
Tree-like resolution is super-polynomially slower than DAG-like resolution for the pigeonhole principle
-
K. Iwama and S. Miyazaki. Tree-like resolution is super-polynomially slower than DAG-like resolution for the pigeonhole principle. In Proc. Algorithms and Computation, pages 133-142, 1999.
-
(1999)
Proc. Algorithms and Computation
, pp. 133-142
-
-
Iwama, K.1
Miyazaki, S.2
-
39
-
-
0002303187
-
Planning as satisfiability
-
H. Kautz and B. Selman. Planning as satisfiability. In Proc. ECAI’92, pages 359-363, 1992.
-
(1992)
Proc. ECAI’92
, pp. 359-363
-
-
Kautz, H.1
Selman, B.2
-
40
-
-
0030352389
-
Pushing the envelope: Planning, propositional logic, and stochastic search
-
H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. AAAI’96, pages 1194-1201, 1996.
-
(1996)
Proc. AAAI’96
, pp. 1194-1201
-
-
Kautz, H.1
Selman, B.2
-
41
-
-
84880681440
-
Unifying SAT-based and graph-based planning
-
H. Kautz and B. Selman. Unifying SAT-based and graph-based planning. In Proc. IJCAI’99, pages 318-325, 1999.
-
(1999)
Proc. IJCAI’99
, pp. 318-325
-
-
Kautz, H.1
Selman, B.2
-
43
-
-
0002435271
-
Elevator control as a planning problem
-
J. Koehler and K. Schuster. Elevator control as a planning problem. In Proc. AIPS’00, pages 331-338, 2000.
-
(2000)
Proc. AIPS’00
, pp. 331-338
-
-
Koehler, J.1
Schuster, K.2
-
44
-
-
9444231507
-
The 3rd international planning competition: Results and analysis
-
D. Long and M. Fox. The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research, 20:1-59, 2003.
-
(2003)
Journal of Artificial Intelligence Research
, vol.20
, pp. 1-59
-
-
Long, D.1
Fox, M.2
-
45
-
-
0034841985
-
Functional correlation analysis in crosstalk induced critical paths identification
-
M. Marek-Sadowska and T. Xiao. Functional correlation analysis in crosstalk induced critical paths identification. In Proc. DAC’01, pages 653-656, 2001.
-
(2001)
Proc. DAC’01
, pp. 653-656
-
-
Marek-Sadowska, M.1
Xiao, T.2
-
46
-
-
0034852165
-
Chaff: Engineering an efficient SAT solver
-
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. DAC’01, pages 530-535, 2001.
-
(2001)
Proc. DAC’01
, pp. 530-535
-
-
Moskewicz, M.1
Madigan, C.2
Zhao, Y.3
Zhang, L.4
Malik, S.5
-
47
-
-
33847303915
-
Understanding random SAT: Beyond the clauses-to-variable ratio
-
E. Nudelman, K. Leyton-Brown, H. Hoos, A. Devkar, and Y. Shoham. Understanding random SAT: beyond the clauses-to-variable ratio. In Proc. CP-04, pages 438-452, 2004.
-
(2004)
Proc. CP-04
, pp. 438-452
-
-
Nudelman, E.1
Leyton-Brown, K.2
Hoos, H.3
Devkar, A.4
Shoham, Y.5
-
48
-
-
2942730058
-
Resolution lower bounds for perfect matching principles
-
A. Razborov. Resolution lower bounds for perfect matching principles. J. Computer and Systems Sciences, 69(1):3-27, 2004.
-
(2004)
J. Computer and Systems Sciences
, vol.69
, Issue.1
, pp. 3-27
-
-
Razborov, A.1
-
49
-
-
0002906544
-
A planning algorithm not based on directional search
-
J. Rintanen. A planning algorithm not based on directional search. In Proceedings KR’98, pages 617-624, 1998.
-
(1998)
Proceedings KR’98
, pp. 617-624
-
-
Rintanen, J.1
-
50
-
-
13444281237
-
Phase transitions in classical planning: An experimental study
-
J. Rintanen. Phase transitions in classical planning: An experimental study. In Proc. ICAPS’04, pages 101-110, 2004.
-
(2004)
Proc. ICAPS’04
, pp. 101-110
-
-
Rintanen, J.1
-
51
-
-
0034140791
-
Resolution versus search: Two strategies for SAT
-
I. Rish and R. Dechter. Resolution versus search: Two strategies for SAT. Journal of Automated Rreasoning, 24(1/2):225-275, 2000.
-
(2000)
Journal of Automated Rreasoning
, vol.24
, Issue.1-2
, pp. 225-275
-
-
Rish, I.1
Dechter, R.2
-
52
-
-
29344446183
-
Symchaff: A structure-aware satisfiability solver
-
A. Sabharwal. Symchaff: A structure-aware satisfiability solver. In Proc. AAAI’05, pages 467-474, 2005.
-
(2005)
Proc. AAAI’05
-
-
Sabharwal, A.1
-
54
-
-
84880914510
-
Backbones in optimization and approximation
-
J. Slaney and T. Walsh. Backbones in optimization and approximation. In Proc. IJCAI01, 2001.
-
(2001)
Proc. IJCAI01
-
-
Slaney, J.1
Walsh, T.2
-
55
-
-
33746052341
-
Characterizing the distribution of low-makespan schedules in the job shop scheduling problem
-
M. Streeter and S. Smith. Characterizing the distribution of low-makespan schedules in the job shop scheduling problem. In Proc. ICAPS’05, pages 61-70, 2005.
-
(2005)
Proc. ICAPS’05
, pp. 61-70
-
-
Streeter, M.1
Smith, S.2
-
56
-
-
33746223651
-
Linkability: Examining causal link commitments in partial order planning
-
M. Veloso and J. Blythe. Linkability: Examining causal link commitments in partial order planning. In Proc. AIPS’94, pages 170-175, 1994.
-
(1994)
Proc. AIPS’94
, pp. 170-175
-
-
Veloso, M.1
Blythe, J.2
-
57
-
-
31144452769
-
Subgoal partitioning and global search for solving temporal planning problems in mixed space
-
Benjamin Wah and Yixin Chen. Subgoal partitioning and global search for solving temporal planning problems in mixed space. International Journal of Artificial Intelligence Tools, 13(4):767-790, 2004.
-
(2004)
International Journal of Artificial Intelligence Tools
, vol.13
, Issue.4
, pp. 767-790
-
-
Wah, B.1
Chen, Y.2
-
58
-
-
3543101895
-
Contrasting structured and random permutation flow-shop scheduling problems: Search space topology and algorithm performance
-
J. Watson, L. Barbulescu, L. Whitley, and A. Howe. Contrasting structured and random permutation flow-shop scheduling problems: Search space topology and algorithm performance. INFORMS Journal on Computing, 14(2):98-123, 2002.
-
(2002)
INFORMS Journal on Computing
, vol.14
, Issue.2
, pp. 98-123
-
-
Watson, J.1
Barbulescu, L.2
Whitley, L.3
Howe, A.4
-
59
-
-
85029451169
-
Toward a descriptive model of local search cost in job-shop scheduling
-
J. Watson, J. Beck, L. Barbulescu, and L. Whitley. Toward a descriptive model of local search cost in job-shop scheduling. In Proc. ECP’01, 2001.
-
(2001)
Proc. ECP’01
-
-
Watson, J.1
Beck, J.2
Barbulescu, L.3
Whitley, L.4
-
60
-
-
0037302910
-
Problem difficulty for tabu search in job-shop scheduling
-
J. Watson, J. Beck, A. Howe, and D. Whitley. Problem difficulty for tabu search in job-shop scheduling. Artificial Intelligence, 143(2):189-217, 2003.
-
(2003)
Artificial Intelligence
, vol.143
, Issue.2
, pp. 189-217
-
-
Watson, J.1
Beck, J.2
Howe, A.3
Whitley, D.4
-
62
-
-
0024889867
-
Efficient algorithms for extracting the k most critical paths in timing analysis
-
S. Yen, D. du, and S. Ghanta. Efficient algorithms for extracting the k most critical paths in timing analysis. In Proc. DAC’89, pages 649-654, 1989.
-
(1989)
Proc. DAC’89
, pp. 649-654
-
-
Yen, S.1
Du, D.2
Ghanta, S.3
|