\n \n \n
\n
\n\n \n \n \n \n \n \n Partition-Based Logical Reasoning.\n \n \n \n \n\n\n \n Amir, E.; and McIlraith, S.\n\n\n \n\n\n\n In
Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR'2000), pages 389-400, Breckenridge, Colorado, USA, April 12-15 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{kr00part,\n Title = {Partition-Based Logical Reasoning},\n Author = {Amir, E. and McIlraith, S.},\n Booktitle = { Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR'2000)},\n Year = {2000},\n\n Address = {Breckenridge, Colorado, USA},\n Month = {April 12-15},\n Pages = {389-400},\n\n Timestamp = {2018.09.23},\n Url = {kr00part.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Approximately Optimal Monitoring of Plan Preconditions.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In
uai00, pages 54–62, Stanford, 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Boutilier-monitoring:uai00,\n Title = {Approximately Optimal Monitoring of Plan Preconditions},\n Author = {Craig Boutilier},\n Booktitle = uai00,\n Year = {2000},\n\n Address = {Stanford},\n Pages = {54--62},\n\n Timestamp = {2018.09.23},\n Url = {craig_monitoring.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Stochastic Dynamic Programming with Factored Representations.\n \n \n \n \n\n\n \n Boutilier, C.; Dearden, R.; and Goldszmidt, M.\n\n\n \n\n\n\n
Artificial Intelligence, 121: 49–107. 2000.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{BDG:SPI,\n Title = {Stochastic Dynamic Programming with Factored Representations},\n Author = {Craig Boutilier and Richard Dearden and Mois\\'{e}s Goldszmidt},\n Journal = {Artificial Intelligence},\n Year = {2000},\n Pages = {49--107},\n Volume = {121},\n\n Timestamp = {2018.09.23},\n Url = {sdp.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Decision-Theoretic, High-Level Agent Programming in the Situation Calculus.\n \n \n \n \n\n\n \n Boutilier, C.; Reiter, R.; Soutchanski, M.; and Thrun, S.\n\n\n \n\n\n\n In
Workshop on Decision-Theoretic Planning, Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR2000), Breckenridge, Colorado, Apr 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{Boutilier00,\n Title = {Decision-Theoretic, High-Level Agent Programming in\n the Situation Calculus},\n Author = {Boutilier, Craig and Reiter, Ray and Soutchanski,\n Mikhail and Thrun, Sebastian},\n Booktitle = {Workshop on Decision-Theoretic Planning, Seventh\n International Conference on Principles of Knowledge\n Representation and Reasoning (KR2000)},\n Year = {2000},\n\n Address = {Breckenridge, Colorado},\n Month = {Apr},\n\n File = {dtgologKR00W.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/dtgologKR00W.pdf:PDF;dtgologKR00W.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/dtgologKR00W.ps:PostScript},\n Key = {CogRobo},\n Keywords = {Golog},\n Opturl = {http://www.cs.toronto.edu/cogrobo/Papers/dtgologKR00W.ps.gz},\n Timestamp = {2018.09.23},\n Url = {dtgologKR00W.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Decision-Theoretic, High-Level Agent Programming in the Situation Calculus.\n \n \n \n \n\n\n \n Boutilier, C.; Reiter, R.; Soutchanski, M.; and Thrun, S.\n\n\n \n\n\n\n In
Proceedings of the 7th Conference on Artificial Intelligence (AAAI-00) and of the 12th Conference on Innovative Applications of Artificial Intelligence (IAAI-00), pages 355–362, Menlo Park, CA, July 30–3 2000. AAAI Press\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{Boutilier00-DTGolog,\n Title = {Decision-Theoretic, High-Level Agent Programming in\n the Situation Calculus},\n Author = {Craig Boutilier and Ray Reiter and Mikhail Soutchanski\n and Sebastian Thrun},\n Booktitle = {Proceedings of the 7th Conference on Artificial\n Intelligence (AAAI-00) and of the 12th Conference on\n Innovative Applications of Artificial Intelligence\n ({IAAI}-00)},\n Year = {2000},\n\n Address = {Menlo Park, CA},\n Month = {July 30--3},\n Pages = {355--362},\n Publisher = {AAAI Press},\n\n File = {dtgologaaai00.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/dtgologaaai00.pdf:PDF;dtgologaaai00.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/dtgologaaai00.ps:PostScript},\n Key = {CogRobo},\n Keywords = {Golog},\n Opturl = {http://www.cs.toronto.edu/cogrobo/Papers/dtgologaaai00.ps.gz},\n Timestamp = {2018.09.23},\n Url = {dtgologaaai00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n ConGolog, A Concurrent Programming Language Based on the Situation Calculus.\n \n \n \n \n\n\n \n De Giacomo, G.; Lespérance, Y.; and Levesque, H.\n\n\n \n\n\n\n
Artificial Intelligence, 121(1–2): 109–169. 2000.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@Article{Giuseppe00-ConGologAi,\n Title = {Con{G}olog, A Concurrent Programming Language Based on\n the Situation Calculus},\n Author = {De Giacomo, Giuseppe and Lesp\\'erance, Yves and\n Levesque, Hector},\n Journal = {Artificial Intelligence},\n Year = {2000},\n Number = {1--2},\n Pages = {109--169},\n Volume = {121},\n\n File = {ConGologAIJ.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/ConGologAIJ.pdf:PDF;ConGologAIJ.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/ConGologAIJ.ps:PostScript},\n Key = {CogRobo},\n Keywords = {Golog},\n Timestamp = {2018.09.23},\n Url = {ConGologAIJ.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Open World Planning in the Situation Calculus.\n \n \n \n \n\n\n \n Finzi, A.; Pirri, F.; and Reiter, R.\n\n\n \n\n\n\n In
Proceedings of the 7th Conference on Artificial Intelligence (AAAI-00) and of the 12th Conference on Innovative Applications of Artificial Intelligence (IAAI-00), pages 754–760, Menlo Park, CA, July30– 3 2000. AAAI Press\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Finzi00,\n Title = {Open World Planning in the Situation Calculus},\n Author = {Alberto Finzi and Fiora Pirri and Ray Reiter},\n Booktitle = {Proceedings of the 7th Conference on Artificial\n Intelligence ({AAAI}-00) and of the 12th Conference on\n Innovative Applications of Artificial Intelligence\n ({IAAI}-00)},\n Year = {2000},\n\n Address = {Menlo Park, CA},\n Month = jul # { 30-- 3},\n Pages = {754--760},\n Publisher = {AAAI Press},\n\n File = {openworld-aaai00.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/openworld-aaai00.pdf:PDF;openworld-aaai00.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/openworld-aaai00.ps:PostScript},\n Key = {CogRobo},\n Opturl = {http://www.cs.toronto.edu/cogrobo/Papers/openworld-aaai00.ps.gz},\n Timestamp = {2018.09.23},\n Url = {openworld-aaai00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Non-Markovian Control in the Situation Calculus.\n \n \n \n \n\n\n \n Gabaldon, A.\n\n\n \n\n\n\n In
The Second International Workshop on Cognitive Robotics (held in conjunction with ECAI2000), Berlin, Germany, August 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Gabaldon00,\n Title = {Non-Markovian Control in the Situation Calculus},\n Author = {Gabaldon, Alfredo},\n Booktitle = {The Second International Workshop on Cognitive\n Robotics (held in conjunction with ECAI2000)},\n Year = {2000},\n\n Address = {Berlin, Germany},\n Month = {August},\n\n File = {nonmarkov.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/nonmarkov.pdf:PDF;nonmarkov.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/nonmarkov.ps:PostScript},\n Key = {CogRobo},\n Opturl = {http://www.cs.toronto.edu/cogrobo/Papers/nonmarkov.ps.gz},\n Timestamp = {2018.09.23},\n Url = {nonmarkov.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n cc-Golog: Towards More Reaslitic Logic-Based Robot Controllers.\n \n \n \n \n\n\n \n Grosskreutz, H.; and Lakemeyer, G.\n\n\n \n\n\n\n In
Proceedings of AAAI-00, Austin, Texas, Jul 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{Grosskreutz00,\n Title = {cc-Golog: Towards More Reaslitic Logic-Based Robot\n Controllers},\n Author = {Grosskreutz, Henrik and Lakemeyer, Gerhard},\n Booktitle = {Proceedings of AAAI-00},\n Year = {2000},\n\n Address = {Austin, Texas},\n Month = {Jul},\n\n Key = {CogRobo2},\n Keywords = {Golog},\n Optnote = { \\\\ {\\sf Extends the situation calculus and ConGolog\n to model continuous and event-driven behavior. cc-Golog\n can wait for events and execute plans while guarding\n certain constraints.}},\n Timestamp = {2018.09.23},\n Url = {Grosskreutz00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Turning High-Level Plans into Robot Programs in Uncertain Domains.\n \n \n \n \n\n\n \n Grosskreutz, H.; and Lakemeyer, G.\n\n\n \n\n\n\n In
Proceedings of ECAI-2000, Berlin, Germany, 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{Grosskreutz00b,\n Title = {Turning High-Level Plans into Robot Programs in\n Uncertain Domains},\n Author = {Grosskreutz, Henrik and Lakemeyer, Gerhard},\n Booktitle = {Proceedings of ECAI-2000},\n Year = {2000},\n\n Address = {Berlin, Germany},\n\n Key = {CogRobo2},\n Keywords = {Golog},\n Optnote = {\\\\ {Presents pGolog, a version of Golog for modeling\n low level processes with uncertain outcomes as\n probabilistic programs}},\n Timestamp = {2018.09.23},\n Url = {Grosskreutz00b.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n An Embedding of ConGolog in 3APL.\n \n \n \n \n\n\n \n Hindriks, K.; Lespérance, Y.; and Levesque, H.\n\n\n \n\n\n\n Technical Report UU-CS-2000-13, Department of Computer Science, University Utrecht, 2000.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@TechReport{Hindriks00b,\n Title = {An Embedding of ConGolog in 3{APL}},\n Author = {Hindriks, Koen and Lesp\\'erance, Yves and Levesque,\n Hector},\n Institution = {Department of Computer Science, University Utrecht},\n Year = {2000},\n Number = {UU-CS-2000-13},\n\n Key = {CogRobo},\n Keywords = {Golog},\n Timestamp = {2018.09.23},\n Url = {Hindriks00b.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Solving Combinatorial Auctions using Stochastic Local Search.\n \n \n \n \n\n\n \n Hoos, H. H.; and Boutilier, C.\n\n\n \n\n\n\n In
aaai00, pages 22–29, Austin, TX, 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{HoosBoutilier:aaai00,\n Title = {Solving Combinatorial Auctions using Stochastic Local Search},\n Author = {Holger H. Hoos and Craig Boutilier},\n Booktitle = aaai00,\n Year = {2000},\n\n Address = {Austin, TX},\n Pages = {22--29},\n\n Timestamp = {2018.09.23},\n Url = {casls.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Ability and Knowing How in the Situation Calculus.\n \n \n \n \n\n\n \n Lespérance, Y.; Levesque, H.; Lin, F.; and Scherl, R.\n\n\n \n\n\n\n
Studia Logica, 66(1): 165–186. October 2000.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Lesperance01-KnowHowSit,\n Title = {Ability and Knowing How in the Situation Calculus},\n Author = {Lesp\\'erance, Y. and Levesque, H. and Lin, F. and\n Scherl, R.},\n Journal = {Studia Logica},\n Year = {2000},\n\n Month = {October},\n Number = {1},\n Pages = {165--186},\n Volume = {66},\n\n File = {abilityInSC.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/abilityInSC.pdf:PDF;abilityInSC.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/abilityInSC.ps:PostScript},\n Key = {CogRobo},\n Opturl = {http://www.cs.toronto.edu/cogrobo/Papers/abilityInSC.ps.gz},\n Timestamp = {2018.09.23},\n Url = {abilityInSC.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Integrating Planning into Reactive High-Level Robot Programs.\n \n \n \n \n\n\n \n Lespérance, Y.; and Ng, H.\n\n\n \n\n\n\n In
In Proceedings of the Second International Cognitive Robotics Workshop, pages 49–54, Berlin, Germany, August 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Lesperance00,\n Title = {Integrating Planning into Reactive High-Level Robot\n Programs},\n Author = {Lesp\\'erance, Yves and Ng, Ho-Kong},\n Booktitle = {In Proceedings of the Second International Cognitive\n Robotics Workshop},\n Year = {2000},\n\n Address = {Berlin, Germany},\n Month = {August},\n Pages = {49--54},\n\n Key = {CogRobo},\n Timestamp = {2018.09.23},\n Url = {Lesperance00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n LeGolog: Inexpensive Experiments in Cognitive Robotics.\n \n \n \n \n\n\n \n Levesque, H.; and Pagnucco, M.\n\n\n \n\n\n\n In
Proceedings of the Second International Cognitive Robotics Workshop, Berlin, Germany, August 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{Levesque00-Legolog,\n Title = {Le{G}olog: {I}nexpensive Experiments in Cognitive\n Robotics},\n Author = {Levesque, Hector and Pagnucco, Maurice},\n Booktitle = {Proceedings of the Second International Cognitive\n Robotics Workshop},\n Year = {2000},\n\n Address = {Berlin, Germany},\n Month = {August},\n\n Key = {CogRobo},\n Keywords = {Golog},\n Opturl = {http://www.cs.toronto.edu/cogrobo/Papers/crw00.ps},\n Timestamp = {2018.09.23},\n Url = {crw00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Diagnosing Hybrid Systems: A Bayesian Model Selection Approach.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In
Proceedings of the Eleventh International Workshop on Principles of Diagnosis (DX'00), pages 140-146, June 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{dx00,\n Title = {Diagnosing Hybrid Systems: A Bayesian Model Selection Approach},\n Author = {McIlraith, S.},\n Booktitle = {Proceedings of the Eleventh International Workshop on Principles of Diagnosis (DX'00)},\n Year = {2000},\n Month = {June},\n Pages = {140-146},\n\n Timestamp = {2018.09.23},\n Url = {dx00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Modeling and Programming Devices and Web Agents.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In
Proceedings of the NASA Goddard Workshop on Formal Approaches to Agent-Based Systems (FAABS 2000), of
Lecture Notes in Computer Science, pages 63-77, Greenbelt, MD, USA, April 5-7 2000. Springer-Verlag\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{nasa00,\n Title = {Modeling and Programming Devices and Web Agents},\n Author = {McIlraith, S.},\n Booktitle = {Proceedings of the NASA Goddard Workshop on Formal Approaches to Agent-Based Systems (FAABS 2000)},\n Year = {2000},\n\n Address = {Greenbelt, MD, USA},\n Month = {April 5-7},\n Pages = {63-77},\n Publisher = {Springer-Verlag},\n Series = {Lecture Notes in Computer Science},\n\n Timestamp = {2018.09.23},\n Url = {nasa00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Hybrid Systems Diagnosis.\n \n \n \n \n\n\n \n McIlraith, S.; Biswas, G.; Clancy, D.; and Gupta, V.\n\n\n \n\n\n\n In
Proceedings of The Third International Workshop on Hybrid Systems: Computation and Control (HSCC 2000), of
Lecture Notes in Computer Science, pages 282-295, Pittsburgh, PA, USA, March 23-25 2000. Springer-Verlag\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{hs00,\n Title = {Hybrid Systems Diagnosis},\n Author = {McIlraith, S. and Biswas, G. and Clancy, D. and Gupta, V.},\n Booktitle = {Proceedings of The Third International Workshop on Hybrid Systems: Computation and Control (HSCC 2000)},\n Year = {2000},\n\n Address = {Pittsburgh, PA, USA},\n Month = {March 23-25},\n Pages = {282-295},\n Publisher = {Springer-Verlag},\n Series = {Lecture Notes in Computer Science},\n\n Timestamp = {2018.09.23},\n Url = {hs00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Value-Directed Belief State Approximation for POMDPs.\n \n \n \n \n\n\n \n Poupart, P.; and Boutilier, C.\n\n\n \n\n\n\n In
uai00, pages 497–506, Stanford, 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{PoupartBoutilier:uai00,\n Title = {Value-Directed Belief State Approximation for {POMDPs}},\n Author = {Pascal Poupart and Craig Boutilier},\n Booktitle = uai00,\n Year = {2000},\n\n Address = {Stanford},\n Pages = {497--506},\n\n Timestamp = {2018.09.23},\n Url = {vda.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Narratives as Programs.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n In Cohn, A. G.; Giunchiglia, F.; and Selman, B., editor(s),
Principles of Knowledge Representation and Reasoning: Proceedings of the Seventh International Conference (KR2000), San Francisco, CA, 2000. Morgan Kaufmann\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Reiter00,\n Title = {Narratives as Programs},\n Author = {Reiter, Ray},\n Booktitle = {Principles of Knowledge Representation and Reasoning:\n Proceedings of the Seventh International Conference\n (KR2000)},\n Year = {2000},\n\n Address = {San Francisco, CA},\n Editor = {Cohn, A. G. and Giunchiglia, F. and Selman, B.},\n Publisher = {Morgan Kaufmann},\n\n File = {narrativesKR00.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/narrativesKR00.pdf:PDF;narrativesKR00.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/narrativesKR00.ps:PostScript},\n Key = {CogRobo},\n Opturl = {http://www.cs.toronto.edu/cogrobo/Papers/narrativesKR00.ps.gz},\n Timestamp = {2018.09.23},\n Url = {narrativesKR00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Iterated Belief Change in the Situation Calculus.\n \n \n \n \n\n\n \n Shapiro, S.; Pagnucco, M.; Lespérance, Y.; and Levesque, H. J.\n\n\n \n\n\n\n In Cohn, A. G.; Giunchiglia, F.; and Selman, B., editor(s),
Principles of Knowledge Representation and Reasoning: Proceedings of the Seventh International Conference (KR2000), San Francisco, CA, 2000. Morgan Kaufmann\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Shapiro00,\n Title = {Iterated Belief Change in the Situation Calculus},\n Author = {Shapiro, S. and Pagnucco, M. and Lesp\\'erance, Y. and\n Levesque, H. J.},\n Booktitle = {Principles of Knowledge Representation and Reasoning:\n Proceedings of the Seventh International Conference\n (KR2000)},\n Year = {2000},\n\n Address = {San Francisco, CA},\n Editor = {Cohn, A. G. and Giunchiglia, F. and Selman, B.},\n Publisher = {Morgan Kaufmann},\n\n File = {kr2000.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/kr2000.pdf:PDF;kr2000.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/kr2000.ps:PostScript},\n Key = {CogRobo},\n Opturl = {http://www.cs.toronto.edu/cogrobo/Papers/kr2000.ps.gz},\n Timestamp = {2018.09.23},\n Url = {kr2000.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n An On-line Decision-Theoretic Golog Interpreter.\n \n \n \n \n\n\n \n Soutchanski, M.\n\n\n \n\n\n\n In
The 2nd International Cognitive Robotics Workshop (held in conjunction with ECAI-2000) , Berlin, Germany, August 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{Soutchanski00,\n Title = {An On-line Decision-Theoretic Golog Interpreter},\n Author = {Soutchanski, Mikhail},\n Booktitle = {The 2nd International Cognitive Robotics Workshop\n (held in conjunction with ECAI-2000) },\n Year = {2000},\n\n Address = {Berlin, Germany},\n Month = {August},\n\n File = {onlinedtgi.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/onlinedtgi.pdf:PDF;onlinedtgi.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/onlinedtgi.ps:PostScript},\n Key = {CogRobo},\n Keywords = {Golog},\n Opturl = {http://www.cs.toronto.edu/cogrobo/Papers/onlinedtgi.ps.gz},\n Timestamp = {2018.09.23},\n Url = {onlinedtgi.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n APRICODD: Approximate Policy Construction using Decision Diagrams.\n \n \n \n \n\n\n \n St-Aubin, R.; Hoey, J.; and Boutilier, C.\n\n\n \n\n\n\n In
Advances in Neural Information Processing Systems 13 (NIPS-2000), pages 1089–1095, Denver, 2000. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{apricodd:nips00,\n Title = {{APRICODD}: Approximate Policy Construction using Decision Diagrams},\n Author = {Robert St-Aubin and Jesse Hoey and Craig Boutilier},\n Booktitle = {Advances in Neural Information Processing Systems 13 (NIPS-2000)},\n Year = {2000},\n\n Address = {Denver},\n Pages = {1089--1095},\n\n Timestamp = {2018.09.23},\n Url = {apricodd.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n