2010
(3)
A Correctness Result for Reasoning about OneDimensional Planning Problems.
Hu, Y.; and Levesque, H. J.
In Proc. of The Twelfth International Conference on The Principles of Knowledge Representation and Reasoning, 2010.
Link
bibtex
5 downloads
@inproceedings{hu10_1d,
author = {Yuxiao Hu and
Hector J. Levesque},
title = {A Correctness Result for Reasoning about OneDimensional
Planning Problems},
booktitle = {Proc. of The Twelfth International Conference on The Principles of Knowledge Representation and Reasoning},
year = {2010},
ee = {http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1270}
}
Computing Applicability Conditions for Plans with Loops.
Srivastava, S.; Immerman, N.; and Zilberstein, S.
In Proc. of ICAPS, 2010.
bibtex
@InProceedings{srivastava10_precons,
Author = {Siddharth Srivastava and Neil Immerman and Shlomo
Zilberstein},
Title = {Computing Applicability Conditions for Plans with Loops},
BookTitle = {Proc. of ICAPS},
year = 2010
}
2009
(10)
Beyond Classical Planning: Procedural Control Knowledge and Preferences in StateoftheArt Planners Revisited.
Baier, J. A.; Fritz, C.; Bienvenu, M.; and McIlraith, S. A.
In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex
@inproceedings{baier09_bcp,
title={Beyond Classical Planning: Procedural Control Knowledge and Preferences in StateoftheArt Planners Revisited},
author={Jorge A. Baier and Christian Fritz and Meghyn Bienvenu and Sheila A. McIlraith},
booktitle={Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece},
year={2009}
}
Automatic Derivation of Memoryless Policies and FiniteState Controllers Using Classical Planners.
Bonet, B.; Palacios, H.; and Geffner, H.
In Proc. of the 19th International Conf. on Artificial Intelligence Planning and Scheduling, 2009.
bibtex
@InProceedings{bonet09_controller,
Author = {B. Bonet and H. Palacios and H. Geffner},
Title = {Automatic Derivation of Memoryless Policies and FiniteState Controllers Using Classical Planners},
BookTitle = {Proc. of the 19th International Conf. on Artificial
Intelligence Planning and Scheduling},
year = 2009
}
Solving HighLevel Planning Programs.
Giacomo, G. D.; Patrizi, F.; and Sardina, S.
In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex
@inproceedings{giacomo09_hl,
title={Solving HighLevel Planning Programs},
author={Giuseppe De Giacomo and Fabio Patrizi and Sebastian Sardina},
booktitle={Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece},
year={2009}
}
Partial Observability, Quantification, and Iteration for Planning.
Goldman, R. P.
In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex
@inproceedings{goldman09_iteration,
title={Partial Observability, Quantification, and Iteration for Planning},
author={Robert P. Goldman},
booktitle={Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece},
year={2009}
}
Planning with Loops: Some New Results.
Hu, Y.; and Levesque, H. J.
In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex
@inproceedings{hu09_loops,
title={Planning with Loops: Some New Results},
author={Yuxiao Hu and Hector J. Levesque},
booktitle={Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece},
year={2009}
}
P^2 : A Baseline Approach to Planning with Control Structures and Programs.
Petrick, R. P. A.
In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex
@inproceedings{petrick09_control,
title={P^2 : A Baseline Approach to Planning with Control Structures and Programs},
author={Ronald P. A. Petrick},
booktitle={Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece},
year={2009}
}
Web Service Composition via the Customization of Golog Programs with User Preferences.
Sohrabi, S.; Prokoshyna, N.; ; and McIlraith, S. A.
In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex
@inproceedings{sohrabi09_service,
title={Web Service Composition via the Customization of Golog Programs with User Preferences},
author={Shirin Sohrabi and Nataliya Prokoshyna and and Sheila A. McIlraith},
booktitle={Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece},
year={2009}
}
Challenges in Finding Generalized Plans.
Srivastava, S.; Immerman, N.; and Zilberstein, S.
In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex
@inproceedings{srivastava09_challenges,
title={Challenges in Finding Generalized Plans},
author={Siddharth Srivastava and Neil Immerman and Shlomo Zilberstein},
booktitle={Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece},
year={2009}
}
On Pebble Motion on Graphs and Abstract Multirobot Path Planning.
Surynek, P.
In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex
@inproceedings{surynek09_pebble,
title={On Pebble Motion on Graphs and Abstract Multirobot Path Planning},
author={Pavel Surynek},
booktitle={Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece},
year={2009}
}
2008
(3)
Using Abstraction for Generalized Planning.
Srivastava, S; Immerman, N; and Zilberstein, S
International Symposium on AI and Mathematics. 2008.
bibtex
@Article{sriv08isaim,
Author = {Srivastava, S and Immerman, N and Zilberstein, S},
Title = {Using Abstraction for Generalized Planning},
Journal = {International Symposium on AI and Mathematics},
year = 2008
}
Learning Generalized Plans Using Abstract Counting.
Srivastava, S.; Immerman, N.; and Zilberstein, S.
In Proc. of AAAI, pages 991997, 2008.
Paper
bibtex
2 downloads
@InProceedings{srivastava08_genplan,
Author = {Siddharth Srivastava and Neil Immerman and Shlomo
Zilberstein},
Title = {Learning Generalized Plans Using Abstract Counting.},
BookTitle = {Proc. of AAAI},
Pages = {991997},
biburl = {http://www.bibsonomy.org/bibtex/2eeb13869151626879777caceceed6715/dblp},
isbn = {9781577353683},
url = {http://dblp.unitrier.de/db/conf/aaai/aaai2008.html#SrivastavaIZ08},
year = 2008
}
Foundations of Generalized Planning.
Srivastava, S.; Immerman, N.; and Zilberstein, S.
Technical Report UMCS2008039, Dept. of Computer Science, Univ. of Massachusetts, Amherst. 2008.
bibtex
@Article{srivastava08_TR,
Author = {Srivastava, Siddharth and Immerman, Neil and
Zilberstein, Shlomo},
Title = {Foundations of {G}eneralized {P}lanning},
Journal = {Technical Report UMCS2008039, Dept. of Computer
Science, Univ. of Massachusetts, Amherst},
year = 2008
}
2007
(3)
Exploiting Procedural Domain Control Knowledge in StateoftheArt Planners.
Baier, J. A.; Fritz, C.; and McIlraith, S. A.
In Proc. of ICAPS, pages 2633, 2007.
Paper
bibtex
15 downloads
@InProceedings{baier07_dck,
Author = {Jorge A. Baier and Christian Fritz and Sheila A.
McIlraith},
Title = {Exploiting Procedural Domain Control Knowledge in
StateoftheArt Planners.},
BookTitle = {Proc. of ICAPS},
Pages = {2633},
biburl = {http://www.bibsonomy.org/bibtex/2dd31cec64dccd185f5edcab4e07a8927/dblp},
isbn = {9781577353447},
url = {http://dblp.unitrier.de/db/conf/aips/icaps2007.html#BaierFM07},
year = 2007
}
Using Abstraction for Generalized Planning.
Srivastava, S.; Immerman, N.; and Zilberstein, S.
Workshop on AI Planning and Learning, ICAPS. 2007.
bibtex
@Article{fullVersion,
Author = {Srivastava, S. and Immerman, N. and Zilberstein, S.},
Title = {Using Abstraction for Generalized Planning},
Journal = {Workshop on {AI} Planning and Learning, {ICAPS}},
year = 2007
}
LoopDISTILL: Learning DomainSpecific Planners from Example Plans.
Winner, E.; and Veloso, M. M.
In Workshop on AI Planning and Learning, ICAPS, 2007.
bibtex
@InProceedings{winner07_loop,
Author = {Winner, Elly and Veloso, Manuela M.},
Title = {Loop{DISTILL}: Learning DomainSpecific Planners from
Example Plans},
BookTitle = {Workshop on {AI} Planning and Learning, {ICAPS}},
year = 2007
}
2006
(1)
Termination proofs for systems code.
Cook, B.; Podelski, A.; and Rybalchenko, A.
In Proc. of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2006.
bibtex
@InProceedings{terminator,
Author = {Byron Cook and Andreas Podelski and Andrey Rybalchenko},
Title = {Termination proofs for systems code},
BookTitle = {Proc. of the 2006 {ACM} {SIGPLAN} {C}onference on
{P}rogramming {L}anguage {D}esign and {I}mplementation},
year = 2006
}
2005
(2)
Contingent Planning via Heuristic Forward Search with Implicit Belief States.
Hoffmann, J.; and Brafman, R. I.
In Proc. of ICAPS, pages 7180, 2005.
Paper
bibtex
@InProceedings{hoffmann05_contingent,
Author = {Joerg Hoffmann and Ronen I. Brafman},
Title = {Contingent Planning via Heuristic Forward Search with
Implicit Belief States.},
BookTitle = {Proc. of ICAPS},
Pages = {7180},
biburl = {http://www.bibsonomy.org/bibtex/2ccbbaff06c4442b8b738c44a9bf0ba95/dblp},
isbn = {1577352203},
url = {http://dblp.unitrier.de/db/conf/aips/icaps2005.html#HoffmannB05},
year = 2005
}
Planning with Loops.
Levesque, H. J.
In Proc. of IJCAI, pages 509515, 2005.
Paper
bibtex
6 downloads
@InProceedings{levesque05_loop,
Author = {Hector J. Levesque},
Title = {Planning with Loops.},
BookTitle = {Proc. of IJCAI},
Pages = {509515},
isbn = {0938075934},
url = {http://dblp.unitrier.de/db/conf/ijcai/ijcai2005.html#Levesque05},
year = 2005
}
2003
(2)
Weak, strong, and strong cyclic planning via symbolic model checking.
Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P.
Artif. Intell., 147(12): 3584. 2003.
Link
Paper
bibtex
@Article{cimatti03_cyclic,
Author = {Alessandro Cimatti and Marco Pistore and Marco Roveri
and Paolo Traverso},
Title = {Weak, strong, and strong cyclic planning via symbolic
model checking.},
Journal = {Artif. Intell.},
Volume = {147},
Number = {12},
Pages = {3584},
biburl = {http://www.bibsonomy.org/bibtex/203d6615beefd37e8b0b33fa917ddb348/dblp},
ee = {http://dx.doi.org/10.1016/S00043702(02)003740},
url = {http://dblp.unitrier.de/db/journals/ai/ai147.html#CimattiPRT03},
year = 2003
}
DISTILL: Learning DomainSpecific Planners by Example.
Winner, E.; and Veloso, M. M.
In Proc. of ICML, pages 800807, 2003.
Paper
bibtex
1 download
@InProceedings{winner03_distill,
Author = {Elly Winner and Manuela M. Veloso},
Title = {DISTILL: Learning DomainSpecific Planners by Example.},
BookTitle = {Proc. of ICML},
Pages = {800807},
isbn = {1577351894},
url = {http://dblp.unitrier.de/db/conf/icml/icml2003.html#WinnerV03},
year = 2003
}
2002
(2)
Lazy Abstraction.
Henzinger, T. A.; Jhala, R.; Majumdar, R.; and Sutre, G.
In Symposium on Principles of Programming Languages, 2002.
bibtex
@InProceedings{henzinger02lazy,
Author = "Thomas A. Henzinger and Ranjit Jhala and Rupak
Majumdar and Gregoire Sutre",
Title = {Lazy {A}bstraction},
BookTitle = {Symposium on {P}rinciples of {P}rogramming {L}anguages},
year = 2002
}
Parametric shape analysis via 3valued logic.
Sagiv, M.; Reps, T.; and Wilhelm, R.
ACM Transactions on Programming Languages and Systems, 24(3): 217298. 2002.
bibtex
@Article{tvlaToplas,
Author = {Sagiv, M. and Reps, T. and Wilhelm, R.},
Title = {Parametric shape analysis via 3valued logic},
Journal = {ACM Transactions on Programming Languages and Systems},
Volume = {24},
Number = {3},
Pages = {217298},
year = 2002
}
2001
(1)
A Survey on CaseBased Planning.
Spalzzi, L.
Artif. Intell. Rev., 16(1): 3–36. 2001.
bibtex
@Article{spalzzi01_cbp,
Author = {Luca Spalzzi},
Title = {A Survey on CaseBased Planning},
Journal = {Artif. Intell. Rev.},
Volume = {16},
Number = {1},
Pages = {336},
year = 2001
}
1999
(1)
Strong Cyclic Planning Revisited.
Daniele, M.; Traverso, P.; and Vardi, M. Y.
In Proc. of the European Conference on Planning, pages 3548, 1999.
bibtex
@InProceedings{daniele99_Cyclic,
Author = {Marco Daniele and Paolo Traverso and Moshe Y. Vardi},
Title = {Strong {C}yclic {P}lanning {R}evisited},
BookTitle = {Proc. of the {E}uropean {C}onference on {P}lanning},
Pages = {3548},
year = 1999
}
1998
(2)
Automatic OBDDBased Generation of Universal Plans in NonDeterministic Domains.
Cimatti, A.; Roveri, M.; and Traverso, P.
In Proc. of AAAI, 1998.
bibtex
@InProceedings{CRT98,
Author = {Cimatti, A. and Roveri, M. and Traverso, P.},
Title = {Automatic {OBDD}{B}ased {G}eneration of {U}niversal
{P}lans in {N}on{D}eterministic {D}omains},
BookTitle = {Proc. of AAAI},
year = 1998
}
Foundations for the situation calculus.
Levesque, H. J.; Pirri, F.; and Reiter, R.
Electronic Transactions on Artificial Intelligence, 2: 159–178. 1998.
bibtex
@ARTICLE{levesque98_sitcalc,
author = {Hector J. Levesque and Fiora Pirri and Ray Reiter},
title = {Foundations for the situation calculus},
journal = {Electronic Transactions on Artificial Intelligence},
year = {1998},
volume = {2},
pages = {159178}
}
1997
(1)
GOLOG: A Logic Programming Language for Dynamic Domains.
Levesque, H. J.; Reiter, R.; Lesperance, Y.; Lin, F.; and Scherl, R. B.
Journal of Logic Programming, 31. 1997.
bibtex
8 downloads
@ARTICLE{levesque97_golog,
author = {Hector J. Levesque and Raymond Reiter and Yves Lesperance and Fangzhen Lin and Richard B. Scherl},
title = {GOLOG: A Logic Programming Language for Dynamic Domains},
journal = {Journal of Logic Programming},
year = {1997},
volume = {31}
}
1990
(1)
Acquiring Recursive and Iterative Concepts with ExplanationBased Learning.
Shavlik, J. W.
Machine Learning, 5: 3940. 1990.
Paper
bibtex
2 downloads
@Article{shavlik90_Bagger2,
Author = {Jude W. Shavlik},
Title = {Acquiring Recursive and Iterative Concepts with
ExplanationBased Learning.},
Journal = {Machine Learning},
Volume = {5},
Pages = {3940},
biburl = {http://www.bibsonomy.org/bibtex/229247414fa0617b7421828a02aba75c4/dblp},
url = {http://dblp.unitrier.de/db/journals/ml/ml5.html#Shavlik90},
year = 1990
}
1986
(2)
ExplanationBased Learning: An Alternative View.
Dejong, G.; and Mooney, R.
Mach. Learn., 1(2): 145–176. 1986.
doi
bibtex
@Article{ebl06,
Author = {Gerald Dejong and Raymond Mooney},
Title = {ExplanationBased Learning: An Alternative View},
Journal = {Mach. Learn.},
Volume = {1},
Number = {2},
Pages = {145176},
address = {Hingham, MA, USA},
doi = {http://dx.doi.org/10.1023/A:1022898111663},
issn = {08856125},
publisher = {Kluwer Academic Publishers},
year = 1986
}
CHEF: A Model of CaseBased Planning.
Hammond, K.
In Proceedings of AAAI86, pages 267271, 1986.
bibtex
@InProceedings{hammond86_cbp,
Author = {Kristian Hammond},
Title = {{CHEF: A Model of CaseBased Planning}},
BookTitle = {{Proceedings of AAAI86}},
Pages = {267271},
biburl = {http://www.bibsonomy.org/bibtex/20c4f84cb0f5cf77f9aefa6a3b5754c0a/bsmyth},
year = 1986
}
1972
(1)
Learning and Executing Generalized Robot Plans.
Fikes, R.; Hart, P.; and Nilsson, N.
Technical Report 70, AI Center, SRI International, 1972.
bibtex
@TechReport{fikes_Gen72,
Author = {Fikes, R.E. and Hart, P.E. and Nilsson, N.J.},
Title = {Learning and {E}xecuting {G}eneralized {R}obot {P}lans},
Institution = {AI Center, SRI International},
Number = {70},
year = 1972
}
1971
(1)
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving.
Fikes, R.; and Nilsson, N.
Technical Report AI Center, SRI International, 1971.
SRI Project 8259
bibtex
abstract
@TechReport{fikes_STRIPS71,
Author = {Fikes, R.E. and Nilsson, N.J.},
Title = {S{TRIPS}: {A} {N}ew {A}pproach to the {A}pplication of
{T}heorem {P}roving to {P}roblem {S}olving},
Institution = {AI Center, SRI International},
Note = {SRI Project 8259},
abstract = {We describe a new problem solver called STRIPS that
attempts to find a sequence of operators in a space of
world models to transform a given initial world model
into a model in which a given goal formula can be
proved to be true. STRIPS represents a world model as
an arbitrary collection of firstorder predicate
calculus formulas and is designed to work with mode
consisting of large numbers of formulas. It employs a
resolution theoremprover to answer questions of
particular models and uses meansends analysis to guide
it to the desired goalsatisfying model. },
year = 1971
}
We describe a new problem solver called STRIPS that attempts to find a sequence of operators in a space of world models to transform a given initial world model into a model in which a given goal formula can be proved to be true. STRIPS represents a world model as an arbitrary collection of firstorder predicate calculus formulas and is designed to work with mode consisting of large numbers of formulas. It employs a resolution theoremprover to answer questions of particular models and uses meansends analysis to guide it to the desired goalsatisfying model.
Copy&paste any of the following snippets into an existing
page to embed this page. For more details see the
documention.
JavaScript
<script src="https://bibbase.org/show?bib=rbr.cs.umass.edu/gp/genplan.bib&proxy=1&group0=year&css=rbr.cs.umass.edu/gp/style.css&simplegroups=1&jsonp=1"></script>
PHP
<?php
$contents = file_get_contents("https://bibbase.org/show?bib=rbr.cs.umass.edu/gp/genplan.bib&proxy=1&group0=year&css=rbr.cs.umass.edu/gp/style.css&simplegroups=1");
print_r($contents);
?>
iFrame
<iframe src="https://bibbase.org/show?bib=rbr.cs.umass.edu/gp/genplan.bib&proxy=1&group0=year&css=rbr.cs.umass.edu/gp/style.css&simplegroups=1"></iframe>
