-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathliteratur.bib
18068 lines (16002 loc) · 610 KB
/
literatur.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
%%%%% Actual bibliography entries.
%
% Sorted by key.
%
% When adding new entries, please do not use tabs, but spaces
% instead. We have the following convention for keys:
% <authors>-<venue>
%
% For authors, if there are only two, we write out both names and
% connect them with -, if there are three or more, we abbreviate
% firstauthor-et-al.
%
% For books, venue is only the year of publication, for conference
% papers, this is the conference name together with the year, with
% no separator. For conference workshops, we append "ws" after the
% year, possibly together with an abbreviation. For arXiv, papers
% venue is arxiv not corr.
%
% Examples:
% pommerening-et-al-icaps2014 (conference paper)
% jonas-icaps2012wshsdip (often cited workshop with abbreviation)
% jonas-aaai2008wssearch (rarely cited workshop without abbreviation)
% jonas-nips2011ws (single workshop at the conference)
% russell-norvig-2003 (book)
%
% Please also follow the form of (most) of the existing entries,
% which is:
%
% <Type>{<key>,
% author = "Authors",
% title = "Title",
% crossref = "<key-from-crossref.bib-or-crossref-short.bib>"
% etc.
% }
%
% Especially note that the keyword and "=" are separated by exactly one
% space, followed by as many spaces as required so that the actual
% entries start in column 18 (assuming counting based on index 1).
%
% Leave one empty line between two entries.
%
% Please add your name in brackets to any todo items you insert. For example:
%
% TODO(John): add pages.
%
@Misc{abadi-et-al-misc2015,
author = "Mart{\'i}n Abadi and Ashish Agarwal and Paul Barham
and Eugene Brevdo and Zhifeng Chen and Craig Citro
and Greg S. Corrado and Andy Davis and Jeffrey Dean
and Matthieu Devin and Sanjay Ghemawat and Ian
Goodfellow and Andrew Harp and Geoffrey Irving and
Michael Isard and Yangqing Jia and Rafal Jozefowicz
and Lukasz Kaiser and Manjunath Kudlur and Josh
Levenberg and Dan Man{\'e} and Rajat Monga and Sherry
Moore and Derek Murray and Chris Olah and Mike
Schuster and Jonathon Shlens and Benoit Steiner and
Ilya Sutskever and Kunal Talwar and Paul Tucker and
Vincent Vanhoucke and Vijay Vasudevan and Fern and a
Vi{\'e}gas and Oriol Vinyals and Pete Warden and
Martin Wattenberg and Martin Wicke and Yuan Yu and
Xiaoqiang Zheng",
title = "{TensorFlow}: Large-Scale Machine Learning on Heterogeneous Systems",
url = "https://tensorflow.org/",
howpublished = "\url{https://tensorflow.org/}",
year = "2015"
}
@InProceedings{abdulaziz-et-al-icaps2017,
author = "Mohammad Abdulaziz and Charles Gretton and Michael Norrish",
title = "A State-Space Acyclicity Property for Exponentially
Tighter Plan Length Bounds",
crossref = "icaps2017",
pages = "2--10"
}
@InProceedings{abdulaziz-et-al-icaps2022wshsdip,
author = "Mohammad Abdulaziz and Florian Pommerening and Augusto B. Corr{\^e}a",
title = "Mechanically Proving Guarantees of Generalized Heuristics: First Results and Ongoing Work",
crossref = "icaps2022wshsdip"
}
@InProceedings{abdulaziz-et-al-ijcai2015,
author = "Mohammad Abdulaziz and Michael Norrish and Charles Gretton",
title = "Exploiting Symmetries by Planning for a Descriptive Quotient",
crossref = "ijcai2015",
pages = "1479--1486"
}
@InProceedings{abdulaziz-et-al-ijcai2022wsgenplan,
author = "Mohammad Abdulaziz and Florian Pommerening and Augusto B. Corr{\^e}a",
title = "Mechanically Proving Guarantees of Generalized Heuristics: First Results and Ongoing Work",
crossref = "ijcai2022wsgenplan"
}
@InProceedings{abdulaziz-et-al-itp2015,
author = "Mohammad Abdulaziz and Charles Gretton and Michael Norrish",
title = "Verified Over-Approximation of the Diameter of
Propositionally Factored Transition Systems",
booktitle = "Proceedings of the 6th International Conference on
Interactive Theorem Proving ({ITP} 2015)",
pages = "1--16",
year = "2015"
}
@InProceedings{abdulaziz-kurz-aaai2023,
author = "Mohammad Abdulaziz and Friedrich Kurz",
title = "Formally Verified {SAT}-Based {AI} Planning",
crossref = "aaai2023",
pages = "15073--15081"
}
@Book{abiteboul-et-al-1995,
author = "Serge Abiteboul and Richard Hull and Victor Vianu",
title = "Foundations of Databases",
publisher = "Addison-Wesley",
year = "1995",
}
@InProceedings{achlioptas-et-al-aaai2000,
author = "Dimitris Achlioptas and Carla P. Gomes and Henry A. Kautz and Bart Selman",
title = "Generating Satisfiable Problem Instances",
crossref = "aaai2000",
pages = "256--261"
}
@Article{adriaensen-et-al-jair2022,
author = "Steven Adriaensen and Andr{\'e} Biedenkapp and Gresa Shala and Noor Awad
and Theresa Eimer and Marius Lindauer and Frank Hutter",
title = "Automated Dynamic Algorithm Configuration",
journal = jair,
year = "2022",
volume = "75",
pages = "1633--1699"
}
@InProceedings{aghighi-backstrom-ijcai2015,
author = "Meysam Aghighi and Christer B{\"a}ckstr{\"o}m",
title = "Cost-Optimal and Net-Benefit Planning - {A} Parameterised Complexity View",
crossref = "ijcai2015",
pages = "1487--1493"
}
@InProceedings{aghighi-et-al-aaai2015,
author = "Meysam Aghighi and Peter Jonsson and Simon St{\aa}hlberg",
title = "Tractable Cost-Optimal Planning Over Restricted Polytree Causal Graphs",
crossref = "aaai2015",
pages = "3225--3231"
}
@InProceedings{aghighi-jonsson-aaai2014,
author = "Meysam Aghighi and Peter Jonsson",
title = "Oversubscription planning: Complexity and compilability",
crossref = "aaai2014",
pages = "2221--2227"
}
@Article{agostinelli-et-al-nmi2019,
author = "Forest Agostinelli and Stephen McAleer and Alexander Shmakov
and Pierre Baldi",
title = "Solving the {Rubik}'s cube with deep reinforcement learning and search",
journal = nmi,
volume = "1",
pages = "356--363",
year = "2019",
doi = "10.1038/s42256-019-0070-z"
}
@Article{aineto-et-al-aij2019,
author = "Diego Aineto and Sergio {Jim{\'e}nez Celorrio} and Eva Onaindia",
title = "Learning action models with minimal observability",
journal = aij,
volume = "275",
pages = "104--137",
year = "2019"
}
@InProceedings{akagi-et-al-socs2010,
author = "Yuima Akagi and Akihiro Kishimoto and Alex Fukunaga",
title = "On Transposition Tables for Single-Agent Search
and Planning: Summary of Results",
crossref = "socs2010",
pages = "2--9"
}
% Data taken from DBLP.
@Article{akers-ieeecomp1978,
author = "Akers, Jr., Sheldon B.",
title = "Binary Decision Diagrams",
journal = ieeecomp,
volume = "27",
number = "6",
pages = "509--516",
year = "1978"
}
@InProceedings{akguen-et-al-cp2020wsmodref,
author = "{\"O}zg{\"u}r Akg{\"u}n and Nguyen Dang and Joan Espasa and Ian Miguel and Andr{\'a}s Salamon and Christopher Stone",
title = "Exploring Instance Generation for Automated Planning",
booktitle = "CP 2020 Workshop on Constraint Modelling and Reformulation",
year = "2020"
}
@InProceedings{alcazar-et-al-icaps2014,
author = "Vidal Alc{\'a}zar and Susana Fern{\'a}ndez
and Daniel Borrajo",
title = "Analyzing the Impact of Partial States on Duplicate
Detection and Collision of Frontiers",
crossref = "icaps2014",
pages = "350--354"
}
@InProceedings{alcazar-et-al-ijcai2013,
author = "Vidal Alc{\'a}zar and Daniel Borrajo
and Susana Fern{\'a}ndez and Raquel Fuentetaja",
title = "Revisiting Regression in Planning",
crossref = "ijcai2013",
pages = "2254--2260"
}
@InProceedings{alcazar-torralba-icaps2015,
author = "Vidal {Alc\'azar} and {\'A}lvaro Torralba",
title = "A Reminder about the Importance of Computing and
Exploiting Invariants in Planning",
crossref = "icaps2015",
pages = "2--6"
}
@InProceedings{aldinger-nebel-ki2017,
author = "Johannes Aldinger and Bernhard Nebel",
title = "Interval Based Relaxation Heuristics for Numeric Planning
with Action Costs",
crossref = "ki2017",
pages = "15--28"
}
@InProceedings{alford-et-al-icaps2015,
author = "Ron Alford and Pascal Bercher and David Aha",
title = "Tight Bounds for {HTN} Planning",
pages = "7--15",
crossref = "icaps2015"
}
@InProceedings{alford-et-al-icaps2016,
author = "Ron Alford and Gregor Behnke and Daniel H{\"o}ller
and Pascal Bercher and Susanne Biundo and David W. Aha",
title = "Bound to Plan: Exploiting Classical Heuristics via
Automatic Translations of Tail-Recursive {HTN} Problems",
crossref = "icaps2016",
pages = "20--28"
}
@InProceedings{alford-et-al-ijcai2009,
author = "Ron Alford and Ugur Kuter and Dana Nau",
title = "Translating {HTN}s to {PDDL}: A Small Amount of Domain
Knowledge Can Go a Long Way",
crossref = "ijcai2009",
pages = "1629--1634"
}
@Article{aljazzar-leue-aij2011,
author = "Husain Aljazzar and Stefan Leue",
title = "K*: A Heuristic Search Algorithm for Finding the K Shortest Paths",
journal = aij,
year = "2011",
volume = "175",
number = "18",
pages = "2129--2154",
}
@InProceedings{alkhazraji-et-al-ecai2012,
author = "Yusra Alkhazraji and Martin Wehrle and Robert
Mattm{\"u}ller and Malte Helmert",
title = "A Stubborn Set Algorithm for Optimal Planning",
pages = "891--892",
crossref = "ecai2012"
}
@InProceedings{alkhazraji-et-al-ipc2014,
author = "Yusra Alkhazraji and Michael Katz and Robert
Mattm{\"u}ller and Florian Pommerening and Alexander
Shleyfman and Martin Wehrle",
title = "Metis: Arming {Fast} {Downward} with Pruning and Incremental Computation",
pages = "88--92",
crossref = "ipc2014"
}
@Misc{alkhazraji-et-al-zenodo2020,
author = "Yusra Alkhazraji and Matthias Frorath and Markus Gr{\"u}tzner
and Malte Helmert and Thomas Liebetraut and Robert Mattm{\"u}ller
and Manuela Ortlieb and Jendrik Seipp and Tobias Springenberg and
Philip Stahl and Jan W{\"u}lfing",
title = "Pyperplan",
publisher = "Zenodo",
year = "2020",
howpublished = "\url{https://doi.org/10.5281/zenodo.3700819}"
}
@PhdThesis{alkhazraji-phd2017,
author = "Yusra Al-Khazraji",
title = "Analysis of Partial Order Reduction Techniques for Automated
Planning",
school = unifr,
year = "2017"
}
@InProceedings{alkhazraji-wehrle-socs2016,
author = "Yusra Alkhazraji and Martin Wehrle",
title = "Sleep Sets Meet Duplicate Elimination",
crossref = "socs2016",
pages = "2--9"
}
% Data verified.
% Not available.
@Book{allen-et-al-1990,
editor = "James Allen and James Hendler and Austin Tate",
title = "Readings in Planning",
publisher = "Morgan Kaufmann",
year = "1990"
}
% Use this to cite the whole book and use rap1991 as crossref.
@Book{allen-et-al-1991,
author = "James F. Allen and Henry A. Kautz and Richard N.
Pelavin and Josh D. Tenenberg",
title = "Reasoning About Plans",
publisher = "Morgan Kaufmann",
year = "1991",
}
@InProceedings{allen-et-al-ijcai2021,
author = "Cameron Allen and Michael Katz and Tim Klinger
and George Konidaris and Matthew Riemer and Gerald Tesauro",
title = "Efficient Black-{B}ox Planning Using Macro-{A}ctions with Focused Effects",
crossref = "ijcai2021",
pages = "4024--4031",
year = "2021"
}
@InProceedings{allesiardo-feraud-dsaa2015,
author = "Robin Allesiardo and Rapha{\"{e}}l F{\'{e}}raud",
title = "{EXP3} with drift detection for the switching bandit problem",
booktitle = "Proceedings of the 2015 {IEEE} International
Conference on Data Science and Advanced Analytics
({DSAA} 2015)",
pages = "1--7",
year = "2015"
}
@Book{altman-1999,
author = "Eitan Altman",
title = "Constrained Markov Decision Processes",
publisher = "Chapman \& Hall/CRC",
year = "1999"
}
% Data from IEEE website:
% - http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=871304
@Article{alur-et-al-ieee2000,
author = "Rajeev Alur and Thomas A. Henzinger and Gerardo
Lafferriere and George J. Pappas",
title = "Discrete Abstractions of Hybrid Systems",
journal = "Proceedings of the IEEE",
year = "2000",
volume = "88",
number = "7",
pages = "971--984"
}
% Data verified.
@InProceedings{amir-engelhardt-ijcai2003,
author = "Eyal Amir and Barbara Engelhardt",
title = "Factored Planning",
pages = "929--935",
crossref = "ijcai2003"
}
@InProceedings{ammar-bhiri-icsoft2021,
author = "Sabrine Ammar and Mohamed Tahar Bhiri",
title = "A Formal Approach Combining {Event-B} and {PDDL} for Planning Problems",
pages = "261--268",
year = "2021",
booktitle = "Proceedings of the 16th International Conference on Software Technologies (ICSOFT 2021)",
}
@InProceedings{anand-et-al-icaps2016,
author = "Ankit Anand and Ritesh Noothigattu and Mausam and Parag Singla",
title = "{OGA-UCT:} On-the-Go Abstractions in {UCT}",
crossref = "icaps2016",
pages = "29--37",
year = "2016"
}
@InProceedings{anand-et-al-ijcai2015,
author = "Ankit Anand and Aditya Grover and Mausam and Parag Singla",
title = "{ASAP-UCT:} Abstraction of State-Action Pairs in {UCT}",
pages = "1509--1515",
crossref = "ijcai2015"
}
% Data taken from DBLP.
@InProceedings{anderson-et-al-sara2007,
author = "Kenneth Anderson and Robert Holte and
Jonathan Schaeffer",
title = "Partial Pattern Databases",
pages = "20--34",
crossref = "sara2007"
}
@Article{anderson-feil-mm1998,
author = "Marlow Anderson and Todd Feil",
title = "Turning Lights Out with Linear Algebra",
journal = "Mathematics Magazine",
volume = "71",
number = "4",
year = "1998",
pages = "300--303"
}
% Data verified.
% DOI: 10.1109/FOCS.2004.32
@InProceedings{andrews-focs2004,
author = "Matthew Andrews",
title = "Hardness of Buy-at-Bulk Network Design",
booktitle = "Proceedings of the 45th Annual IEEE Symposium on
Foundations of Computer Science (FOCS 2004)",
pages = "115--124",
year = "2004"
}
% Data verified.
% DOI: 10.1109/INFCOM.2005.1497910
@InProceedings{andrews-zhang-infocom2005,
author = "Matthew Andrews and Lisa Zhang",
title = "Bounds on Fiber Minimization in Optical Networks
with Fixed Fiber Capacity",
booktitle = "Proceedings of the 24th Annual Joint Conference of
the IEEE Computer and Communications Societies
(INFOCOM 2005)",
editor = "Kia Makki and Edward W. Knightly",
pages = "409--419",
year = "2005"
}
% Data verified.
@Article{andrews-zhang-jcss2006,
author = "Matthew Andrews and Lisa Zhang",
title = "Minimizing Maximum Fiber Requirement in Optical Networks",
journal = "Journal of Computer and Systems Sciences",
year = "2006",
volume = "72",
pages = "118--131"
}
@InProceedings{ansotegui-et-al-cp2009,
author = "Carlos Ans{\'o}tegui and Meinolf Sellmann and Kevin Tierney",
title = "A Gender-Based Genetic Algorithm for the Automatic Configuration of Solvers",
crossref = "cp2009",
pages = "142--157"
}
@InCollection{apt-et-al-1988,
title = "Towards a Theory of Declarative Knowledge",
author = "Krzysztof R. Apt and Howard A. Blair and Adrian Walker",
booktitle = "Foundations of Deductive Databases and Logic Programming",
pages = "89--148",
year = "1988",
publisher = "Morgan Kaufmann"
}
@Article{archer-amm1999,
author = "Aaron F. Archer",
title = "A Modern Treatment of the 15 Puzzle",
journal = "American Mathematical Monthly",
year = "1999",
volume = "106",
number = "9",
pages = "793--799"
}
@InProceedings{areces-et-al-icaps2014,
author = "Carlos Areces and Facundo Bustos and Mart{\'i}n Ariel Dominguez and
J{\"o}rg Hoffmann",
title = "Optimizing Planning Domains by Automatic Action Schema Splitting",
crossref = "icaps2014",
pages = "11--19"
}
@Article{arfaee-et-al-aij2011,
author = "Shahab J. Arfaee and Sandra Zilles and Robert C. Holte",
title = "Learning Heuristic Functions for Large State Spaces",
journal = aij,
year = "2011",
volume = "175",
pages = "2075--2098",
}
@InProceedings{arfaee-et-al-ipc2011,
author = "Shahab Jabbari Arfaee and Robert C. Holte and Sandra Zilles",
title = "Bootstrap Planner: an Iterative Approach to Learn
Heuristic Functions for Planning Problems",
crossref = "ipc2011",
}
@InProceedings{arfaee-et-al-socs2010,
author = "Shahab J. Arfaee and Sandra Zilles and Robert C. Holte",
title = "Bootstrap Learning of Heuristic Functions",
crossref = "socs2010",
pages = "52--60",
}
@InProceedings{arlt-et-al-issta2014,
author = "Stephan Arlt and Andreas Podelski and Martin Wehrle",
title = "Reducing {GUI} Test Suites via Program Slicing",
crossref = "issta2014",
pages = "270--281",
}
@Article{arnborg-et-al-jadm1987,
author = "Stefan Arnborg and Derek G. Corneil and Andrzej Proskurowski",
title = "Complexity of Finding Embeddings in a k-Tree",
journal = "SIAM J. Algebraic Discrete Methods",
year = "1987",
volume = "8",
number = "2",
pages = "277--284",
}
@Book{arora-barak-2009,
author = "Sanjeev Arora and Boaz Barak",
title = "Computational Complexity: {A} Modern Approach",
publisher = "Cambridge University Press",
year = "2009"
}
@Article{arora-et-al-ker2018,
author = "Ankuj Arora and Humbert Fiorino and Damien Pellier and
Marc M{\'e}tivier and Sylvie Pesty",
title = "A review of learning planning action models",
journal = ker,
year = "2018",
volume = "33",
number = "e20",
pages = "1--25"
}
@Unpublished{arora-et-al-unpublished1992,
author = "Sanjeev Arora and Russell Impagliazzo and Umesh Vazirani",
title = "Relativizing versus Nonrelativizing Techniques: The Role of
Local Checkability",
note = "Manuscript, University of California, Berkeley",
year = "1992"
}
% Data from ACM portal:
% - http://portal.acm.org/citation.cfm?id=290180
@Article{arora-jacm1998,
author = "Sanjeev Arora",
title = "Polynomial Time Approximation Schemes for {E}uclidean
Traveling Salesman and other Geometric Problems",
journal = jacm,
year = "1998",
volume = "45",
number = "5",
pages = "753--782"
}
@Article{arrow-jpe1950,
author = "Kenneth J. Arrow",
title = "A Difficulty in the Concept of Social Welfare",
journal = "Journal of Political Economy",
year = "1950",
volume = "58",
number = "4",
pages = "328--346"
}
@InProceedings{asai-fukunaga-aaai2016,
author = "Masataro Asai and Alex Fukunaga",
title = "Tiebreaking Strategies for $A^*$ Search: How to Explore the Final Frontier",
crossref = "aaai2016",
pages = "673--679"
}
@InProceedings{asai-fukunaga-aaai2018,
author = "Masataro Asai and Alex Fukunaga",
title = "Classical Planning in Deep Latent Space: Bridging the Subsymbolic-Symbolic Boundary",
crossref = "aaai2018",
pages = "6094--6101"
}
@InProceedings{asai-fukunaga-icaps2017,
author = "Masataro Asai and Alex Fukunaga",
title = "Exploration Among and Within Plateaus in Greedy Best-First Search",
crossref = "icaps2017",
pages = "11--19"
}
@Article{asai-fukunaga-jair2017,
author = "Masataro Asai and Alex Fukunaga",
title = "Tie-Breaking Strategies for Cost-Optimal Best First Search",
journal = jair,
year = "2017",
volume = "58",
pages = "67--121"
}
@InProceedings{asai-icaps2019,
author = "Masataro Asai",
title = "Unsupervised Grounding of Plannable First-Order Logic Representation from Images",
crossref = "icaps2019",
pages = "583--591"
}
@InProceedings{asai-muise-ijcai2020,
author = "Masataro Asai and Christian Muise",
title = "Learning Neural-Symbolic Descriptive Planning Models
via Cube-Space Priors: The Voyage Home (to {STRIPS})",
crossref = "ijcai2020",
pages = "2676--2682"
}
@InProceedings{audibert-et-al-colt2010,
author = "Jean{-}Yves Audibert and S{\'{e}}bastien Bubeck and R{\'{e}}mi Munos",
title = "Best Arm Identification in Multi-Armed Bandits",
booktitle = "Proceedings of the 23rd Conference on Learning Theory ({COLT} 2010)",
pages = "41--53",
year = "2010"
}
@Article{audibert-et-al-tcs2009,
author = "Jean{-}Yves Audibert and R{\'{e}}mi Munos and Csaba Szepesv{\'{a}}ri",
title = "Exploration-exploitation tradeoff using variance estimates in multi-armed bandits",
journal = tcs,
volume = "410",
number = "19",
pages = "1876--1902",
year = "2009"
}
% Future bibtex keys for the journal 'Machine Learning' should use the abbreviation jml
@Article{auer-et-al-ml2002,
author = "Peter Auer and Nicol{\`o} Cesa-Bianchi and Paul Fischer",
title = "Finite-time Analysis of the Multiarmed Bandit Problem",
journal = jml,
volume = "47",
issue = "2-3",
month = "May",
year = "2002",
pages = "235--256",
publisher = "Kluwer Academic Publishers"
}
@Article{aurenhammer-et-al-cc1992,
author = "Franz Aurenhammer and Johann Hagauer and Wilfried Imrich",
title = "Cartesian Graph Factorization at Logarithmic Cost per Edge",
journal = "Computational Complexity",
year = "1992",
volume = "2",
pages = "331--349"
}
@Book{ausiello-et-al-1999,
author = "Giorgio Ausiello and Pierluigi Crescenzi and Giorgo
Gambosi and Viggo Kann and Alberto
Marchetti-Spaccamela and Marco Protasi",
title = "Complexity and Approximation",
publisher = "Springer-Verlag",
year = "1999"
}
@Article{ausiello-et-al-jcss1980,
author = "Giorgio Ausiello and Alessandro D'Atri and Marco Protasi",
title = "Structure Preserving Reductions among Convex Optimization Problems",
journal = jcss,
year = "1980",
volume = "21",
number = "1",
pages = "136--153",
}
@InProceedings{aziz-et-al-dac1994,
author = "Adnan Aziz and Serdar Ta{\c{s}}{\i}ran and Robert K. Brayton",
title = "{BDD} Variable Ordering for Interacting Finite State
Machines",
pages = "283--288",
crossref = "dac1994"
}
@Book{baader-et-al-2003,
editor = "Franz Baader and Diego Calvanese and Deborah L. McGuinness
and Daniele Nardi and Peter F. Patel-Schneider",
title = "The Description Logic Handbook: Theory, Implementation and Applications",
year = "2003",
publisher = "Cambridge University Press",
}
@InProceedings{babai-stoc1985,
author = "L{\'{a}}szl{\'{o}} Babai",
title = "Trading Group Theory for Randomness",
editor = "Robert Sedgewick",
booktitle = "Proceedings of the Seventeenth Annual {ACM} Symposium on
Theory of Computing (STOC '85)",
publisher = "{ACM} Press",
year = "1985",
pages = "421--429"
}
@InProceedings{babaioff-et-al-approx2007,
author = "Moshe Babaioff and Nicole Immorlica and David Kempe and Robert Kleinberg",
title = "A Knapsack Secretary Problem with Applications",
booktitle = "Proceedings of the 10th International Workshop on Approximation (APPROX 2007)",
year = "2007",
pages = "16--28",
publisher = "Springer-Verlag",
address = "Berlin, Heidelberg"
}
@InProceedings{babaki-et-al-socs2020,
author = "Behrouz Babaki and Gilles Pesant and Claude{-}Guy Quimper",
crossref = "socs2020",
title = "Solving Classical {AI} Planning Problems Using
Planning-Independent {CP} Modeling and Search",
pages = "2--10",
}
% Data verified.
% Printed source available.
@Article{bacchus-aimag2001,
author = "Fahiem Bacchus",
title = "The {AIPS}'00 Planning Competition",
journal = aimag,
year = "2001",
volume = "22",
number = "3",
pages = "47--56"
}
@Article{bacchus-kabanza-aij2000,
author = "Fahiem Bacchus and Froduald Kabanza",
title = "Using Temporal Logics to Express Search Control Knowledge for
Planning",
journal = aij,
volume = "116",
number = "1--2",
pages = "123--191",
year = "2000",
}
@Article{bacchus-kabanza-amai1998,
author = "Fahiem Bacchus and Froduald Kabanza",
title = "Planning for Temporally Extended Goals",
journal = amai,
year = "1998",
volume = "22",
number = "1,1",
pages = "5--27",
}
% Data verified.
@Article{bacchus-yang-aij1994,
author = "Fahiem Bacchus and Qiang Yang",
title = "Downward Refinement and the Efficiency of Hierarchical
Problem Solving",
journal = aij,
volume = "71",
number = "1",
pages = "43--100",
year = "1994"
}
@InProceedings{backstrom-ecai2014,
author = "Christer B{\"a}ckstr{\"o}m",
title = "Parameterising the Complexity of Planning by the
Number of Paths in the Domain-transition Graphs",
crossref = "ecai2014",
pages = "33--38"
}
@InProceedings{backstrom-et-al-ijcai2019,
author = "Christer B{\"a}ckstr{\"o}m and Peter Jonsson and Sebastian Ordyniak",
title = "A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs",
crossref = "ijcai2019",
pages = "6126--6130"
}
@Article{backstrom-et-al-jcss2015,
author = "Christer B{\"a}ckstr{\"o}m and Peter Jonsson and Sebastian Ordyniak and Stefan Szeider",
title = "A complete parameterized complexity analysis of bounded planning ",
journal = "jcss",
volume = "81",
number = "7",
pages = "1311--1332",
year = "2015"
}
@InProceedings{backstrom-et-al-socs2013,
author = "Christer B{\"a}ckstr{\"o}m and Peter Jonsson and Simon St{\aa}hlberg",
title = "Fast Detection of Unsolvable Planning Instances Using Local Consistency",
crossref = "socs2013",
pages = "29--37"
}
@InProceedings{backstrom-jonsson-ijcai2013,
author = "Christer B{\"a}ckstr{\"o}m and Peter Jonsson",
title = "Bridging the Gap Between Refinement and Heuristics in Abstraction",
crossref = "ijcai2013",
pages = "2261--2267"
}
@Article{backstrom-jonsson-jair2012,
author = "Christer B{\"{a}}ckstr{\"o}m and Peter Jonsson",
title = "Algorithms and Limits for Compact Plan Representations",
journal = jair,
volume = "44",
pages = "141--177",
year = "2012"
}
@Article{backstrom-jonsson-jair2013,
author = "Christer B{\"{a}}ckstr{\"o}m and Peter Jonsson",
title = "A Refined View of Causal Graphs and Component Sizes:
{SP}-{C}losed Graph Classes and Beyond",
journal = jair,
volume = "47",
pages = "575--611",
year = "2013"
}
@InProceedings{backstrom-jonsson-kr2012,
author = "Christer B{\"a}ckstr{\"o}m and Peter Jonsson",
title = "Abstracting Abstraction in Search with Applications in Planning",
crossref = "kr2012",
pages = "446--456"
}
@Article{backstrom-klein-compint1991,
author = "Christer B{\"a}ckstr{\"o}m and Inger Klein",
title = "Planning in polynomial time: the {SAS-PUBS} class",
journal = compint,
year = "1991",
volume = "7",
number = "3",
pages = "181--197"
}
% Data from author's websites:
% - http://www.informatik.uni-freiburg.de/~nebel/journals.html
% - http://www.ida.liu.se/~chrba/publications/article.html
% Data obtained from second author.
@Article{backstrom-nebel-compint1995,
author = "Christer B{\"a}ckstr{\"o}m and Bernhard Nebel",
title = "Complexity Results for {SAS$^{+}$} Planning",
journal = compint,
year = "1995",
volume = "11",
number = "4",
pages = "625--655"
}
@Article{bagchi-mahanti-jacm1983,
author = "Amitava Bagchi and Ambuj Mahanti",
title = "Search Algorithms Under Different Kinds of Heuristics --- A Comparative Study",
journal = jacm,
year = "1983",
volume = "30",
pages = "1--21"
}
@Article{bahar-et-al-fmsd1997,
author = "R. Iris Bahar and Erica A. Frohm and Charles M. Gaona and
Gary D. Hachtel and Enrico Macii and Abelardo Pardo and
Fabio Somenzi",
title = "Algebraic Decision Diagrams and Their Applications",
journal = "Formal Methods in System Design",
volume = "10",
number = "2--3",
year = "1997",
pages = "171--206"
}
@InProceedings{bahar-et-al-iccad1993,
author = "R. Iris Bahar and Erica A. Frohm and Charles M. Gaona and
Gary D. Hachtel and Enrico Macii and Abelardo Pardo and
Fabio Somenzi",
title = "Algebraic Decision Diagrams and Their Applications",
crossref = "iccad1993",
pages = "188--191"
}
@InProceedings{bahumi-et-al-icaps2011wshdip,
author = "Roei Bahumi and Carmel Domshlak and Michael Katz",
title = "On Satisficing Planning with Admissible Heuristics",
crossref = "icaps2011wshdip",
pages = "37--42"
}
@InProceedings{baier-botea-icaps2009,
author = "Jorge A. Baier and Adi Botea",
title = "Improving Planning Performance Using Low-Conflict Relaxed
Plans",
crossref = "icaps2009",
pages = "10--17"
}
@InProceedings{baier-et-al-aaai2008,
author = "Jorge A. Baier and Christian Fritz and Meghyn Bienvenu and Sheila A. McIlraith",
title = "Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners",
crossref = "aaai2008",
pages = "1509--1512",
}
% Data taken from DBLP.
@InProceedings{baier-et-al-icaps2007,
author = "Jorge A. Baier and Christian Fritz and Sheila A. McIlraith",
title = "Exploiting Procedural Domain Control Knowledge in
State-of-the-Art Planners",
pages = "26--33",
crossref = "icaps2007",
}
% Data taken from DBLP.
@InProceedings{baier-et-al-ijcai2007,
author = "Jorge A. Baier and Fahiem Bacchus and
Sheila A. McIlraith",
title = "A Heuristic Search Approach to Planning with
Temporally Extended Preferences",
crossref = "ijcai2007",
pages = "1808--1815"
}
@Article{baier-mcilraith-aimag2008,
author = "Jorge A. Baier and Sheila A. McIlraith",
title = "Planning with Preferences",
journal = aimag,
year = "2008",
volume = "29",
number = "4",
pages = "25--36"
}
% Data from proceedings volume.
@InProceedings{baier-mcilraith-icaps2006,
author = "Jorge A. Baier and Sheila A. McIlraith",
title = "Planning with Temporally Extended Goals using Heuristic
Search",
pages = "342--345",
crossref = "icaps2006"
}
% Data verified (Bernhard's copy).
@InProceedings{baioletti-et-al-kr1998,
author = "Marco Baioletti and Stefano Marcugini and Alfredo
Milani",
title = "Encoding Planning Constraints into Partial Order
Planning Domains",
booktitle = "Principles of Knowledge Representation and Reasoning:
Proceedings of the Sixth International Conference
(KR'98)",
publisher = "Morgan Kaufmann",
address = "San Francisco",
year = "1998",
editor = "Anthony G. Cohn and Lenhart Schubert and Stuart C. Shapiro",
pages = "608--616"
}
@Article{balas-dam1998,
author = "Egon Balas",
title = "Disjunctive programming: Properties of the convex hull of
feasible points",
journal = "Discrete Applied Mathematics",
year = "1998",
volume = "89",
number = "1",
pages = "3--44"
}
@Misc{balas-msrr1974,
author = "Egon Balas",
title = "Disjunctive programming: Properties of the convex hull of
feasible points",
institution = "Carnegie-Mellon University",
month = "July",
year = "1974",
howpublished = "MSRR \#348",
number = "348"
}
% Data taken from publisher's website.
@Book{ball-et-al-1995,
editor = "Michael Ball and Tom Magnanti and Clyde Monma and
George Nemhauser",
title = "Network Models",
year = "1995",
series = "Handbooks in Operations Research and Management
Science",
volume = "8",
publisher = "Elsevier",
address = "Amsterdam"