var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=http://www.cs.toronto.edu/kr/publications/list.bib&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=http://www.cs.toronto.edu/kr/publications/list.bib&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=http://www.cs.toronto.edu/kr/publications/list.bib&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2018\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Reduced Cost Fixing for Maximum Satisfiability.\n \n \n \n \n\n\n \n Bacchus, F.; Hyttinen, A.; Järvisalo, M.; and Saikko, P.\n\n\n \n\n\n\n In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden., pages 5209–5213, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"ReducedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/ijcai/BacchusHJS18,\n  Title                    = {Reduced Cost Fixing for Maximum Satisfiability},\n  Author                   = {Fahiem Bacchus and\n Antti Hyttinen and\n Matti J{\\"{a}}rvisalo and\n Paul Saikko},\n  Booktitle                = {Proceedings of the Twenty-Seventh International Joint Conference on\n Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm,\n Sweden.},\n  Year                     = {2018},\n  Pages                    = {5209--5213},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/BacchusHJS18},\n  Doi                      = {10.24963/ijcai.2018/723},\n  Timestamp                = {Sat, 28 Jul 2018 14:39:21 +0200},\n  Url                      = {https://doi.org/10.24963/ijcai.2018/723}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n Artif. Intell., 262: 189–221. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/ai/BelleL18,\n  Title                    = {Reasoning about discrete and continuous noisy sensors and effectors\n in dynamical systems},\n  Author                   = {Vaishak Belle and\n Hector J. Levesque},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2018},\n  Pages                    = {189--221},\n  Volume                   = {262},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/journals/ai/BelleL18},\n  Doi                      = {10.1016/j.artint.2018.06.003},\n  Timestamp                = {Thu, 13 Sep 2018 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1016/j.artint.2018.06.003}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Controller Synthesis via Non-Deterministic Planning.\n \n \n \n\n\n \n Camacho, A.; Baier, J. A.; Muise, C. J.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Thirty-First Canadian Conference on Artificial Intelligence (CCAI), 2018. \n To appear\n\n\n\n
\n\n\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{cam-bai-mui-mci-ccai18,\n  Title                    = {Controller Synthesis via Non-Deterministic Planning},\n  Author                   = {Alberto Camacho and\n Jorge A. Baier and\n Christian J. Muise and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Thirty-First Canadian Conference on Artificial Intelligence\n({CCAI})},\n  Year                     = {2018},\n  Note                     = {To appear},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Finite LTL Synthesis as Planning.\n \n \n \n\n\n \n Camacho, A.; Baier, J. A.; Muise, C. J.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eight International Conference on Automated Planning and Scheduling (ICAPS), 2018. \n to appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 27 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{cam-bai-mui-mci-icaps18,\n  Title                    = {Finite {LTL} Synthesis as Planning},\n  Author                   = {Alberto Camacho and\n Jorge A. Baier and\n Christian J. Muise and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Twenty-Eight International Conference on Automated Planning and Scheduling ({ICAPS})},\n  Year                     = {2018},\n  Note                     = {to appear},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n SynKit: Finite LTL Synthesis as a Service.\n \n \n \n\n\n \n Camacho, A.; Muise, C. J.; Baier, J. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In System Demonstrations at the Twenty-Eight International Conference on Automated Planning and Scheduling (ICAPS), 2018. \n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{cam-mui-bai-mci-icaps18demo,\n  Title                    = {{SynKit}: Finite {LTL} Synthesis as a Service},\n  Author                   = {Alberto Camacho and\n Christian J. Muise and\n Jorge A. Baier and\n Sheila A. McIlraith},\n  Booktitle                = {System Demonstrations at the Twenty-Eight International Conference on Automated Planning and Scheduling ({ICAPS})},\n  Year                     = {2018},\n  Note                     = {To appear},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n LTL Realizability via Safety and Reachability Games.\n \n \n \n\n\n \n Camacho, A.; Muise, C. J.; Baier, J. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI), 2018. \n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{cam-mui-bai-mci-ijcai18,\n  Title                    = {{LTL} Realizability via Safety and Reachability Games},\n  Author                   = {Alberto Camacho and\n Christian J. Muise and\n Jorge A. Baier and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence ({IJCAI})},\n  Year                     = {2018},\n  Note                     = {To appear},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n SynKit: LTL Synthesis as a Service.\n \n \n \n\n\n \n Camacho, A.; Muise, C. J.; Baier, J. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Demonstration Track at the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI), 2018. \n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{cam-mui-bai-mci-ijcai18demo,\n  Title                    = {{SynKit}: {LTL} Synthesis as a Service},\n  Author                   = {Alberto Camacho and\n Christian J. Muise and\n Jorge A. Baier and\n Sheila A. McIlraith},\n  Booktitle                = {Demonstration Track at the Twenty-Seventh International Joint Conference on Artificial Intelligence ({IJCAI})},\n  Year                     = {2018},\n  Note                     = {To appear},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories.\n \n \n \n \n\n\n \n Fazekas, K.; Bacchus, F.; and Biere, A.\n\n\n \n\n\n\n In Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, pages 134–151, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"ImplicitPaper\n  \n \n\n \n \n doi\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{DBLP:conf/cade/FazekasBB18,\n  Title                    = {Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo\n Theories},\n  Author                   = {Katalin Fazekas and\n Fahiem Bacchus and\n Armin Biere},\n  Booktitle                = {Automated Reasoning - 9th International Joint Conference, {IJCAR}\n 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford,\n UK, July 14-17, 2018, Proceedings},\n  Year                     = {2018},\n  Pages                    = {134--151},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/cade/FazekasBB18},\n  Doi                      = {10.1007/978-3-319-94205-6\\_10},\n  Timestamp                = {Mon, 09 Jul 2018 12:59:13 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-94205-6\\_10}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Teaching Multiple Tasks to an RL Agent using LTL.\n \n \n \n\n\n \n Toro Icarte, R.; Klassen, T.; Valenzano, R.; and McIlraith, S. A.\n\n\n \n\n\n\n In AAMAS, 2018. \n to appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 19 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{tor-etal-aamas18,\n  Title                    = {Teaching Multiple Tasks to an RL Agent using LTL},\n  Author                   = {Rodrigo {Toro Icarte} and\n Toryn Klassen and\n Richard Valenzano and\n Sheila A. McIlraith},\n  Booktitle                = {AAMAS},\n  Year                     = {2018},\n  Note                     = {to appear},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Advice-Based Exploration in Model-Based Reinforcement Learning.\n \n \n \n\n\n \n Icarte, R. T.; Klassen, T. Q.; Valenzano, R. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Advances in Artificial Intelligence - 31st Canadian Conference on Artificial Intelligence, Canadian AI 2018, Toronto, ON, Canada, May 8-11, 2018, Proceedings, pages 72–83, 2018. \n \n\n\n\n
\n\n\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{icarte-etal-cai18,\n  Title                    = {Advice-Based Exploration in Model-Based Reinforcement Learning},\n  Author                   = {Rodrigo Toro Icarte and\n Toryn Q. Klassen and\n Richard Anthony Valenzano and\n Sheila A. McIlraith},\n  Booktitle                = {Advances in Artificial Intelligence - 31st Canadian Conference on\n Artificial Intelligence, Canadian {AI} 2018, Toronto, ON, Canada,\n May 8-11, 2018, Proceedings},\n  Year                     = {2018},\n  Pages                    = {72--83},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Using Reward Machines for High-Level Task Specification and Decomposition in Reinforcement Learning.\n \n \n \n\n\n \n Toro Icarte, R.; Klassen, T. Q.; Valenzano, R.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 35th International Conference on Machine Learning (ICML), 2018. \n to appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 39 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{tor-etal-icml18,\n  Title                    = {Using Reward Machines for High-Level Task Specification and Decomposition in Reinforcement Learning},\n  Author                   = {Rodrigo {Toro Icarte} and\n Toryn Q. Klassen and\n Richard Valenzano and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 35th International Conference on Machine Learning (ICML)},\n  Year                     = {2018},\n  Note                     = {to appear},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An AI Planning-Based Approach to the Multi-Agent Plan Recognition Problem.\n \n \n \n \n\n\n \n Shvo, M.; Sohrabi, S.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Thirty-First Canadian Conference on Artificial Intelligence (CCAI), 2018. \n To appear\n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{ShvoSohrabiMcIlraithCAI2018,\n  Title                    = {An AI Planning-Based Approach to the Multi-Agent Plan Recognition Problem},\n  Author                   = {Maayan Shvo and Shirin Sohrabi and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Thirty-First Canadian Conference on Artificial Intelligence ({CCAI})},\n  Year                     = {2018},\n  Note                     = {To appear},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~maayanshvo/ShvoSohrabiMcIlraithCAI2018.pdf [www.cs.toronto.edu]}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (15)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Reduced Cost Fixing in MaxSAT.\n \n \n \n \n\n\n \n Bacchus, F.; Hyttinen, A.; Järvisalo, M.; and Saikko, P.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming - 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, pages 641–651, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"ReducedPaper\n  \n \n\n \n \n doi\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{DBLP:conf/cp/BacchusHJS17,\n  Title                    = {Reduced Cost Fixing in MaxSAT},\n  Author                   = {Fahiem Bacchus and\n Antti Hyttinen and\n Matti J{\\"{a}}rvisalo and\n Paul Saikko},\n  Booktitle                = {Principles and Practice of Constraint Programming - 23rd International\n Conference, {CP} 2017, Melbourne, VIC, Australia, August 28 - September\n 1, 2017, Proceedings},\n  Year                     = {2017},\n  Pages                    = {641--651},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/cp/BacchusHJS17},\n  Doi                      = {10.1007/978-3-319-66158-2\\_41},\n  Timestamp                = {Wed, 23 Aug 2017 10:12:25 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-66158-2\\_41}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Epistemic Planning (Dagstuhl Seminar 17231).\n \n \n \n \n\n\n \n Baral, C.; Bolander, T.; van Ditmarsch, H.; and McIlraith, S. A.\n\n\n \n\n\n\n Dagstuhl Reports, 7(6): 1–47. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"EpistemicPaper\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
@Article{bar-etal-dagstuhl17,\n  Title                    = {Epistemic Planning (Dagstuhl Seminar 17231)},\n  Author                   = {Chitta Baral and\n Thomas Bolander and\n Hans van Ditmarsch and\n Sheila A. McIlraith},\n  Journal                  = {Dagstuhl Reports},\n  Year                     = {2017},\n  Number                   = {6},\n  Pages                    = {1--47},\n  Volume                   = {7},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {https://doi.org/10.4230/DagRep.7.6.1}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bridging the Gap Between LTL Synthesis and Automated Planning.\n \n \n \n \n\n\n \n Camacho, A.; Baier, J. A.; Muise, C. J.; and McIlraith, S. A.\n\n\n \n\n\n\n In Workshop on Generalized Planning (GenPlan'17), 2017. \n \n\n\n\n
\n\n\n\n \n \n \"BridgingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{cam-bai-mui-mci-genplan17,\n  Title                    = {Bridging the Gap Between {LTL} Synthesis and Automated Planning},\n  Author                   = {Alberto Camacho and\n Jorge A. Baier and\n Christian J. Muise and\n Sheila A. McIlraith},\n  Booktitle                = {Workshop on Generalized Planning ({GenPlan}'17)},\n  Year                     = {2017},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/cam-etal-genplan17.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decision-Making with Non-Markovian Rewards: From LTL to automata-based reward shaping.\n \n \n \n \n\n\n \n Camacho, A.; Chen, O.; Sanner, S.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Multi-disciplinary Conference on Reinforcement Learning and Decision Making (RLDM), pages 279-283, 2017. \n See also University of Toronto Technical Report CSRG-632\n\n\n\n
\n\n\n\n \n \n \"Decision-MakingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{cam-che-san-mci-rldm17,\n  Title                    = {Decision-Making with Non-Markovian Rewards: From {LTL} to automata-based reward shaping},\n  Author                   = {Alberto Camacho and\n Oscar Chen and\n Scott Sanner and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Multi-disciplinary Conference on Reinforcement Learning and Decision Making ({RLDM})},\n  Year                     = {2017},\n  Note                     = {See also University of Toronto Technical Report CSRG-632},\n  Pages                    = {279-283},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/cam-etal-rldm17.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Non-Markovian Rewards Expressed in LTL: Guiding Search Via Reward Shaping.\n \n \n \n \n\n\n \n Camacho, A.; Chen, O.; Sanner, S.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Tenth International Symposium on Combinatorial Search (SoCS), pages 159–160, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Non-MarkovianPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{cam-che-san-mci-socs17,\n  Title                    = {Non-Markovian Rewards Expressed in {LTL:} Guiding Search Via Reward Shaping},\n  Author                   = {Alberto Camacho and\n Oscar Chen and\n Scott Sanner and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Tenth International Symposium on Combinatorial Search ({SoCS})},\n  Year                     = {2017},\n  Pages                    = {159--160},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/cam-etal-socs17.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decision-Making with Non-Markovian Rewards: Guiding search via automata-Based reward shaping.\n \n \n \n \n\n\n \n Camacho, A.; Chen, O.; Sanner, S.; and McIlraith, S. A.\n\n\n \n\n\n\n Technical Report CSRG-632, Department of Computer Science, University of Toronto, June 2017.\n \n\n\n\n
\n\n\n\n \n \n \"Decision-MakingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{cam-che-san-mci-tr17,\n  Title                    = {Decision-Making with Non-Markovian Rewards: Guiding search via\nautomata-Based reward shaping},\n  Author                   = {Alberto Camacho and\n Oscar Chen and\n Scott Sanner and\n Sheila A. McIlraith},\n  Institution              = {Department of Computer Science, University of Toronto},\n  Year                     = {2017},\n  Month                    = {June},\n  Number                   = {CSRG-632},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ftp.cs.toronto.edu/csrg-technical-reports/632/cam-che-san-mci-tr2017.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Non-Deterministic Planning with Temporally Extended Goals: LTL over finite and infinite traces.\n \n \n \n \n\n\n \n Camacho, A.; Triantafillou, E.; Muise, C.; Baier, J.; and McIlraith, S. A.\n\n\n \n\n\n\n In The 31st AAAI Conference on Artificial Intelligence (AAAI-17), 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Non-DeterministicPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 31 downloads\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
\n
@InProceedings{ltl-fond-aaai-17,\n  Title                    = {Non-Deterministic Planning with Temporally Extended Goals: {LTL} over finite and infinite traces},\n  Author                   = {Alberto Camacho and Eleni Triantafillou and Christian Muise and Jorge Baier and Sheila A. McIlraith},\n  Booktitle                = {The 31st AAAI Conference on Artificial Intelligence (AAAI-17)},\n  Year                     = {2017},\n\n  Abstract                 = {Temporally extended goals are critical to the specification of a\ndiversity of real-world planning problems. Here we examine\nthe problem of non-deterministic planning with temporally\nextended goals specified in linear temporal logic (LTL), interpreted\nover either finite or infinite traces. Unlike existing\nLTL planners, we place no restrictions on our LTL formulae\nbeyond those necessary to distinguish finite from infinite\ninterpretations. We generate plans by compiling LTL temporally\nextended goals into problem instances described in\nthe Planning Domain Definition Language that are solved by\na state-of-the-art fully observable non-deterministic planner.\nWe propose several different compilations based on translations\nof LTL to alternating or non-deterministic (B¨uchi) automata,\nand evaluate various properties of the competing approaches.\nWe address a diverse spectrum of LTL planning\nproblems that, to this point, had not been solvable using AI\nplanning techniques, and do so in a manner that demonstrates\nhighly competitive performance.},\n  Keywords                 = {LTL, non-deterministic planning, temporally extended goals, FOND},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/cam-etal-aaai17.pdf}\n}\n\n
\n
\n\n\n
\n Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of non-deterministic planning with temporally extended goals specified in linear temporal logic (LTL), interpreted over either finite or infinite traces. Unlike existing LTL planners, we place no restrictions on our LTL formulae beyond those necessary to distinguish finite from infinite interpretations. We generate plans by compiling LTL temporally extended goals into problem instances described in the Planning Domain Definition Language that are solved by a state-of-the-art fully observable non-deterministic planner. We propose several different compilations based on translations of LTL to alternating or non-deterministic (B¨uchi) automata, and evaluate various properties of the competing approaches. We address a diverse spectrum of LTL planning problems that, to this point, had not been solvable using AI planning techniques, and do so in a manner that demonstrates highly competitive performance.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Using Advice in Model-Based Reinforcement Learning.\n \n \n \n\n\n \n Toro Icarte, R.; Klassen, T.; Valenzano, R.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Multi-disciplinary Conference on Reinforcement Learning and Decision Making (RLDM), pages 199-203, 2017. \n \n\n\n\n
\n\n\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{tor-etal-rldm17,\n  Title                    = {Using Advice in Model-Based Reinforcement Learning},\n  Author                   = {Rodrigo {Toro Icarte} and\n Toryn Klassen and\n Richard Valenzano and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Multi-disciplinary Conference on Reinforcement Learning and Decision Making ({RLDM})},\n  Year                     = {2017},\n  Pages                    = {199-203},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Numeric Planning via Abstraction and Policy Guided Search.\n \n \n \n \n\n\n \n Illanes, L.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 4338–4345, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"NumericPaper\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{ill-mci-ijcai17,\n  Title                    = {Numeric Planning via Abstraction and Policy Guided Search},\n  Author                   = {Leon Illanes and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Twenty-Sixth International Joint Conference on\n Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August\n 19-25, 2017},\n  Year                     = {2017},\n  Pages                    = {4338--4345},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {https://doi.org/10.24963/ijcai.2017/606}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards Representing What Readers of Fiction Believe.\n \n \n \n \n\n\n \n Klassen, T. Q.; Levesque, H. J.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Thirteenth International Symposium on Commonsense Reasoning, COMMONSENSE 2017, London, UK, November 6-8, 2017., 2017. \n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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{DBLP:conf/commonsense/KlassenLM17,\n  Title                    = {Towards Representing What Readers of Fiction Believe},\n  Author                   = {Toryn Q. Klassen and\n Hector J. Levesque and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Thirteenth International Symposium on Commonsense\n Reasoning, {COMMONSENSE} 2017, London, UK, November 6-8, 2017.},\n  Year                     = {2017},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/commonsense/KlassenLM17},\n  Timestamp                = {Mon, 29 Jan 2018 18:23:49 +0100},\n  Url                      = {http://ceur-ws.org/Vol-2052/paper12.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Logical Filtering and Smoothing: State Estimation in Partially Observable Domains.\n \n \n \n \n\n\n \n Mombourquette, B.; Muise, C.; and McIlraith, S.\n\n\n \n\n\n\n In The 31st AAAI Conference on Artificial Intelligence (AAAI-17), 2017. \n \n\n\n\n
\n\n\n\n \n \n \"LogicalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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 \n \n\n\n\n
\n
@InProceedings{bfr-aaai-17,\n  Title                    = {Logical Filtering and Smoothing: State Estimation in Partially Observable Domains},\n  Author                   = {Brent Mombourquette and Christian Muise and Sheila McIlraith},\n  Booktitle                = {The 31st AAAI Conference on Artificial Intelligence (AAAI-17)},\n  Year                     = {2017},\n\n  Abstract                 = {State estimation is the task of estimating the state of a partially\nobservable dynamical system given a sequence of executed\nactions and observations. In logical settings, state estimation\ncan be realized via logical filtering, which is exact\nbut can be intractable. We propose logical smoothing, a form\nof backwards reasoning that works in concert with approximated\nlogical filtering to refine past beliefs in light of new observations.\nWe characterize the notion of logical smoothing\ntogether with an algorithm for backwards-forwards state estimation.\nWe also present an approximation of our smoothing\nalgorithm that is space efficient. We prove properties of our\nalgorithms, and experimentally demonstrate their behaviour,\ncontrasting them with state estimation methods for planning.\nSmoothing and backwards-forwards reasoning are important\ntechniques for reasoning about partially observable dynamical\nsystems, introducing the logical analogue of effective\ntechniques from control theory and dynamic programming.},\n  Keywords                 = {state estimation, belief tracking, logical filtering, approximation},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.haz.ca/papers/momb-aaai17.pdf}\n}\n\n
\n
\n\n\n
\n State estimation is the task of estimating the state of a partially observable dynamical system given a sequence of executed actions and observations. In logical settings, state estimation can be realized via logical filtering, which is exact but can be intractable. We propose logical smoothing, a form of backwards reasoning that works in concert with approximated logical filtering to refine past beliefs in light of new observations. We characterize the notion of logical smoothing together with an algorithm for backwards-forwards state estimation. We also present an approximation of our smoothing algorithm that is space efficient. We prove properties of our algorithms, and experimentally demonstrate their behaviour, contrasting them with state estimation methods for planning. Smoothing and backwards-forwards reasoning are important techniques for reasoning about partially observable dynamical systems, introducing the logical analogue of effective techniques from control theory and dynamic programming.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Multiple-Profile Prediction-of-Use Games.\n \n \n \n \n\n\n \n Perrault, A.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, São Paulo, Brazil, May 8-12, 2017, pages 1688–1690, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Multiple-ProfilePaper\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{DBLP:conf/atal/PerraultB17,\n  Title                    = {Multiple-Profile Prediction-of-Use Games},\n  Author                   = {Andrew Perrault and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the 16th Conference on Autonomous Agents and MultiAgent\n Systems, {AAMAS} 2017, S{\\~{a}}o Paulo, Brazil, May 8-12, 2017},\n  Year                     = {2017},\n  Pages                    = {1688--1690},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/atal/PerraultB17},\n  Timestamp                = {Wed, 27 Sep 2017 07:24:00 +0200},\n  Url                      = {http://dl.acm.org/citation.cfm?id=3091405}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Multiple-Profile Prediction-of-Use Games.\n \n \n \n \n\n\n \n Perrault, A.; and Boutilier, C.\n\n\n \n\n\n\n In Autonomous Agents and Multiagent Systems - AAMAS 2017 Workshops, Best Papers, São Paulo, Brazil, May 8-12, 2017, Revised Selected Papers, pages 275–295, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Multiple-ProfilePaper\n  \n \n\n \n \n doi\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{DBLP:conf/atal/PerraultB17a,\n  Title                    = {Multiple-Profile Prediction-of-Use Games},\n  Author                   = {Andrew Perrault and\n Craig Boutilier},\n  Booktitle                = {Autonomous Agents and Multiagent Systems - {AAMAS} 2017 Workshops,\n Best Papers, S{\\~{a}}o Paulo, Brazil, May 8-12, 2017, Revised Selected\n Papers},\n  Year                     = {2017},\n  Pages                    = {275--295},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/atal/PerraultB17a},\n  Doi                      = {10.1007/978-3-319-71682-4\\_17},\n  Timestamp                = {Tue, 17 Jul 2018 07:47:34 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-71682-4\\_17}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Multiple-Profile Prediction-of-Use Games.\n \n \n \n \n\n\n \n Perrault, A.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 366–373, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Multiple-ProfilePaper\n  \n \n\n \n \n doi\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{DBLP:conf/ijcai/PerraultB17,\n  Title                    = {Multiple-Profile Prediction-of-Use Games},\n  Author                   = {Andrew Perrault and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Sixth International Joint Conference on\n Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August\n 19-25, 2017},\n  Year                     = {2017},\n  Pages                    = {366--373},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/PerraultB17},\n  Doi                      = {10.24963/ijcai.2017/52},\n  Timestamp                = {Wed, 27 Jun 2018 12:24:11 +0200},\n  Url                      = {https://doi.org/10.24963/ijcai.2017/52}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An AI Planning-Based Approach to the Multi-Agent Plan Recognition Problem (Preliminary Report).\n \n \n \n \n\n\n \n Shvo, M.; Sohrabi, S.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the The AAAI 2017 Workshop on Plan, Activity, and Intent Recognition (PAIR), 2017. \n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\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{ShvoSohrabiMcIlraithPAIR2017,\n  Title                    = {An AI Planning-Based Approach to the Multi-Agent Plan Recognition Problem (Preliminary Report)},\n  Author                   = {Maayan Shvo and Shirin Sohrabi and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the The AAAI 2017 Workshop on Plan, Activity, and Intent Recognition (PAIR)},\n  Year                     = {2017},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~shirin/ShvoSohrabiMcIlraithPAIR2017.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (16)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Finding a Collection of MUSes Incrementally.\n \n \n \n \n\n\n \n Bacchus, F.; and Katsirelos, G.\n\n\n \n\n\n\n In Integration of AI and OR Techniques in Constraint Programming - 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings, pages 35–44, 2016. \n \n\n\n\n
\n\n\n\n \n \n \"FindingPaper\n  \n \n\n \n \n doi\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{DBLP:conf/cpaior/BacchusK16,\n  Title                    = {Finding a Collection of MUSes Incrementally},\n  Author                   = {Fahiem Bacchus and\n George Katsirelos},\n  Booktitle                = {Integration of {AI} and {OR} Techniques in Constraint Programming\n - 13th International Conference, {CPAIOR} 2016, Banff, AB, Canada,\n May 29 - June 1, 2016, Proceedings},\n  Year                     = {2016},\n  Pages                    = {35--44},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/cpaior/BacchusK16},\n  Doi                      = {10.1007/978-3-319-33954-2\\_3},\n  Timestamp                = {Wed, 17 May 2017 14:24:39 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-33954-2\\_3}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A First-Order Logic of Probability and Only Knowing in Unbounded Domains.\n \n \n \n \n\n\n \n Belle, V.; Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA., pages 893–899, 2016. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{DBLP:conf/aaai/BelleLL16,\n  Title                    = {A First-Order Logic of Probability and Only Knowing in Unbounded Domains},\n  Author                   = {Vaishak Belle and\n Gerhard Lakemeyer and\n Hector J. Levesque},\n  Booktitle                = {Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence,\n February 12-17, 2016, Phoenix, Arizona, {USA.}},\n  Year                     = {2016},\n  Pages                    = {893--899},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/BelleLL16},\n  Timestamp                = {Wed, 05 Apr 2017 12:53:50 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12271}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Foundations for Generalized Planning in Unbounded Stochastic Domains.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016., pages 380–389, 2016. \n \n\n\n\n
\n\n\n\n \n \n \"FoundationsPaper\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{DBLP:conf/kr/BelleL16,\n  Title                    = {Foundations for Generalized Planning in Unbounded Stochastic Domains},\n  Author                   = {Vaishak Belle and\n Hector J. Levesque},\n  Booktitle                = {Principles of Knowledge Representation and Reasoning: Proceedings\n of the Fifteenth International Conference, {KR} 2016, Cape Town, South\n Africa, April 25-29, 2016.},\n  Year                     = {2016},\n  Pages                    = {380--389},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/kr/BelleL16},\n  Timestamp                = {Thu, 21 Apr 2016 20:01:05 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12881}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Logical Theory of Localization.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n Studia Logica, 104(4): 741–772. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\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{DBLP:journals/sLogica/BelleL16,\n  Title                    = {A Logical Theory of Localization},\n  Author                   = {Vaishak Belle and\n Hector J. Levesque},\n  Journal                  = {Studia Logica},\n  Year                     = {2016},\n  Number                   = {4},\n  Pages                    = {741--772},\n  Volume                   = {104},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/journals/sLogica/BelleL16},\n  Doi                      = {10.1007/s11225-015-9625-0},\n  Timestamp                = {Sat, 20 May 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1007/s11225-015-9625-0}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Incomplete Information and Communication in Voting.\n \n \n \n \n\n\n \n Boutilier, C.; and Rosenschein, J. S.\n\n\n \n\n\n\n In Handbook of Computational Social Choice, pages 223–258. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"IncompletePaper\n  \n \n\n \n \n doi\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
@InCollection{DBLP:reference/choice/BoutilierR16,\n  Title                    = {Incomplete Information and Communication in Voting},\n  Author                   = {Craig Boutilier and\n Jeffrey S. Rosenschein},\n  Booktitle                = {Handbook of Computational Social Choice},\n  Year                     = {2016},\n  Pages                    = {223--258},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/reference/choice/BoutilierR16},\n  Doi                      = {10.1017/CBO9781107446984.011},\n  Timestamp                = {Wed, 12 Jul 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1017/CBO9781107446984.011}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Strong-Cyclic Planning when Fairness is Not a Valid Assumption.\n \n \n \n\n\n \n Camacho, A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Workshop on Knowledge-based techniques for problem solving and reasoning (KnowProS'16), 2016. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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{cam-mci-fondplus-knowpros16,\n  Title                    = {Strong-Cyclic Planning when Fairness is Not a Valid Assumption},\n  Author                   = {Alberto Camacho and Sheila A. McIlraith},\n  Booktitle                = {Workshop on Knowledge-based techniques for problem solving and reasoning ({KnowProS}'16)},\n  Year                     = {2016},\n\n  Abstract                 = {We address the class of fully-observable non-deterministic (FOND) planning problems where non-deterministic actions are not guaranteed to display fair behavior. Typical solutions to FOND planning either guarantee goal reachability with a bounded number of transitions (so-called strong acyclic solutions), or are predicated on a fairness assumption that presumes each action effect occurs infinitely often when the action is applied infinite times in the same state (so-called strong-cyclic solutions). We introduce the FOND+ planning model, that extends the FOND model with a more informed description of the action transitions. Solutions to FOND+ problems are able to guarantee goal reachability when the classical fairness assumption is not valid. We characterize different topologies, or classes, of solutions showing that typical strong acyclic, fair strong-cyclic planning are particular cases. Finally, we present algorithms to solve each class of problems, and prove empirically that FOND+ solutions are different than strong-cyclic solutions that presume fairness.},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n
\n We address the class of fully-observable non-deterministic (FOND) planning problems where non-deterministic actions are not guaranteed to display fair behavior. Typical solutions to FOND planning either guarantee goal reachability with a bounded number of transitions (so-called strong acyclic solutions), or are predicated on a fairness assumption that presumes each action effect occurs infinitely often when the action is applied infinite times in the same state (so-called strong-cyclic solutions). We introduce the FOND+ planning model, that extends the FOND model with a more informed description of the action transitions. Solutions to FOND+ problems are able to guarantee goal reachability when the classical fairness assumption is not valid. We characterize different topologies, or classes, of solutions showing that typical strong acyclic, fair strong-cyclic planning are particular cases. Finally, we present algorithms to solve each class of problems, and prove empirically that FOND+ solutions are different than strong-cyclic solutions that presume fairness.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n From FOND to Robust Probabilistic Planning: Computing compact policies that bypass avoidable deadends.\n \n \n \n \n\n\n \n Camacho, A.; Muise, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In The 26th International Conference on Automated Planning and Scheduling (ICAPS), pages 65–69, 2016. \n \n\n\n\n
\n\n\n\n \n \n \"FromPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 6 downloads\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
@InProceedings{cam-mui-mci-icaps16,\n  Title                    = {From FOND to Robust Probabilistic Planning: Computing compact policies that bypass avoidable deadends},\n  Author                   = {Alberto Camacho and Christian Muise and Sheila A. McIlraith},\n  Booktitle                = {The 26th International Conference on Automated Planning and Scheduling (ICAPS)},\n  Year                     = {2016},\n  Pages                    = {65--69},\n\n  Abstract                 = {We address the class of probabilistic planning problems where the objective is to maximize the probability of reaching a prescribed goal. The complexity of probabilistic planning problems makes it difficult to compute high quality solutions for large instances, and existing algorithms either do not scale, or do so at the expense of the solution quality. We leverage core similarities between probabilistic and fully observable non-deterministic (FOND) planning to construct a sound, offline probabilistic planner, ProbPRP, that exploits algorithmic advances from state-of-the-art FOND planner, PRP, to compute compact policies that are guaranteed to bypass avoidable deadends. We evaluate ProbPRP on a selection of benchmarks used in past probabilistic planning competitions. The results show that ProbPRP, in many cases, outperforms the state of the art, computing substantially more robust policies and at times doing so orders of magnitude faster.},\n  Keywords                 = {non-deterministic planning, probabilistic planning, plan generation},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13188}\n}\n\n
\n
\n\n\n
\n We address the class of probabilistic planning problems where the objective is to maximize the probability of reaching a prescribed goal. The complexity of probabilistic planning problems makes it difficult to compute high quality solutions for large instances, and existing algorithms either do not scale, or do so at the expense of the solution quality. We leverage core similarities between probabilistic and fully observable non-deterministic (FOND) planning to construct a sound, offline probabilistic planner, ProbPRP, that exploits algorithmic advances from state-of-the-art FOND planner, PRP, to compute compact policies that are guaranteed to bypass avoidable deadends. We evaluate ProbPRP on a selection of benchmarks used in past probabilistic planning competitions. The results show that ProbPRP, in many cases, outperforms the state of the art, computing substantially more robust policies and at times doing so orders of magnitude faster.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Non-Deterministic Planning with Temporally Extended Goals: Completing the story for finite and infinite LTL (Amended Version).\n \n \n \n \n\n\n \n Camacho, A.; Triantafillou, E.; Muise, C.; Baier, J.; and McIlraith, S. A.\n\n\n \n\n\n\n In Workshop on knowledge-based techniques for problem solving and reasoning (KnowProS'16) at IJCAI, 2016. \n A version of this paper also appeared in the Workshop on Heuristic Search and Domain Independent Planning (HSDIP'16) at ICAPS\n\n\n\n
\n\n\n\n \n \n \"Non-DeterministicPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{cam-etal-ltl-knowpros16,\n  Title                    = {Non-Deterministic Planning with Temporally Extended Goals: Completing the story for finite and infinite {LTL} (Amended Version)},\n  Author                   = {Alberto Camacho and Eleni Triantafillou and Christian Muise and Jorge Baier and Sheila A. McIlraith},\n  Booktitle                = {Workshop on knowledge-based techniques for problem solving and reasoning (KnowProS'16) at IJCAI},\n  Year                     = {2016},\n  Note                     = {A version of this paper also appeared in the Workshop on Heuristic Search and Domain Independent Planning ({HSDIP}'16) at ICAPS},\n\n  Abstract                 = {Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of planning with temporally extended goals over both finite and infinite traces where actions can be non-deterministic, and where temporally extended goals are specified in linear temporal logic (LTL). Unlike existing LTL planners, we place no restrictionson our LTL formulae beyond those necessary to distinguish finite from infinite trace interpretations. We realize our planner by compiling temporally extended goals, represented in LTL, into Planning Domain Definition Language problem instances, and exploiting a state-of-the-art fully observable non-deterministic planner to compute solutions. The resulting planner is sound and complete. Our approach exploits the correspondence between LTL and automata. We propose several different compilations based on translations of LTL to (Buchi) alternating or non-deterministic finite state automata, and evaluate various properties of the competing approaches. We address a diverse spectrum of LTL planning problems that, to this point, had not been solvable using AI planning techniques. We do so while demonstrating competitive performance relative to the state of the art in LTL planning.},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/cam-etal-ltl-knowpros16.pdf}\n}\n\n
\n
\n\n\n
\n Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of planning with temporally extended goals over both finite and infinite traces where actions can be non-deterministic, and where temporally extended goals are specified in linear temporal logic (LTL). Unlike existing LTL planners, we place no restrictionson our LTL formulae beyond those necessary to distinguish finite from infinite trace interpretations. We realize our planner by compiling temporally extended goals, represented in LTL, into Planning Domain Definition Language problem instances, and exploiting a state-of-the-art fully observable non-deterministic planner to compute solutions. The resulting planner is sound and complete. Our approach exploits the correspondence between LTL and automata. We propose several different compilations based on translations of LTL to (Buchi) alternating or non-deterministic finite state automata, and evaluate various properties of the competing approaches. We address a diverse spectrum of LTL planning problems that, to this point, had not been solvable using AI planning techniques. We do so while demonstrating competitive performance relative to the state of the art in LTL planning.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Numeric Planning via Search Space Abstraction.\n \n \n \n\n\n \n Illanes, L.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Workshop on Knowledge-based Techniques for Problem Solving and Reasoning (KnowProS'16) at IJCAI, 2016. \n \n\n\n\n
\n\n\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{ill-mci-knowpros16,\n  Title                    = {Numeric Planning via Search Space Abstraction},\n  Author                   = {Leon Illanes and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Workshop on Knowledge-based Techniques for Problem Solving and Reasoning (KnowProS'16) at IJCAI},\n  Year                     = {2016},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Numeric Planning via Search Space Abstraction (Extended Abstract).\n \n \n \n\n\n \n Illanes, L.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of Ninth Annual Symposium on Combinatorial Search (SoCS'16), 2016. \n \n\n\n\n
\n\n\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{ill-mci-socs16,\n  Title                    = {Numeric Planning via Search Space Abstraction (Extended Abstract)},\n  Author                   = {Leon Illanes and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of Ninth Annual Symposium on Combinatorial Search (SoCS'16)},\n  Year                     = {2016},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decidable Reasoning in a Logic of Limited Belief with Function Symbols.\n \n \n \n \n\n\n \n Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016., pages 288–297, 2016. \n \n\n\n\n
\n\n\n\n \n \n \"DecidablePaper\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{DBLP:conf/kr/LakemeyerL16,\n  Title                    = {Decidable Reasoning in a Logic of Limited Belief with Function Symbols},\n  Author                   = {Gerhard Lakemeyer and\n Hector J. Levesque},\n  Booktitle                = {Principles of Knowledge Representation and Reasoning: Proceedings\n of the Fifteenth International Conference, {KR} 2016, Cape Town, South\n Africa, April 25-29, 2016.},\n  Year                     = {2016},\n  Pages                    = {288--297},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/kr/LakemeyerL16},\n  Timestamp                = {Thu, 21 Apr 2016 20:01:05 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12912}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using Metric Temporal Logic to Specify Scheduling Problems.\n \n \n \n \n\n\n \n Luo, R.; Valenzano, R. A.; Li, Y.; Beck, J. C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), pages 581–584, 2016. \n See technical report for further details.\n\n\n\n
\n\n\n\n \n \n \"UsingPaper\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{luo-etal-kr16,\n  Title                    = {Using Metric Temporal Logic to Specify Scheduling Problems},\n  Author                   = {Roy Luo and\n Richard Anthony Valenzano and\n Yi Li and\n J. Christopher Beck and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning ({KR 2016})},\n  Year                     = {2016},\n  Note                     = {See technical report for further details.},\n  Pages                    = {581--584},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/luo-etal-kr16.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Belief State Estimation for Planning via Approximate Logical Filtering and Smoothing.\n \n \n \n \n\n\n \n Mombourquette, B.; Muise, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Workshop on Knowledge-based techniques for problem solving and reasoning (KnowProS'16), 2016. \n \n\n\n\n
\n\n\n\n \n \n \"BeliefPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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{mombourquette-knowpros16-bf,\n  Title                    = {Belief State Estimation for Planning via Approximate Logical Filtering and Smoothing},\n  Author                   = {Brent Mombourquette and Christian Muise and Sheila A. McIlraith},\n  Booktitle                = {Workshop on Knowledge-based techniques for problem solving and reasoning ({KnowProS}'16)},\n  Year                     = {2016},\n\n  Abstract                 = {State estimation is the task of estimating the state of a partially observable dynamical system given a sequence of executed actions and observations. In logical settings, state estimation can be realized via logical filtering. Unfortunately such filtering, though exact, can be intractable. To this end, we propose logical smoothing, a form of backwards reasoning that works in concert with logical filtering to refine past beliefs in light of new observations. We characterize the notion of logical smoothing together with an algorithm for backwards-forwards state estimation. We prove properties of our algorithms, and experimentally demonstrate their behaviour. Smoothing together with backwards-forwards reasoning are important techniques for reasoning about partially observable dynamical systems, introducing the logical analogue of effective techniques from control theory and dynamic programming},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://ceur-ws.org/Vol-1648/paper8.pdf}\n}\n\n
\n
\n\n\n
\n State estimation is the task of estimating the state of a partially observable dynamical system given a sequence of executed actions and observations. In logical settings, state estimation can be realized via logical filtering. Unfortunately such filtering, though exact, can be intractable. To this end, we propose logical smoothing, a form of backwards reasoning that works in concert with logical filtering to refine past beliefs in light of new observations. We characterize the notion of logical smoothing together with an algorithm for backwards-forwards state estimation. We prove properties of our algorithms, and experimentally demonstrate their behaviour. Smoothing together with backwards-forwards reasoning are important techniques for reasoning about partially observable dynamical systems, introducing the logical analogue of effective techniques from control theory and dynamic programming\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal Partial-Order Plan Relaxation via MaxSAT.\n \n \n \n \n\n\n \n Muise, C.; Beck, J. C.; and McIlraith, S. A.\n\n\n \n\n\n\n Journal of Artificial Intelligence Research (JAIR), 57: 113 – 149. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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{jair-popgen,\n  Title                    = {Optimal Partial-Order Plan Relaxation via MaxSAT},\n  Author                   = {Christian Muise and J. Christopher Beck and Sheila A. McIlraith},\n  Journal                  = {Journal of Artificial Intelligence Research (JAIR)},\n  Year                     = {2016},\n  Pages                    = {113 -- 149},\n  Volume                   = {57},\n\n  Abstract                 = {Partial-order plans (POPs) are attractive because of their least-commitment nature, which provides enhanced plan flexibility at execution time relative to sequential plans. Current research on automated plan generation focuses on producing sequential plans, despite the appeal of POPs. In this paper we examine POP generation by relaxing or modifying the action orderings of a sequential plan to optimize for plan criteria that promote flexibility. Our approach relies on a novel partial weighted MaxSAT encoding of a sequential plan that supports the minimization of deordering or reordering of actions. We further demonstrate how to remove redundant actions from the plan. Our partial weighted MaxSAT encoding allows us to compute a POP from a sequential plan effectively. We compare the efficiency of our approach to previous methods for POP generation via sequential-plan relaxation. Our results show that while an existing heuristic approach consistently produces the optimal deordering of a sequential plan, our approach has greater flexibility when we consider reordering the actions in the plan while also providing a guarantee of optimality. We also investigate and confirm the accuracy of the standard $\\flex$ metric typically used to predict the true flexibility of a POP as measured by the number of linearizations it represents.},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.jair.org/media/5128/live-5128-9534-jair.pdf}\n}\n\n
\n
\n\n\n
\n Partial-order plans (POPs) are attractive because of their least-commitment nature, which provides enhanced plan flexibility at execution time relative to sequential plans. Current research on automated plan generation focuses on producing sequential plans, despite the appeal of POPs. In this paper we examine POP generation by relaxing or modifying the action orderings of a sequential plan to optimize for plan criteria that promote flexibility. Our approach relies on a novel partial weighted MaxSAT encoding of a sequential plan that supports the minimization of deordering or reordering of actions. We further demonstrate how to remove redundant actions from the plan. Our partial weighted MaxSAT encoding allows us to compute a POP from a sequential plan effectively. We compare the efficiency of our approach to previous methods for POP generation via sequential-plan relaxation. Our results show that while an existing heuristic approach consistently produces the optimal deordering of a sequential plan, our approach has greater flexibility when we consider reordering the actions in the plan while also providing a guarantee of optimality. We also investigate and confirm the accuracy of the standard $\\flex$ metric typically used to predict the true flexibility of a POP as measured by the number of linearizations it represents.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n DSHARP: Fast d-DNNF Compilation with sharpSAT (Amended Version).\n \n \n \n \n\n\n \n Muise, C.; McIlraith, S. A.; Beck, J. C.; and Hsu, E.\n\n\n \n\n\n\n In AAAI-16 Workshop on Beyond NP, 2016. \n \n\n\n\n
\n\n\n\n \n \n \"DSHARP: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{muise-beyondnp16-dsharp,\n  Title                    = {{DSHARP}: Fast d-DNNF Compilation with sharpSAT (Amended Version)},\n  Author                   = {Muise, Christian and McIlraith, Sheila A. and Beck, J.\nChristopher and Hsu, Eric},\n  Booktitle                = {AAAI-16 Workshop on Beyond NP},\n  Year                     = {2016},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://haz.ca/dsharp-related.html}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Strategy-Proofness in the Stable Matching Problem with Couples.\n \n \n \n \n\n\n \n Perrault, A.; Drummond, J.; and Bacchus, F.\n\n\n \n\n\n\n In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, Singapore, May 9-13, 2016, pages 132–140, 2016. \n \n\n\n\n
\n\n\n\n \n \n \"Strategy-ProofnessPaper\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{DBLP:conf/atal/PerraultDB16,\n  Title                    = {Strategy-Proofness in the Stable Matching Problem with Couples},\n  Author                   = {Andrew Perrault and\n Joanna Drummond and\n Fahiem Bacchus},\n  Booktitle                = {Proceedings of the 2016 International Conference on Autonomous Agents\n {\\&} Multiagent Systems, Singapore, May 9-13, 2016},\n  Year                     = {2016},\n  Pages                    = {132--140},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/atal/PerraultDB16},\n  Timestamp                = {Fri, 20 May 2016 20:33:29 +0200},\n  Url                      = {http://dl.acm.org/citation.cfm?id=2936947}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (19)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets.\n \n \n \n \n\n\n \n Bacchus, F.; and Katsirelos, G.\n\n\n \n\n\n\n In Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II, pages 70–86, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n\n \n \n doi\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{DBLP:conf/cav/BacchusK15,\n  Title                    = {Using Minimal Correction Sets to More Efficiently Compute Minimal\n Unsatisfiable Sets},\n  Author                   = {Fahiem Bacchus and\n George Katsirelos},\n  Booktitle                = {Computer Aided Verification - 27th International Conference, {CAV}\n 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part\n {II}},\n  Year                     = {2015},\n  Pages                    = {70--86},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/cav/BacchusK15},\n  Doi                      = {10.1007/978-3-319-21668-3\\_5},\n  Timestamp                = {Thu, 25 May 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-21668-3\\_5}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n ALLEGRO: Belief-Based Programming in Stochastic Dynamical Domains.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 2762–2769, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"ALLEGRO: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{DBLP:conf/ijcai/BelleL15a,\n  Title                    = {{ALLEGRO:} Belief-Based Programming in Stochastic Dynamical Domains},\n  Author                   = {Vaishak Belle and\n Hector J. Levesque},\n  Booktitle                = {Proceedings of the Twenty-Fourth International Joint Conference on\n Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July\n 25-31, 2015},\n  Year                     = {2015},\n  Pages                    = {2762--2769},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/BelleL15a},\n  Timestamp                = {Wed, 20 Jul 2016 15:18:06 +0200},\n  Url                      = {http://ijcai.org/Abstract/15/391}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Robot location estimation in the situation calculus.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n J. Applied Logic, 13(4): 397–413. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"RobotPaper\n  \n \n\n \n \n doi\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
@Article{DBLP:journals/japll/BelleL15,\n  Title                    = {Robot location estimation in the situation calculus},\n  Author                   = {Vaishak Belle and\n Hector J. Levesque},\n  Journal                  = {J. Applied Logic},\n  Year                     = {2015},\n  Number                   = {4},\n  Pages                    = {397--413},\n  Volume                   = {13},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/journals/japll/BelleL15},\n  Doi                      = {10.1016/j.jal.2015.02.004},\n  Timestamp                = {Thu, 18 May 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1016/j.jal.2015.02.004}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal social choice functions: A utilitarian view.\n \n \n \n \n\n\n \n Boutilier, C.; Caragiannis, I.; Haber, S.; Lu, T.; Procaccia, A. D.; and Sheffet, O.\n\n\n \n\n\n\n Artif. Intell., 227: 190–213. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n \n doi\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{DBLP:journals/ai/BoutilierCHLPS15,\n  Title                    = {Optimal social choice functions: {A} utilitarian view},\n  Author                   = {Craig Boutilier and\n Ioannis Caragiannis and\n Simi Haber and\n Tyler Lu and\n Ariel D. Procaccia and\n Or Sheffet},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2015},\n  Pages                    = {190--213},\n  Volume                   = {227},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/journals/ai/BoutilierCHLPS15},\n  Doi                      = {10.1016/j.artint.2015.06.003},\n  Timestamp                = {Sat, 27 May 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1016/j.artint.2015.06.003}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241).\n \n \n \n \n\n\n \n Boutilier, C.; Dorn, B.; Maudet, N.; and Merlin, V.\n\n\n \n\n\n\n Dagstuhl Reports, 5(6): 1–27. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"ComputationalPaper\n  \n \n\n \n \n doi\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
@Article{DBLP:journals/dagstuhl-reports/BoutilierDMM15,\n  Title                    = {Computational Social Choice: Theory and Applications (Dagstuhl Seminar\n 15241)},\n  Author                   = {Craig Boutilier and\n Britta Dorn and\n Nicolas Maudet and\n Vincent Merlin},\n  Journal                  = {Dagstuhl Reports},\n  Year                     = {2015},\n  Number                   = {6},\n  Pages                    = {1--27},\n  Volume                   = {5},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/journals/dagstuhl-reports/BoutilierDMM15},\n  Doi                      = {10.4230/DagRep.5.6.1},\n  Timestamp                = {Wed, 07 Jun 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.4230/DagRep.5.6.1}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n From FOND to Probabilistic Planning: Guiding search for quality policies.\n \n \n \n \n\n\n \n Camacho, A.; Muise, C.; Ganeshen, A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Workshop on Heuristic Search and Domain Independent Planning (HSDIP'15) at ICAPS, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"FromPaper\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\n\n\n
\n
@InProceedings{cam-etal-hsdip15,\n  Title                    = {From FOND to Probabilistic Planning: Guiding search for quality policies},\n  Author                   = {Alberto Camacho and Christian Muise and Akshay Ganeshen and Sheila A. McIlraith},\n  Booktitle                = {Workshop on Heuristic Search and Domain Independent Planning ({HSDIP}'15) at ICAPS},\n  Year                     = {2015},\n\n  Keywords                 = {non-deterministic planning, probabilistic planning, plan generation},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/cam-etal-hsdip15.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples.\n \n \n \n \n\n\n \n Drummond, J.; Perrault, A.; and Bacchus, F.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 518–525, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"SATPaper\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{DBLP:conf/ijcai/DrummondPB15,\n  Title                    = {{SAT} Is an Effective and Complete Method for Solving Stable Matching\n Problems with Couples},\n  Author                   = {Joanna Drummond and\n Andrew Perrault and\n Fahiem Bacchus},\n  Booktitle                = {Proceedings of the Twenty-Fourth International Joint Conference on\n Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July\n 25-31, 2015},\n  Year                     = {2015},\n  Pages                    = {518--525},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/DrummondPB15},\n  Timestamp                = {Wed, 20 Jul 2016 15:18:06 +0200},\n  Url                      = {http://ijcai.org/Abstract/15/079}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Adding DL-Lite TBoxes to Proper Knowledge Bases.\n \n \n \n \n\n\n \n De Giacomo, G.; and Levesque, H. J.\n\n\n \n\n\n\n In The Semantic Web - ISWC 2015 - 14th International Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part I, pages 305–321, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"AddingPaper\n  \n \n\n \n \n doi\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{DBLP:conf/semweb/GiacomoL15,\n  Title                    = {Adding DL-Lite TBoxes to Proper Knowledge Bases},\n  Author                   = {Giuseppe {De Giacomo} and\n Hector J. Levesque},\n  Booktitle                = {The Semantic Web - {ISWC} 2015 - 14th International Semantic Web Conference,\n Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part {I}},\n  Year                     = {2015},\n  Pages                    = {305--321},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/semweb/GiacomoL15},\n  Doi                      = {10.1007/978-3-319-25007-6\\_18},\n  Timestamp                = {Mon, 05 Jun 2017 12:38:38 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-25007-6\\_18}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Pricing War Continues: On Competitive Multi-Item Pricing.\n \n \n \n \n\n\n \n Lev, O.; Oren, J.; Boutilier, C.; and Rosenschein, J. S.\n\n\n \n\n\n\n In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA., pages 972–978, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{DBLP:conf/aaai/LevOBR15,\n  Title                    = {The Pricing War Continues: On Competitive Multi-Item Pricing},\n  Author                   = {Omer Lev and\n Joel Oren and\n Craig Boutilier and\n Jeffrey S. Rosenschein},\n  Booktitle                = {Proceedings of the Twenty-Ninth {AAAI} Conference on Artificial Intelligence,\n January 25-30, 2015, Austin, Texas, {USA.}},\n  Year                     = {2015},\n  Pages                    = {972--978},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/LevOBR15},\n  Timestamp                = {Sun, 12 Apr 2015 12:16:43 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9587}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination.\n \n \n \n \n\n\n \n Lonsing, F.; Bacchus, F.; Biere, A.; Egly, U.; and Seidl, M.\n\n\n \n\n\n\n In Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings, pages 418–433, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"EnhancingPaper\n  \n \n\n \n \n doi\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{DBLP:conf/lpar/LonsingBBES15,\n  Title                    = {Enhancing Search-Based {QBF} Solving by Dynamic Blocked Clause Elimination},\n  Author                   = {Florian Lonsing and\n Fahiem Bacchus and\n Armin Biere and\n Uwe Egly and\n Martina Seidl},\n  Booktitle                = {Logic for Programming, Artificial Intelligence, and Reasoning - 20th\n International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28,\n 2015, Proceedings},\n  Year                     = {2015},\n  Pages                    = {418--433},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/lpar/LonsingBBES15},\n  Doi                      = {10.1007/978-3-662-48899-7\\_29},\n  Timestamp                = {Tue, 23 May 2017 01:12:10 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-662-48899-7\\_29}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Value-Directed Compression of Large-Scale Assignment Problems.\n \n \n \n \n\n\n \n Lu, T.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA., pages 1182–1190, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"Value-DirectedPaper\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{DBLP:conf/aaai/LuB15,\n  Title                    = {Value-Directed Compression of Large-Scale Assignment Problems},\n  Author                   = {Tyler Lu and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Ninth {AAAI} Conference on Artificial Intelligence,\n January 25-30, 2015, Austin, Texas, {USA.}},\n  Year                     = {2015},\n  Pages                    = {1182--1190},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/LuB15},\n  Timestamp                = {Sun, 12 Apr 2015 12:16:43 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9557}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning Over Multi-Agent Epistemic States: A Classical Planning Approach.\n \n \n \n \n\n\n \n Muise, C.; Belle, V.; Felli, P.; McIlraith, S. A.; Miller, T.; Pearce, A. R.; and Sonenberg, L.\n\n\n \n\n\n\n In The 29th AAAI Conference on Artificial Intelligence (AAAI), 2015. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{mui-etal-aaai15,\n  Title                    = {Planning Over Multi-Agent Epistemic States: A Classical Planning Approach},\n  Author                   = {Christian Muise and Vaishak Belle and Paolo Felli and Sheila A. McIlraith and Tim Miller and Adrian R. Pearce and Liz Sonenberg},\n  Booktitle                = {The 29th AAAI Conference on Artificial Intelligence (AAAI)},\n  Year                     = {2015},\n\n  Keywords                 = {multi-agent planning, epistemic reasoning},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/mui-etal-aaai15.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning Over Multi-Agent Epistemic States: A Classical Planning Approach (Amended Version).\n \n \n \n \n\n\n \n Muise, C.; Belle, V.; Felli, P.; McIlraith, S. A.; Miller, T.; Pearce, A. R.; and Sonenberg, L.\n\n\n \n\n\n\n In Workshop on Distributed and Multi-Agent Planning (DMAP'15) at ICAPS, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{mui-etal-dmap15,\n  Title                    = {Planning Over Multi-Agent Epistemic States: A Classical Planning Approach (Amended Version)},\n  Author                   = {Christian Muise and Vaishak Belle and Paolo Felli and Sheila A. McIlraith and Tim Miller and Adrian R. Pearce and Liz Sonenberg},\n  Booktitle                = {Workshop on Distributed and Multi-Agent Planning ({DMAP}'15) at ICAPS},\n  Year                     = {2015},\n\n  Keywords                 = {multi-agent planning, epistemic reasoning},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/mui-etal-dmap15.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Approximately Stable Pricing for Coordinated Purchasing of Electricity.\n \n \n \n \n\n\n \n Perrault, A.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 2624–2631, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"ApproximatelyPaper\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{DBLP:conf/ijcai/PerraultB15,\n  Title                    = {Approximately Stable Pricing for Coordinated Purchasing of Electricity},\n  Author                   = {Andrew Perrault and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Fourth International Joint Conference on\n Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July\n 25-31, 2015},\n  Year                     = {2015},\n  Pages                    = {2624--2631},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/PerraultB15},\n  Timestamp                = {Wed, 20 Jul 2016 15:18:06 +0200},\n  Url                      = {http://ijcai.org/Abstract/15/372}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preference-oriented Social Networks: Group Recommendation and Inference.\n \n \n \n \n\n\n \n Salehi-Abari, A.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the 9th ACM Conference on Recommender Systems, RecSys 2015, Vienna, Austria, September 16-20, 2015, pages 35–42, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"Preference-orientedPaper\n  \n \n\n \n \n doi\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{DBLP:conf/recsys/Salehi-AbariB15,\n  Title                    = {Preference-oriented Social Networks: Group Recommendation and Inference},\n  Author                   = {Amirali Salehi{-}Abari and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the 9th {ACM} Conference on Recommender Systems, RecSys\n 2015, Vienna, Austria, September 16-20, 2015},\n  Year                     = {2015},\n  Pages                    = {35--42},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/recsys/Salehi-AbariB15},\n  Doi                      = {10.1145/2792838.2800190},\n  Timestamp                = {Tue, 08 Sep 2015 12:58:09 +0200},\n  Url                      = {http://doi.acm.org/10.1145/2792838.2800190}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal Group Manipulation in Facility Location Problems.\n \n \n \n \n\n\n \n Sui, X.; and Boutilier, C.\n\n\n \n\n\n\n In Algorithmic Decision Theory - 4th International Conference, ADT 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings, pages 505–520, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n \n doi\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{DBLP:conf/aldt/SuiB15,\n  Title                    = {Optimal Group Manipulation in Facility Location Problems},\n  Author                   = {Xin Sui and\n Craig Boutilier},\n  Booktitle                = {Algorithmic Decision Theory - 4th International Conference, {ADT}\n 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings},\n  Year                     = {2015},\n  Pages                    = {505--520},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aldt/SuiB15},\n  Doi                      = {10.1007/978-3-319-23114-3\\_30},\n  Timestamp                = {Tue, 23 May 2017 01:10:53 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-23114-3\\_30}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Approximately Strategy-proof Mechanisms for (Constrained) Facility Location.\n \n \n \n \n\n\n \n Sui, X.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015, pages 605–613, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"ApproximatelyPaper\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{DBLP:conf/atal/SuiB15,\n  Title                    = {Approximately Strategy-proof Mechanisms for (Constrained) Facility\n Location},\n  Author                   = {Xin Sui and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the 2015 International Conference on Autonomous Agents\n and Multiagent Systems, {AAMAS} 2015, Istanbul, Turkey, May 4-8, 2015},\n  Year                     = {2015},\n  Pages                    = {605--613},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/atal/SuiB15},\n  Timestamp                = {Fri, 15 May 2015 16:18:42 +0200},\n  Url                      = {http://dl.acm.org/citation.cfm?id=2773233}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Unifying Framework for Planning with LTL and Regular Expressions.\n \n \n \n \n\n\n \n Triantafillou, E.; Baier, J.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Workshop on Model-Checking and Automated Planning (MOCHAP) at ICAPS, pages 23-31, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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\n\n\n
\n
@InProceedings{tri-etal-mochap15,\n  Title                    = {A Unifying Framework for Planning with LTL and Regular Expressions},\n  Author                   = {Eleni Triantafillou and Jorge Baier and Sheila McIlraith},\n  Booktitle                = {Proceedings of the Workshop on Model-Checking and Automated Planning (MOCHAP) at ICAPS},\n  Year                     = {2015},\n  Pages                    = {23-31},\n\n  Keywords                 = {planning, LTL, LDL},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/tri-etal-mochap15.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Towards Planning the Transformation of Overlays.\n \n \n \n\n\n \n Yoon, Y.; Robinson, N.; Muthusamy, V.; McIlraith, S. A.; and Jacobsen, H.\n\n\n \n\n\n\n In 35th IEEE International Conference on Distributed Computing Systems, (ICDCS), pages 782–783, 2015. \n \n\n\n\n
\n\n\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{yoon-etal-icdcs15,\n  Title                    = {Towards Planning the Transformation of Overlays},\n  Author                   = {Young Yoon and\n Nathan Robinson and\n Vinod Muthusamy and\n Sheila A. McIlraith and\n Hans{-}Arno Jacobsen},\n  Booktitle                = {35th {IEEE} International Conference on Distributed Computing Systems,\n ({ICDCS})},\n  Year                     = {2015},\n  Pages                    = {782--783},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (23)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Relaxation Search: A Simple Way of Managing Optional Clauses.\n \n \n \n \n\n\n \n Bacchus, F.; Davies, J.; Tsimpoukelli, M.; and Katsirelos, G.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada., pages 835–841, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"RelaxationPaper\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{DBLP:conf/aaai/BacchusDTK14,\n  Title                    = {Relaxation Search: {A} Simple Way of Managing Optional Clauses},\n  Author                   = {Fahiem Bacchus and\n Jessica Davies and\n Maria Tsimpoukelli and\n George Katsirelos},\n  Booktitle                = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,\n July 27 -31, 2014, Qu{\\'{e}}bec City, Qu{\\'{e}}bec, Canada.},\n  Year                     = {2014},\n  Pages                    = {835--841},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/BacchusDTK14},\n  Timestamp                = {Thu, 31 Jul 2014 08:59:54 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8618}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Cores in Core Based MaxSat Algorithms: An Analysis.\n \n \n \n \n\n\n \n Bacchus, F.; and Narodytska, N.\n\n\n \n\n\n\n In Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings, pages 7–15, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"CoresPaper\n  \n \n\n \n \n doi\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{DBLP:conf/sat/BacchusN14,\n  Title                    = {Cores in Core Based MaxSat Algorithms: An Analysis},\n  Author                   = {Fahiem Bacchus and\n Nina Narodytska},\n  Booktitle                = {Theory and Applications of Satisfiability Testing - {SAT} 2014 - 17th\n International Conference, Held as Part of the Vienna Summer of Logic,\n {VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},\n  Year                     = {2014},\n  Pages                    = {7--15},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/sat/BacchusN14},\n  Doi                      = {10.1007/978-3-319-09284-3\\_2},\n  Timestamp                = {Tue, 23 May 2017 01:08:19 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-09284-3\\_2}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals.\n \n \n \n \n\n\n \n Baier, J. A.; Mombourquette, B.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2014. \n \n\n\n\n
\n\n\n\n \n \n \"DiagnosticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 71 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{bai-mom-mci-kr14,\n  Title                    = {Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals},\n  Author                   = {Jorge A. Baier and Brent Mombourquette and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR)},\n  Year                     = {2014},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/bai-mom-mci-kr14.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n PREGO: An Action Language for Belief-Based Cognitive Robotics in Continuous Domains.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada., pages 989–995, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"PREGO:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 33 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/aaai/BelleL14,\n  Title                    = {{PREGO:} An Action Language for Belief-Based Cognitive Robotics in\n Continuous Domains},\n  Author                   = {Vaishak Belle and\n Hector J. Levesque},\n  Booktitle                = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,\n July 27 -31, 2014, Qu{\\'{e}}bec City, Qu{\\'{e}}bec, Canada.},\n  Year                     = {2014},\n  Pages                    = {989--995},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/BelleL14},\n  Timestamp                = {Thu, 31 Jul 2014 08:59:54 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8453}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A logical theory of robot localization.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n In International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '14, Paris, France, May 5-9, 2014, pages 349–356, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 16 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/atal/BelleL14,\n  Title                    = {A logical theory of robot localization},\n  Author                   = {Vaishak Belle and\n Hector J. Levesque},\n  Booktitle                = {International conference on Autonomous Agents and Multi-Agent Systems,\n {AAMAS} '14, Paris, France, May 5-9, 2014},\n  Year                     = {2014},\n  Pages                    = {349--356},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/atal/BelleL14},\n  Timestamp                = {Thu, 25 Sep 2014 07:46:15 +0200},\n  Url                      = {http://dl.acm.org/citation.cfm?id=2615789}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n How to Progress Beliefs in Continuous Domains.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"HowPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 21 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/kr/BelleL14,\n  Title                    = {How to Progress Beliefs in Continuous Domains},\n  Author                   = {Vaishak Belle and\n Hector J. Levesque},\n  Booktitle                = {Principles of Knowledge Representation and Reasoning: Proceedings\n of the Fourteenth International Conference, {KR} 2014, Vienna, Austria,\n July 20-24, 2014},\n  Year                     = {2014},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/kr/BelleL14},\n  Timestamp                = {Thu, 31 Jul 2014 10:24:17 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7998}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Robust Winners and Winner Determination Policies under Candidate Uncertainty.\n \n \n \n \n\n\n \n Boutilier, C.; Lang, J.; Oren, J.; and Palacios, H.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada., pages 1391–1397, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"RobustPaper\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{DBLP:conf/aaai/BoutilierLOP14,\n  Title                    = {Robust Winners and Winner Determination Policies under Candidate Uncertainty},\n  Author                   = {Craig Boutilier and\n J{\\'{e}}r{\\^{o}}me Lang and\n Joel Oren and\n H{\\'{e}}ctor Palacios},\n  Booktitle                = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,\n July 27 -31, 2014, Qu{\\'{e}}bec City, Qu{\\'{e}}bec, Canada.},\n  Year                     = {2014},\n  Pages                    = {1391--1397},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/BoutilierLOP14},\n  Timestamp                = {Thu, 31 Jul 2014 08:59:54 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8648}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preference Elicitation and Interview Minimization in Stable Matchings.\n \n \n \n \n\n\n \n Drummond, J.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada., pages 645–653, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"PreferencePaper\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{DBLP:conf/aaai/DrummondB14,\n  Title                    = {Preference Elicitation and Interview Minimization in Stable Matchings},\n  Author                   = {Joanna Drummond and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,\n July 27 -31, 2014, Qu{\\'{e}}bec City, Qu{\\'{e}}bec, Canada.},\n  Year                     = {2014},\n  Pages                    = {645--653},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/DrummondB14},\n  Timestamp                = {Thu, 31 Jul 2014 08:59:54 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8585}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decidable Reasoning in a Fragment of the Epistemic Situation Calculus.\n \n \n \n \n\n\n \n Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"DecidablePaper\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{DBLP:conf/kr/LakemeyerL14,\n  Title                    = {Decidable Reasoning in a Fragment of the Epistemic Situation Calculus},\n  Author                   = {Gerhard Lakemeyer and\n Hector J. Levesque},\n  Booktitle                = {Principles of Knowledge Representation and Reasoning: Proceedings\n of the Fourteenth International Conference, {KR} 2014, Vienna, Austria,\n July 20-24, 2014},\n  Year                     = {2014},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/kr/LakemeyerL14},\n  Timestamp                = {Thu, 31 Jul 2014 10:24:17 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7990}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On our best behaviour.\n \n \n \n \n\n\n \n Levesque, H. J.\n\n\n \n\n\n\n Artif. Intell., 212: 27–35. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\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
@Article{DBLP:journals/ai/Levesque14,\n  Title                    = {On our best behaviour},\n  Author                   = {Hector J. Levesque},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2014},\n  Pages                    = {27--35},\n  Volume                   = {212},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/journals/ai/Levesque14},\n  Doi                      = {10.1016/j.artint.2014.03.007},\n  Timestamp                = {Sat, 27 May 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1016/j.artint.2014.03.007}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Incorporating Action Models into the Situation Calculus.\n \n \n \n \n\n\n \n Liu, Y.; and Levesque, H. J.\n\n\n \n\n\n\n In Johan van Benthem on Logic and Information Dynamics, pages 569–590. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"IncorporatingPaper\n  \n \n\n \n \n doi\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
@InCollection{DBLP:books/daglib/p/0001L14,\n  Title                    = {Incorporating Action Models into the Situation Calculus},\n  Author                   = {Yongmei Liu and\n Hector J. Levesque},\n  Booktitle                = {Johan van Benthem on Logic and Information Dynamics},\n  Year                     = {2014},\n  Pages                    = {569--590},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/books/daglib/p/0001L14},\n  Doi                      = {10.1007/978-3-319-06025-5\\_21},\n  Timestamp                = {Tue, 16 May 2017 14:01:33 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-06025-5\\_21}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Effective sampling and learning for mallows models with pairwise-preference data.\n \n \n \n \n\n\n \n Lu, T.; and Boutilier, C.\n\n\n \n\n\n\n Journal of Machine Learning Research, 15(1): 3783–3829. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"EffectivePaper\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{DBLP:journals/jmlr/LuB14,\n  Title                    = {Effective sampling and learning for mallows models with pairwise-preference\n data},\n  Author                   = {Tyler Lu and\n Craig Boutilier},\n  Journal                  = {Journal of Machine Learning Research},\n  Year                     = {2014},\n  Number                   = {1},\n  Pages                    = {3783--3829},\n  Volume                   = {15},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/journals/jmlr/LuB14},\n  Timestamp                = {Mon, 27 Apr 2015 01:00:00 +0200},\n  Url                      = {http://dl.acm.org/citation.cfm?id=2750366}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the value of using group discounts under price competition.\n \n \n \n \n\n\n \n Meir, R.; Lu, T.; Tennenholtz, M.; and Boutilier, C.\n\n\n \n\n\n\n Artif. Intell., 216: 163–178. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\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{DBLP:journals/ai/MeirLTB14,\n  Title                    = {On the value of using group discounts under price competition},\n  Author                   = {Reshef Meir and\n Tyler Lu and\n Moshe Tennenholtz and\n Craig Boutilier},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2014},\n  Pages                    = {163--178},\n  Volume                   = {216},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/journals/ai/MeirLTB14},\n  Doi                      = {10.1016/j.artint.2014.07.002},\n  Timestamp                = {Sat, 27 May 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1016/j.artint.2014.07.002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computing Contingent Plans via Fully Observable Non-Deterministic Planning.\n \n \n \n \n\n\n \n Muise, C.; Belle, V.; and McIlraith, S. A.\n\n\n \n\n\n\n In The 28th AAAI Conference on Artificial Intelligence (AAAI), 2014. \n \n\n\n\n
\n\n\n\n \n \n \"ComputingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 65 downloads\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
\n
@InProceedings{mui-bel-mci-aaai14,\n  Title                    = {Computing Contingent Plans via Fully Observable Non-Deterministic Planning},\n  Author                   = {Muise, Christian and Belle, Vaishak and McIlraith, Sheila A.},\n  Booktitle                = {The 28th AAAI Conference on Artificial Intelligence (AAAI)},\n  Year                     = {2014},\n\n  Keywords                 = {non-deterministic planning, plan generation, partial observability, sensing},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/mui-bel-mci-aaai14.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Non-Deterministic Planning With Conditional Effects.\n \n \n \n \n\n\n \n Muise, C.; McIlraith, S. A.; and Belle, V.\n\n\n \n\n\n\n In The 24th International Conference on Automated Planning and Scheduling (ICAPS), 2014. \n \n\n\n\n
\n\n\n\n \n \n \"Non-DeterministicPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 53 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{mui-mci-bel-icaps14,\n  Title                    = {Non-Deterministic Planning With Conditional Effects},\n  Author                   = {Muise, Christian and McIlraith, Sheila A. and Belle, Vaishak},\n  Booktitle                = {The 24th International Conference on Automated Planning and Scheduling (ICAPS)},\n  Year                     = {2014},\n\n  Keywords                 = {non-deterministic planning, plan generation},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/mui-mci-bel-icaps14.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Maximum Satisfiability Using Core-Guided MaxSAT Resolution.\n \n \n \n \n\n\n \n Narodytska, N.; and Bacchus, F.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada., pages 2717–2723, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"MaximumPaper\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{DBLP:conf/aaai/NarodytskaB14,\n  Title                    = {Maximum Satisfiability Using Core-Guided MaxSAT Resolution},\n  Author                   = {Nina Narodytska and\n Fahiem Bacchus},\n  Booktitle                = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,\n July 27 -31, 2014, Qu{\\'{e}}bec City, Qu{\\'{e}}bec, Canada.},\n  Year                     = {2014},\n  Pages                    = {2717--2723},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/NarodytskaB14},\n  Timestamp                = {Thu, 31 Jul 2014 08:59:54 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8513}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Solving Games without Controllable Predecessor.\n \n \n \n \n\n\n \n Narodytska, N.; Legg, A.; Bacchus, F.; Ryzhyk, L.; and Walker, A.\n\n\n \n\n\n\n In Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings, pages 533–540, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"SolvingPaper\n  \n \n\n \n \n doi\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{DBLP:conf/cav/NarodytskaLBRW14,\n  Title                    = {Solving Games without Controllable Predecessor},\n  Author                   = {Nina Narodytska and\n Alexander Legg and\n Fahiem Bacchus and\n Leonid Ryzhyk and\n Adam Walker},\n  Booktitle                = {Computer Aided Verification - 26th International Conference, {CAV}\n 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna,\n Austria, July 18-22, 2014. Proceedings},\n  Year                     = {2014},\n  Pages                    = {533--540},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/cav/NarodytskaLBRW14},\n  Doi                      = {10.1007/978-3-319-08867-9\\_35},\n  Timestamp                = {Thu, 25 May 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-319-08867-9\\_35}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Regret-Based Optimization and Preference Elicitation for Stackelberg Security Games with Uncertainty.\n \n \n \n \n\n\n \n Nguyen, T. H.; Yadav, A.; An, B.; Tambe, M.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada., pages 756–762, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"Regret-BasedPaper\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{DBLP:conf/aaai/NguyenYATB14,\n  Title                    = {Regret-Based Optimization and Preference Elicitation for Stackelberg\n Security Games with Uncertainty},\n  Author                   = {Thanh Hong Nguyen and\n Amulya Yadav and\n Bo An and\n Milind Tambe and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,\n July 27 -31, 2014, Qu{\\'{e}}bec City, Qu{\\'{e}}bec, Canada.},\n  Year                     = {2014},\n  Pages                    = {756--762},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/NguyenYATB14},\n  Timestamp                = {Thu, 31 Jul 2014 08:59:54 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8346}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Game-Theoretic Analysis of Catalog Optimization.\n \n \n \n \n\n\n \n Oren, J.; Narodytska, N.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada., pages 1463–1470, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{DBLP:conf/aaai/OrenNB14,\n  Title                    = {A Game-Theoretic Analysis of Catalog Optimization},\n  Author                   = {Joel Oren and\n Nina Narodytska and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,\n July 27 -31, 2014, Qu{\\'{e}}bec City, Qu{\\'{e}}bec, Canada.},\n  Year                     = {2014},\n  Pages                    = {1463--1470},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/OrenNB14},\n  Timestamp                = {Thu, 31 Jul 2014 08:59:54 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8434}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient coordinated power distribution on private infrastructure.\n \n \n \n \n\n\n \n Perrault, A.; and Boutilier, C.\n\n\n \n\n\n\n In International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '14, Paris, France, May 5-9, 2014, pages 805–812, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\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{DBLP:conf/atal/PerraultB14,\n  Title                    = {Efficient coordinated power distribution on private infrastructure},\n  Author                   = {Andrew Perrault and\n Craig Boutilier},\n  Booktitle                = {International conference on Autonomous Agents and Multi-Agent Systems,\n {AAMAS} '14, Paris, France, May 5-9, 2014},\n  Year                     = {2014},\n  Pages                    = {805--812},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/atal/PerraultB14},\n  Timestamp                = {Thu, 25 Sep 2014 07:46:15 +0200},\n  Url                      = {http://dl.acm.org/citation.cfm?id=2615861}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Forgetting in Action.\n \n \n \n \n\n\n \n Rajaratnam, D.; Levesque, H. J.; Pagnucco, M.; and Thielscher, M.\n\n\n \n\n\n\n In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"ForgettingPaper\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{DBLP:conf/kr/RajaratnamLPT14,\n  Title                    = {Forgetting in Action},\n  Author                   = {David Rajaratnam and\n Hector J. Levesque and\n Maurice Pagnucco and\n Michael Thielscher},\n  Booktitle                = {Principles of Knowledge Representation and Reasoning: Proceedings\n of the Fourteenth International Conference, {KR} 2014, Vienna, Austria,\n July 20-24, 2014},\n  Year                     = {2014},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/kr/RajaratnamLPT14},\n  Timestamp                = {Thu, 31 Jul 2014 10:24:17 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7983}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Generating effective tests for concurrent programs via AI automated planning techniques.\n \n \n \n\n\n \n Razavi, N.; Farzan, A.; and McIlraith, S. A.\n\n\n \n\n\n\n International Journal on Software Tools for Technology Transfer (STTT), 16(1): 49–65. 2014.\n \n\n\n\n
\n\n\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{raz-far-mci-sttt14,\n  Title                    = {Generating effective tests for concurrent programs via {AI} automated\n planning techniques},\n  Author                   = {Niloofar Razavi and\n Azadeh Farzan and\n Sheila A. McIlraith},\n  Journal                  = {International Journal on Software Tools for Technology Transfer ({STTT})},\n  Year                     = {2014},\n  Number                   = {1},\n  Pages                    = {49--65},\n  Volume                   = {16},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Empathetic social choice on social networks.\n \n \n \n \n\n\n \n Salehi-Abari, A.; and Boutilier, C.\n\n\n \n\n\n\n In International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '14, Paris, France, May 5-9, 2014, pages 693–700, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"EmpatheticPaper\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{DBLP:conf/atal/Salehi-AbariB14,\n  Title                    = {Empathetic social choice on social networks},\n  Author                   = {Amirali Salehi{-}Abari and\n Craig Boutilier},\n  Booktitle                = {International conference on Autonomous Agents and Multi-Agent Systems,\n {AAMAS} '14, Paris, France, May 5-9, 2014},\n  Year                     = {2014},\n  Pages                    = {693--700},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/atal/Salehi-AbariB14},\n  Timestamp                = {Thu, 25 Sep 2014 07:46:15 +0200},\n  Url                      = {http://dl.acm.org/citation.cfm?id=2615843}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (24)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Reasoning about Continuous Uncertainty in the Situation Calculus.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n In Proc. IJCAI, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 35 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{bellelev13,\n  Title                    = {Reasoning about Continuous Uncertainty in the Situation Calculus},\n  Author                   = {V. Belle and H. J. Levesque},\n  Booktitle                = {Proc. IJCAI},\n  Year                     = {2013},\n\n  Bdsk-url-1               = {http://d.pr/f/dcy6},\n  Date-added               = {2013-05-09 18:21:09 -0400},\n  Date-modified            = {2013-06-10 15:31:43 -0400},\n  Timestamp                = {2018.09.23},\n  Url                      = {https://dl.dropboxusercontent.com/u/1282419/Papers/ijcai13.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Robot Location Estimation in the Situation Calculus.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n In Symposium on Logical Formalizations of Commonsense Reasoning, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"RobotPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 19 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{bellelevcs,\n  Title                    = {Robot Location Estimation in the Situation Calculus},\n  Author                   = {V. Belle and H. J. Levesque},\n  Booktitle                = {Symposium on Logical Formalizations of Commonsense Reasoning},\n  Year                     = {2013},\n\n  Bdsk-url-1               = {http://d.pr/f/z2Jd},\n  Date-added               = {2013-05-09 18:21:09 -0400},\n  Date-modified            = {2013-06-10 15:34:21 -0400},\n  Timestamp                = {2018.09.23},\n  Url                      = {https://dl.dropboxusercontent.com/u/1282419/Papers/commonsense13.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasoning about Probabilities in Dynamic Systems using Goal Regression.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n In Proc. Uncertainty in Artificial Intelligence (UAI), 2013. \n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 33 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{BelleLevreg,\n  Title                    = {Reasoning about Probabilities in Dynamic Systems using Goal Regression},\n  Author                   = {V. Belle and H. J. Levesque},\n  Booktitle                = {Proc. Uncertainty in Artificial Intelligence (UAI)},\n  Year                     = {2013},\n\n  Bdsk-url-1               = {http://d.pr/f/z2Jd},\n  Date-added               = {2013-05-09 18:21:09 -0400},\n  Date-modified            = {2013-06-10 15:33:56 -0400},\n  Timestamp                = {2018.09.23},\n  Url                      = {https://dl.dropboxusercontent.com/u/1282419/Papers/uai13.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasoning about Motion Kinematics with Continuous Uncertainty in the Situation Calculus.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n In Workshop on Nonmonotonic Reasoning, Action and Change, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 18 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{bellevmotionkinematics,\n  Title                    = {Reasoning about Motion Kinematics with Continuous Uncertainty in the Situation Calculus},\n  Author                   = {V. Belle and H. J. Levesque},\n  Booktitle                = {Workshop on Nonmonotonic Reasoning, Action and Change},\n  Year                     = {2013},\n\n  Bdsk-url-1               = {http://d.pr/f/A7Uy},\n  Date-added               = {2013-05-23 10:48:57 -0400},\n  Date-modified            = {2013-06-10 15:35:32 -0400},\n  Timestamp                = {2018.09.23},\n  Url                      = {https://dl.dropboxusercontent.com/u/1282419/Papers/nrac13.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Postponing Optimization to Speed Up MAXSAT Solving.\n \n \n \n \n\n\n \n Davies, J.; and Bacchus, F.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, pages 247–262, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"PostponingPaper\n  \n \n\n \n \n doi\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{DBLP:conf/cp/DaviesB13,\n  Title                    = {Postponing Optimization to Speed Up {MAXSAT} Solving},\n  Author                   = {Jessica Davies and\n Fahiem Bacchus},\n  Booktitle                = {Principles and Practice of Constraint Programming - 19th International\n Conference, {CP} 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings},\n  Year                     = {2013},\n  Pages                    = {247--262},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/cp/DaviesB13},\n  Doi                      = {10.1007/978-3-642-40627-0\\_21},\n  Timestamp                = {Tue, 26 Dec 2017 15:02:23 +0100},\n  Url                      = {https://doi.org/10.1007/978-3-642-40627-0\\_21}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting the Power of mip Solvers in maxsat.\n \n \n \n \n\n\n \n Davies, J.; and Bacchus, F.\n\n\n \n\n\n\n In Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings, pages 166–181, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"ExploitingPaper\n  \n \n\n \n \n doi\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{DBLP:conf/sat/DaviesB13,\n  Title                    = {Exploiting the Power of mip Solvers in maxsat},\n  Author                   = {Jessica Davies and\n Fahiem Bacchus},\n  Booktitle                = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th\n International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},\n  Year                     = {2013},\n  Pages                    = {166--181},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/sat/DaviesB13},\n  Doi                      = {10.1007/978-3-642-39071-5\\_13},\n  Timestamp                = {Thu, 15 Jun 2017 21:39:14 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-642-39071-5\\_13}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Assumption-Based Planning: Generating Plans and Explanations under Incomplete Knowledge.\n \n \n \n \n\n\n \n Davis-Mendelow, S.; Baier, J. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI), 2013. \n \n\n\n\n
\n\n\n\n \n \n \"Assumption-BasedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 38 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{dav-bai-mci-aaai13,\n  Title                    = {Assumption-Based Planning: Generating Plans and Explanations\n under Incomplete Knowledge},\n  Author                   = {Sammy Davis-Mendelow and\n Jorge A. Baier and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Twenty-Seventh AAAI Conference on Artificial\n Intelligence (AAAI)},\n  Year                     = {2013},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/dav-bai-mci-aaai13.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Formal Account of Nondeterministic and Failed Actions.\n \n \n \n \n\n\n \n Delgrande, J. P.; and Levesque, H. J.\n\n\n \n\n\n\n In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, pages 861–868, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{DBLP:conf/ijcai/DelgrandeL13,\n  Title                    = {A Formal Account of Nondeterministic and Failed Actions},\n  Author                   = {James P. Delgrande and\n Hector J. Levesque},\n  Booktitle                = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference\n on Artificial Intelligence, Beijing, China, August 3-9, 2013},\n  Year                     = {2013},\n  Pages                    = {861--868},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/DelgrandeL13},\n  Timestamp                = {Wed, 20 Jul 2016 15:16:56 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6661}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Solving Weighted CSPs by Successive Relaxations.\n \n \n \n \n\n\n \n Delisle, E.; and Bacchus, F.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, pages 273–281, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"SolvingPaper\n  \n \n\n \n \n doi\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{DBLP:conf/cp/DelisleB13,\n  Title                    = {Solving Weighted CSPs by Successive Relaxations},\n  Author                   = {Erin Delisle and\n Fahiem Bacchus},\n  Booktitle                = {Principles and Practice of Constraint Programming - 19th International\n Conference, {CP} 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings},\n  Year                     = {2013},\n  Pages                    = {273--281},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/cp/DelisleB13},\n  Doi                      = {10.1007/978-3-642-40627-0\\_23},\n  Timestamp                = {Tue, 26 Dec 2017 15:02:23 +0100},\n  Url                      = {https://doi.org/10.1007/978-3-642-40627-0\\_23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Elicitation and Approximately Stable Matching with Partial Preferences.\n \n \n \n \n\n\n \n Drummond, J.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI-13), Beijing, pages 97–105, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"ElicitationPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{drummond2013elicitation,\n  Title                    = {Elicitation and Approximately Stable Matching with Partial Preferences},\n  Author                   = {Drummond, Joanna and Boutilier, Craig},\n  Booktitle                = {Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI-13), Beijing},\n  Year                     = {2013},\n  Pages                    = {97--105},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~cebly/Papers/DrummondBoutilier_MatchingMMR_ijcai13.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Recovering and Utilizing Partial Duality in QBF.\n \n \n \n \n\n\n \n Goultiaeva, A.; and Bacchus, F.\n\n\n \n\n\n\n In Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings, pages 83–99, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"RecoveringPaper\n  \n \n\n \n \n doi\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{DBLP:conf/sat/GoultiaevaB13,\n  Title                    = {Recovering and Utilizing Partial Duality in {QBF}},\n  Author                   = {Alexandra Goultiaeva and\n Fahiem Bacchus},\n  Booktitle                = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th\n International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},\n  Year                     = {2013},\n  Pages                    = {83--99},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/sat/GoultiaevaB13},\n  Doi                      = {10.1007/978-3-642-39071-5\\_8},\n  Timestamp                = {Thu, 15 Jun 2017 21:39:14 +0200},\n  Url                      = {https://doi.org/10.1007/978-3-642-39071-5\\_8}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n SPARQL with Qualitative and Quantitative Preferences.\n \n \n \n\n\n \n Gueroussova, M.; Polleres, A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 2nd International Workshop on Ordering and Reasoning, 2013. \n \n\n\n\n
\n\n\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{gue-pol-mci-iswc13,\n  Title                    = {{SPARQL} with Qualitative and Quantitative Preferences},\n  Author                   = {Marina Gueroussova and Axel Polleres and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 2nd International Workshop on Ordering and Reasoning},\n  Year                     = {2013},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SAT-based Analysis and Quantification of Information Flow in Programs.\n \n \n \n \n\n\n \n Klebanov, V.; Manthey, N.; and Muise, C.\n\n\n \n\n\n\n In 10th International Conference on Quantitative Evaluation of SysTems (QEST 2013), pages 177–192, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"SAT-basedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 61 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{klebanovsat,\n  Title                    = {{SAT-based Analysis and Quantification of Information Flow in Programs}},\n  Author                   = {Klebanov, Vladimir and Manthey, Norbert and Muise, Christian},\n  Booktitle                = {10th International Conference on Quantitative Evaluation of SysTems (QEST 2013)},\n  Year                     = {2013},\n  Pages                    = {177--192},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://formal.iti.kit.edu/~klebanov/pubs/qest2013.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decidable Reasoning in a Logic of Limited Belief with Introspection and Unknown Individuals.\n \n \n \n \n\n\n \n Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, pages 969–975, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"DecidablePaper\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{DBLP:conf/ijcai/LakemeyerL13,\n  Title                    = {Decidable Reasoning in a Logic of Limited Belief with Introspection\n and Unknown Individuals},\n  Author                   = {Gerhard Lakemeyer and\n Hector J. Levesque},\n  Booktitle                = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference\n on Artificial Intelligence, Beijing, China, August 3-9, 2013},\n  Year                     = {2013},\n  Pages                    = {969--975},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/LakemeyerL13},\n  Timestamp                = {Wed, 20 Jul 2016 15:16:56 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6638}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Multi-Winner Social Choice with Incomplete Preferences.\n \n \n \n \n\n\n \n Lu, T.; and Boutilier, C.\n\n\n \n\n\n\n In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, pages 263–270, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"Multi-WinnerPaper\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{DBLP:conf/ijcai/LuB13,\n  Title                    = {Multi-Winner Social Choice with Incomplete Preferences},\n  Author                   = {Tyler Lu and\n Craig Boutilier},\n  Booktitle                = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference\n on Artificial Intelligence, Beijing, China, August 3-9, 2013},\n  Year                     = {2013},\n  Pages                    = {263--270},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/LuB13},\n  Timestamp                = {Wed, 20 Jul 2016 15:16:56 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6717}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Value of Using Group Discounts under Price Competition.\n \n \n \n \n\n\n \n Meir, R.; Lu, T.; Tennenholtz, M.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA., 2013. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{DBLP:conf/aaai/MeirLTB13,\n  Title                    = {On the Value of Using Group Discounts under Price Competition},\n  Author                   = {Reshef Meir and\n Tyler Lu and\n Moshe Tennenholtz and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Seventh {AAAI} Conference on Artificial\n Intelligence, July 14-18, 2013, Bellevue, Washington, {USA.}},\n  Year                     = {2013},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aaai/MeirLTB13},\n  Timestamp                = {Tue, 17 Dec 2013 19:26:12 +0100},\n  Url                      = {http://www.aaai.org/ocs/index.php/AAAI/AAAI13/paper/view/6386}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Flexible Execution of Partial Order Plans With Temporal Constraints.\n \n \n \n\n\n \n Muise, C.; Beck, J. C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Workshop on Planning in Continuous Domains, 2013. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{mui-bec-mci-icaps13,\n  Title                    = {Flexible Execution of Partial Order Plans With Temporal Constraints},\n  Author                   = {Christian Muise and J. Christopher Beck and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Workshop on Planning in Continuous Domains},\n  Year                     = {2013},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Flexible Execution of Partial Order Plans With Temporal Constraints.\n \n \n \n \n\n\n \n Muise, C.; Beck, J. C.; and Mcilraith, S. A.\n\n\n \n\n\n\n In International Joint Conference On Artificial Intelligence, pages 2328–2335, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"FlexiblePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{muise-ijcai-13,\n  Title                    = {{Flexible Execution of Partial Order Plans With Temporal Constraints}},\n  Author                   = {Muise, Christian and Beck, J. Christopher and Mcilraith, Sheila A.},\n  Booktitle                = {International Joint Conference On Artificial Intelligence},\n  Year                     = {2013},\n  Pages                    = {2328--2335},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://ijcai.org/papers13/Papers/IJCAI13-343.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Flexible Execution of Partial Order Plans With Temporal Constraints.\n \n \n \n\n\n \n Muise, C. J.; Beck, J. C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), 2013. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{mui-bec-mci-ijcai13,\n  Title                    = {Flexible Execution of Partial Order Plans With Temporal\n Constraints},\n  Author                   = {Christian J. Muise and\n J. Christopher Beck and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI)},\n  Year                     = {2013},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient Vote Elicitation under Candidate Uncertainty.\n \n \n \n \n\n\n \n Oren, J.; Filmus, Y.; and Boutilier, C.\n\n\n \n\n\n\n In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, pages 309–316, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\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{DBLP:conf/ijcai/OrenFB13,\n  Title                    = {Efficient Vote Elicitation under Candidate Uncertainty},\n  Author                   = {Joel Oren and\n Yuval Filmus and\n Craig Boutilier},\n  Booktitle                = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference\n on Artificial Intelligence, Beijing, China, August 3-9, 2013},\n  Year                     = {2013},\n  Pages                    = {309--316},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/OrenFB13},\n  Timestamp                = {Wed, 20 Jul 2016 15:16:56 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6710}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Query Optimization Revisited: An AI Planning Perspective.\n \n \n \n\n\n \n Robinson, N.; McIlraith, S. A.; and Toman, D.\n\n\n \n\n\n\n In Proceedings of the Scheduling and Planning Applications Workshop (SPARK), 2013. \n \n\n\n\n
\n\n\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{rob-mci-tom-icaps13,\n  Title                    = {Query Optimization Revisited: An AI Planning Perspective},\n  Author                   = {Nathan Robinson and Sheila A. McIlraith and David Toman},\n  Booktitle                = {Proceedings of the Scheduling and Planning Applications\n Workshop (SPARK)},\n  Year                     = {2013},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Analysis and Optimization of Multi-Dimensional Percentile Mechanisms.\n \n \n \n \n\n\n \n Sui, X.; Boutilier, C.; and Sandholm, T.\n\n\n \n\n\n\n In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, pages 367–374, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"AnalysisPaper\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{DBLP:conf/ijcai/SuiBS13,\n  Title                    = {Analysis and Optimization of Multi-Dimensional Percentile Mechanisms},\n  Author                   = {Xin Sui and\n Craig Boutilier and\n Tuomas Sandholm},\n  Booktitle                = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference\n on Artificial Intelligence, Beijing, China, August 3-9, 2013},\n  Year                     = {2013},\n  Pages                    = {367--374},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/SuiBS13},\n  Timestamp                = {Wed, 20 Jul 2016 15:16:56 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6679}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Multi-Dimensional Single-Peaked Consistency and Its Approximations.\n \n \n \n \n\n\n \n Sui, X.; Francois-Nienaber, A.; and Boutilier, C.\n\n\n \n\n\n\n In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, pages 375–382, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"Multi-DimensionalPaper\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{DBLP:conf/ijcai/SuiFB13,\n  Title                    = {Multi-Dimensional Single-Peaked Consistency and Its Approximations},\n  Author                   = {Xin Sui and\n Alex Francois{-}Nienaber and\n Craig Boutilier},\n  Booktitle                = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference\n on Artificial Intelligence, Beijing, China, August 3-9, 2013},\n  Year                     = {2013},\n  Pages                    = {375--382},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/SuiFB13},\n  Timestamp                = {Wed, 20 Jul 2016 15:16:56 +0200},\n  Url                      = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6720}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n How to progress a database III.\n \n \n \n \n\n\n \n Vassos, S.; and Levesque, H. J.\n\n\n \n\n\n\n Artif. Intell., 195: 203–221. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"HowPaper\n  \n \n\n \n \n doi\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{DBLP:journals/ai/VassosL13,\n  Title                    = {How to progress a database {III}},\n  Author                   = {Stavros Vassos and\n Hector J. Levesque},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2013},\n  Pages                    = {203--221},\n  Volume                   = {195},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/journals/ai/VassosL13},\n  Doi                      = {10.1016/j.artint.2012.10.005},\n  Timestamp                = {Mon, 05 Jun 2017 01:00:00 +0200},\n  Url                      = {https://doi.org/10.1016/j.artint.2012.10.005}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (39)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Value Elimination: Bayesian Inference via Backtracking Search.\n \n \n \n \n\n\n \n Bacchus, F.; Dalmao, S.; and Pitassi, T.\n\n\n \n\n\n\n CoRR, abs/1212.2452. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ValueLink\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
@Article{DBLP:journals/corr/abs-1212-2452,\n  Title                    = {Value Elimination: Bayesian Inference via Backtracking Search},\n  Author                   = {Fahiem Bacchus and\n Shannon Dalmao and\n Toniann Pitassi},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1212.2452},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1212.2452},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (2005).\n \n \n \n \n\n\n \n Bacchus, F.; and Jaakkola, T.\n\n\n \n\n\n\n CoRR, abs/1208.5159. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ProceedingsLink\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
@Article{DBLP:journals/corr/abs-1208-5159,\n  Title                    = {Proceedings of the Twenty-First Conference on Uncertainty\n in Artificial Intelligence (2005)},\n  Author                   = {Fahiem Bacchus and\n Tommi Jaakkola},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1208.5159},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1208.5159},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Eliciting forecasts from self-interested experts: scoring rules for decision makers.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, Valencia, Spain, June 4-8, 2012 (3 Volumes), pages 737–744, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"ElicitingPaper\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{DBLP:conf/aamas/Boutilier12,\n  Title                    = {Eliciting forecasts from self-interested experts: scoring rules for\n decision makers},\n  Author                   = {Craig Boutilier},\n  Booktitle                = {International Conference on Autonomous Agents and Multiagent Systems,\n {AAMAS} 2012, Valencia, Spain, June 4-8, 2012 {(3} Volumes)},\n  Year                     = {2012},\n  Pages                    = {737--744},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/aamas/Boutilier12},\n  Timestamp                = {Thu, 19 Mar 2015 00:00:00 +0100},\n  Url                      = {http://dl.acm.org/citation.cfm?id=2343802}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal social choice functions: a utilitarian view.\n \n \n \n \n\n\n \n Boutilier, C.; Caragiannis, I.; Haber, S.; Lu, T.; Procaccia, A. D.; and Sheffet, O.\n\n\n \n\n\n\n In ACM Conference on Electronic Commerce, EC '12, Valencia, Spain, June 4-8, 2012, pages 197-214, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"OptimalLink\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{DBLP:conf/sigecom/BoutilierCHLPS12,\n  Title                    = {Optimal social choice functions: a utilitarian view},\n  Author                   = {Craig Boutilier and\n Ioannis Caragiannis and\n Simi Haber and\n Tyler Lu and\n Ariel D. Procaccia and\n Or Sheffet},\n  Booktitle                = {ACM Conference on Electronic Commerce, EC '12, Valencia,\n Spain, June 4-8, 2012},\n  Year                     = {2012},\n  Pages                    = {197-214},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/2229012.2229030},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Cooperative Negotiation in Autonomic Systems using Incremental Utility Elicitation.\n \n \n \n \n\n\n \n Boutilier, C.; Das, R.; Kephart, J. O.; Tesauro, G.; and Walsh, W. E.\n\n\n \n\n\n\n CoRR, abs/1212.2443. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"CooperativeLink\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{DBLP:journals/corr/abs-1212-2443,\n  Title                    = {Cooperative Negotiation in Autonomic Systems using Incremental\n Utility Elicitation},\n  Author                   = {Craig Boutilier and\n Rajarshi Das and\n Jeffrey O. Kephart and\n Gerald Tesauro and\n William E. Walsh},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1212.2443},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1212.2443},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Dynamic Rationalization of Distance Rationalizability.\n \n \n \n \n\n\n \n Boutilier, C.; and Procaccia, A. D.\n\n\n \n\n\n\n In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\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{DBLP:conf/aaai/BoutilierP12,\n  Title                    = {A Dynamic Rationalization of Distance Rationalizability},\n  Author                   = {Craig Boutilier and\n Ariel D. Procaccia},\n  Booktitle                = {Proceedings of the Twenty-Sixth AAAI Conference on Artificial\n Intelligence, July 22-26, 2012, Toronto, Ontario, Canada},\n  Year                     = {2012},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4930},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Active Collaborative Filtering.\n \n \n \n \n\n\n \n Boutilier, C.; Zemel, R. S.; and Marlin, B. M.\n\n\n \n\n\n\n CoRR, abs/1212.2442. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ActiveLink\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{DBLP:journals/corr/abs-1212-2442,\n  Title                    = {Active Collaborative Filtering},\n  Author                   = {Craig Boutilier and\n Richard S. Zemel and\n Benjamin M. Marlin},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1212.2442},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1212.2442},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Minimax regret based elicitation of generalized additive utilities.\n \n \n \n \n\n\n \n Braziunas, D.; and Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1206.5255. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"MinimaxLink\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
@Article{DBLP:journals/corr/abs-1206-5255,\n  Title                    = {Minimax regret based elicitation of generalized additive\n utilities},\n  Author                   = {Darius Braziunas and\n Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1206.5255},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1206.5255},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Local Utility Elicitation in GAI Models.\n \n \n \n \n\n\n \n Braziunas, D.; and Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1207.1361. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"LocalLink\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{DBLP:journals/corr/abs-1207-1361,\n  Title                    = {Local Utility Elicitation in GAI Models},\n  Author                   = {Darius Braziunas and\n Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1207.1361},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1207.1361},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sequentially optimal repeated coalition formation under uncertainty.\n \n \n \n \n\n\n \n Chalkiadakis, G.; and Boutilier, C.\n\n\n \n\n\n\n Autonomous Agents and Multi-Agent Systems, 24(3): 441-484. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"SequentiallyLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/aamas/ChalkiadakisB12,\n  Title                    = {Sequentially optimal repeated coalition formation under\n uncertainty},\n  Author                   = {Georgios Chalkiadakis and\n Craig Boutilier},\n  Journal                  = {Autonomous Agents and Multi-Agent Systems},\n  Year                     = {2012},\n  Number                   = {3},\n  Pages                    = {441-484},\n  Volume                   = {24},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/s10458-010-9157-y},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Active Learning for Matching Problems.\n \n \n \n \n\n\n \n Charlin, L.; Zemel, R. S.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the 29th International Conference on Machine Learning, ICML 2012, Edinburgh, Scotland, UK, June 26 - July 1, 2012, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"ActivePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/icml/CharlinZB12,\n  Title                    = {Active Learning for Matching Problems},\n  Author                   = {Laurent Charlin and\n Richard S. Zemel and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the 29th International Conference on Machine Learning,\n {ICML} 2012, Edinburgh, Scotland, UK, June 26 - July 1, 2012},\n  Year                     = {2012},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/icml/CharlinZB12},\n  Timestamp                = {Wed, 29 Mar 2017 16:45:25 +0200},\n  Url                      = {http://icml.cc/2012/papers/197.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Framework for Optimizing Paper Matching.\n \n \n \n \n\n\n \n Charlin, L.; Zemel, R. S.; and Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1202.3706. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ALink\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
@Article{DBLP:journals/corr/abs-1202-3706,\n  Title                    = {A Framework for Optimizing Paper Matching},\n  Author                   = {Laurent Charlin and\n Richard S. Zemel and\n Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1202.3706},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1202.3706},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Active Learning for Matching Problems.\n \n \n \n \n\n\n \n Charlin, L.; Zemel, R. S.; and Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1206.4647. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ActiveLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/corr/abs-1206-4647,\n  Title                    = {Active Learning for Matching Problems},\n  Author                   = {Laurent Charlin and\n Richard S. Zemel and\n Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1206.4647},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1206.4647},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Making Reasonable Assumptions to Plan with Incomplete Information (Abridged Report).\n \n \n \n\n\n \n Davis-Mendelow, S.; Baier, J.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Workshop on Classical Planning for Problem Solving (at AAAI), 2012. \n \n\n\n\n
\n\n\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{dav-bai-mci-aaai12,\n  Title                    = {Making Reasonable Assumptions to Plan with Incomplete Information (Abridged Report)},\n  Author                   = {Sammy Davis-Mendelow and Jorge Baier and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Workshop on Classical Planning for Problem Solving (at AAAI)},\n  Year                     = {2012},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Making Reasonable Assumptions to Plan with Incomplete Information.\n \n \n \n\n\n \n Davis-Mendelow, S.; Baier, J.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Workshop on Heuristics for Domain Independent Planning (at ICAPS), 2012. \n \n\n\n\n
\n\n\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{dav-bai-mci-icaps12,\n  Title                    = {Making Reasonable Assumptions to Plan with Incomplete Information},\n  Author                   = {Sammy Davis-Mendelow and Jorge Baier and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Workshop on Heuristics for Domain Independent Planning (at ICAPS)},\n  Year                     = {2012},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On supervising agents in situation-determined ConGolog.\n \n \n \n \n\n\n \n De Giacomo, G.; Lespérance, Y.; and Muise, C.\n\n\n \n\n\n\n In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2, pages 1031–1038, 2012. International Foundation for Autonomous Agents and Multiagent Systems\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{de2012supervising,\n  Title                    = {{On supervising agents in situation-determined ConGolog}},\n  Author                   = {De Giacomo, Giuseppe and Lesp{\\'e}rance, Yves and Muise, Christian},\n  Booktitle                = {Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2},\n  Year                     = {2012},\n  Organization             = {International Foundation for Autonomous Agents and Multiagent Systems},\n  Pages                    = {1031--1038},\n\n  Keywords                 = {golog},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cse.yorku.ca/~lesperan/papers/AAMAS12.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Belief Revision with Sensing and Fallible Actions.\n \n \n \n \n\n\n \n Delgrande, J. P.; and Levesque, H. J.\n\n\n \n\n\n\n In KR, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"BeliefLink\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{DBLP:conf/kr/DelgrandeL12,\n  Title                    = {Belief Revision with Sensing and Fallible Actions},\n  Author                   = {James P. Delgrande and\n Hector J. Levesque},\n  Booktitle                = {KR},\n  Year                     = {2012},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4528},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Generating Optimal Plans in Highly-Dynamic Domains.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n CoRR, abs/1205.2647. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"GeneratingLink\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{DBLP:journals/corr/abs-1205-2647,\n  Title                    = {Generating Optimal Plans in Highly-Dynamic Domains},\n  Author                   = {Christian Fritz and\n Sheila A. McIlraith},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1205.2647},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1205.2647},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Off the Trail: Re-examining the CDCL Algorithm.\n \n \n \n \n\n\n \n Goultiaeva, A.; and Bacchus, F.\n\n\n \n\n\n\n In Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings, pages 30-43, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"OffLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 43 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/sat/GoultiaevaB12,\n  Title                    = {Off the Trail: Re-examining the CDCL Algorithm},\n  Author                   = {Alexandra Goultiaeva and\n Fahiem Bacchus},\n  Booktitle                = {Theory and Applications of Satisfiability Testing - SAT\n 2012 - 15th International Conference, Trento, Italy, June\n 17-20, 2012. Proceedings},\n  Year                     = {2012},\n  Pages                    = {30-43},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-31612-8_4},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n People, sensors, decisions: Customizable and adaptive technologies for assistance in healthcare.\n \n \n \n \n\n\n \n Hoey, J.; Boutilier, C.; Poupart, P.; Olivier, P.; Monk, A.; and Mihailidis, A.\n\n\n \n\n\n\n TiiS, 2(4): 20. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"People,Link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/tiis/HoeyBPOMM12,\n  Title                    = {People, sensors, decisions: Customizable and adaptive technologies\n for assistance in healthcare},\n  Author                   = {Jesse Hoey and\n Craig Boutilier and\n Pascal Poupart and\n Patrick Olivier and\n Andrew Monk and\n Alex Mihailidis},\n  Journal                  = {TiiS},\n  Year                     = {2012},\n  Number                   = {4},\n  Pages                    = {20},\n  Volume                   = {2},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/2395123.2395125},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Toward Experiential Utility Elicitation for Interface Customization.\n \n \n \n \n\n\n \n Hui, B.; and Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1206.3258. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"TowardLink\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{DBLP:journals/corr/abs-1206-3258,\n  Title                    = {Toward Experiential Utility Elicitation for Interface Customization},\n  Author                   = {Bowen Hui and\n Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1206.3258},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1206.3258},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty.\n \n \n \n \n\n\n \n Hyafil, N.; and Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1207.4147. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"RegretLink\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{DBLP:journals/corr/abs-1207-4147,\n  Title                    = {Regret Minimizing Equilibria and Mechanisms for Games with\n Strict Type Uncertainty},\n  Author                   = {Nathanael Hyafil and\n Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1207.4147},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1207.4147},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preference-Based Planning via MaxSAT.\n \n \n \n \n\n\n \n Juma, F.; Hsu, E. I.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Canadian Conference on Artificial Intelligence, pages 109-120, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"Preference-BasedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 26 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{jum-hsu-mci-cai12,\n  Title                    = {Preference-Based Planning via MaxSAT},\n  Author                   = {Farah Juma and\n Eric I. Hsu and\n Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Canadian Conference on Artificial Intelligence},\n  Year                     = {2012},\n  Pages                    = {109-120},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/jum-hsu-mci-cai12.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Only-Knowing Meets Nonmonotonic Modal Logic.\n \n \n \n \n\n\n \n Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n In KR, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"Only-KnowingLink\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{DBLP:conf/kr/LakemeyerL12,\n  Title                    = {Only-Knowing Meets Nonmonotonic Modal Logic},\n  Author                   = {Gerhard Lakemeyer and\n Hector J. Levesque},\n  Booktitle                = {KR},\n  Year                     = {2012},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4507},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Winograd Schema Challenge.\n \n \n \n \n\n\n \n Levesque, H. J.; Davis, E.; and Morgenstern, L.\n\n\n \n\n\n\n In KR, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"TheLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/kr/LevesqueDM12,\n  Title                    = {The Winograd Schema Challenge},\n  Author                   = {Hector J. Levesque and\n Ernest Davis and\n Leora Morgenstern},\n  Booktitle                = {KR},\n  Year                     = {2012},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4492},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Truth about Defaults.\n \n \n \n \n\n\n \n Levesque, H. J.; and Lakemeyer, G.\n\n\n \n\n\n\n In Correct Reasoning, pages 422-435, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"TheLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/birthday/LevesqueL12,\n  Title                    = {The Truth about Defaults},\n  Author                   = {Hector J. Levesque and\n Gerhard Lakemeyer},\n  Booktitle                = {Correct Reasoning},\n  Year                     = {2012},\n  Pages                    = {422-435},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-30743-0_29},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Matching models for preference-sensitive group purchasing.\n \n \n \n \n\n\n \n Lu, T.; and Boutilier, C.\n\n\n \n\n\n\n In ACM Conference on Electronic Commerce, EC '12, Valencia, Spain, June 4-8, 2012, pages 723-740, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"MatchingLink\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{DBLP:conf/sigecom/LuB12,\n  Title                    = {Matching models for preference-sensitive group purchasing},\n  Author                   = {Tyler Lu and\n Craig Boutilier},\n  Booktitle                = {ACM Conference on Electronic Commerce, EC '12, Valencia,\n Spain, June 4-8, 2012},\n  Year                     = {2012},\n  Pages                    = {723-740},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/2229012.2229068},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare.\n \n \n \n \n\n\n \n Lu, T.; Tang, P.; Procaccia, A. D.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, Catalina Island, CA, USA, August 14-18, 2012, pages 543–553, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"BayesianPaper\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{DBLP:conf/uai/LuTPB12,\n  Title                    = {Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare},\n  Author                   = {Tyler Lu and\n Pingzhong Tang and\n Ariel D. Procaccia and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial\n Intelligence, Catalina Island, CA, USA, August 14-18, 2012},\n  Year                     = {2012},\n  Pages                    = {543--553},\n\n  Bibsource                = {dblp computer science bibliography, https://dblp.org},\n  Biburl                   = {https://dblp.org/rec/bib/conf/uai/LuTPB12},\n  Timestamp                = {Wed, 29 Mar 2017 16:45:26 +0200},\n  Url                      = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1\\&\\#38;smnu=2\\&\\#38;article\\_id=2314\\&\\#38;proceeding\\_id=28}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare.\n \n \n \n \n\n\n \n Lu, T.; Tang, P.; Procaccia, A. D.; and Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1210.4895. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"BayesianLink\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{DBLP:journals/corr/abs-1210-4895,\n  Title                    = {Bayesian Vote Manipulation: Optimal Strategies and Impact\n on Welfare},\n  Author                   = {Tyler Lu and\n Pingzhong Tang and\n Ariel D. Procaccia and\n Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1210.4895},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1210.4895},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Improved Non-deterministic Planning by Exploiting State Relevance.\n \n \n \n \n\n\n \n Muise, C.; McIlraith, S. A.; and Beck, J. C.\n\n\n \n\n\n\n In The 22nd International Conference on Automated Planning and Scheduling, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"ImprovedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 99 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{muise-icaps12-long,\n  Title                    = {{Improved Non-deterministic Planning by Exploiting State Relevance}},\n  Author                   = {Muise, Christian and McIlraith, Sheila A. and Beck, J. Christopher},\n  Booktitle                = {The 22nd International Conference on Automated Planning and Scheduling},\n  Year                     = {2012},\n  Series                   = {The 22nd International Conference on Automated Planning and Scheduling},\n\n  Abstract                 = {We address the problem of computing a policy for fully ob- servable non-deterministic (FOND) planning problems. By focusing on the relevant aspects of the state of the world, we introduce a series of improvements to the previous state of the art and extend the applicability of our planner, PRP, to work in an online setting. The use of state relevance allows our policy to be exponentiallymore succinct in representing a solution to a FOND problem for some domains. Through the introduction of newtechniques for avoiding deadends and de- termining sufficient validity conditions, PRP has the potential to compute a policy up to several orders of magnitude faster than previous approaches. We also find dramatic improve- ments over the state of the art in online replanning when we treat suitable probabilistic domains as FOND domains.},\n  File                     = {:home/cjmuise/Documents/Mendeley Desktop/The 22nd International Conference on Automated Planning and Scheduling/2012/Improved Non-deterministic Planning by Exploiting State Relevance.pdf:pdf},\n  Keywords                 = {personal},\n  Mendeley-tags            = {personal},\n  Timestamp                = {2018.09.23},\n  Type                     = {Conference Proceedings},\n  Url                      = {http://www.haz.ca/research/papers/muise-icaps2012-fond.pdf}\n}\n\n
\n
\n\n\n
\n We address the problem of computing a policy for fully ob- servable non-deterministic (FOND) planning problems. By focusing on the relevant aspects of the state of the world, we introduce a series of improvements to the previous state of the art and extend the applicability of our planner, PRP, to work in an online setting. The use of state relevance allows our policy to be exponentiallymore succinct in representing a solution to a FOND problem for some domains. Through the introduction of newtechniques for avoiding deadends and de- termining sufficient validity conditions, PRP has the potential to compute a policy up to several orders of magnitude faster than previous approaches. We also find dramatic improve- ments over the state of the art in online replanning when we treat suitable probabilistic domains as FOND domains.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Improved Non-deterministic Planning by Exploiting State Relevance.\n \n \n \n \n\n\n \n Muise, C.; McIlraith, S. A.; and Beck, J. C.\n\n\n \n\n\n\n In Proceedings of the 22nd International Conference on Automated Planning and Scheduling, of The 22nd International Conference on Automated Planning and Scheduling, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"ImprovedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 99 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{mui-mci-bec-icaps12,\n  Title                    = {Improved Non-deterministic Planning by Exploiting State Relevance},\n  Author                   = {Christian {Muise} and Sheila A. {McIlraith} and J. Christopher {Beck}},\n  Booktitle                = {Proceedings of the 22nd International Conference on Automated Planning and Scheduling},\n  Year                     = {2012},\n  Series                   = {The 22nd International Conference on Automated Planning and Scheduling},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/mui-mci-bec-icaps12.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimally Relaxing Partial-order Plans With MaxSAT.\n \n \n \n \n\n\n \n Muise, C.; McIlratih, S. A.; and Beck, J. C.\n\n\n \n\n\n\n In 22nd International Conference on Automated Planning and Scheduling, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"OptimallyPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{muise2012optimally,\n  Title                    = {{Optimally Relaxing Partial-order Plans With MaxSAT}},\n  Author                   = {Muise, Christian and McIlratih, Sheila A. and Beck, J. Christopher},\n  Booktitle                = {22nd International Conference on Automated Planning and Scheduling},\n  Year                     = {2012},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://tidel.mie.utoronto.ca/pubs/muise_MaxSATICAPS2012.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimally Relaxing Partial-Order Plans with MaxSAT.\n \n \n \n \n\n\n \n Muise, C. J.; McIlraith, S. A.; and Beck, J. C.\n\n\n \n\n\n\n In ICAPS, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"OptimallyPaper\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{mui-mci-bec-icaps12b,\n  Title                    = {Optimally Relaxing Partial-Order Plans with MaxSAT},\n  Author                   = {Christian J. Muise and\n Sheila A. McIlraith and\n J. Christopher Beck},\n  Booktitle                = {ICAPS},\n  Year                     = {2012},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/mui-mci-bec-icaps12b.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Dsharp: Fast d-DNNF Compilation with sharpSAT.\n \n \n \n \n\n\n \n Muise, C. J.; McIlraith, S. A.; Beck, J. C.; and Hsu, E. I.\n\n\n \n\n\n\n In Proceedings of the Canadian Conference on Artificial Intelligence, pages 356-361, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"Dsharp:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{mui-mci-bec-hsu-cai12,\n  Title                    = {Dsharp: Fast d-DNNF Compilation with sharpSAT},\n  Author                   = {Christian J. Muise and\n Sheila A. McIlraith and\n J. Christopher Beck and\n Eric I. Hsu},\n  Booktitle                = {Proceedings of the Canadian Conference on Artificial Intelligence},\n  Year                     = {2012},\n  Pages                    = {356-361},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/~sheila/publications/mui-mci-bec-hsu-cai12.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Regret-based Reward Elicitation for Markov Decision Processes.\n \n \n \n \n\n\n \n Regan, K.; and Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1205.2619. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"Regret-basedLink\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{DBLP:journals/corr/abs-1205-2619,\n  Title                    = {Regret-based Reward Elicitation for Markov Decision Processes},\n  Author                   = {Kevin Regan and\n Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1205.2619},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1205.2619},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Approximate Linear Programming for First-order MDPs.\n \n \n \n \n\n\n \n Sanner, S.; and Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1207.1415. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ApproximateLink\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{DBLP:journals/corr/abs-1207-1415,\n  Title                    = {Approximate Linear Programming for First-order MDPs},\n  Author                   = {Scott Sanner and\n Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2012},\n  Volume                   = {abs/1207.1415},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1207.1415},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Planned Reconfiguration of Distributed Messaging Systems.\n \n \n \n\n\n \n Yoon, Y.; Robinson, N.; Muthusamy, V.; Jacobsen, H.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Workshop on Classical Planning for Problem Solving (at AAAI), 2012. \n \n\n\n\n
\n\n\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{yoonetal-aaai12,\n  Title                    = {Planned Reconfiguration of Distributed Messaging Systems},\n  Author                   = {Young Yoon and Nathan Robinson and Vinod Muthusamy and Hans-Arno Jacobsen and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Workshop on Classical Planning for Problem Solving (at AAAI)},\n  Year                     = {2012},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n MAXSAT Heuristics for Cost Optimal Planning.\n \n \n \n \n\n\n \n Zhang, L.; and Bacchus, F.\n\n\n \n\n\n\n In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"MAXSATLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 107 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/aaai/ZhangB12,\n  Title                    = {MAXSAT Heuristics for Cost Optimal Planning},\n  Author                   = {Lei Zhang and\n Fahiem Bacchus},\n  Booktitle                = {Proceedings of the Twenty-Sixth AAAI Conference on Artificial\n Intelligence, July 22-26, 2012, Toronto, Ontario, Canada},\n  Year                     = {2012},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/5190},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10-14, 2012.\n \n \n \n\n\n \n Brewka, G.; Eiter, T.; and McIlraith, S. A.,\n editors.\n \n\n\n \n\n\n\n AAAI Press. 2012.\n \n\n\n\n
\n\n\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
@Proceedings{DBLP:conf/kr/2012,\n  Title                    = {Principles of Knowledge Representation and Reasoning: Proceedings\n of the Thirteenth International Conference, KR 2012, Rome,\n Italy, June 10-14, 2012},\n  Year                     = {2012},\n  Editor                   = {Gerhard Brewka and\n Thomas Eiter and\n Sheila A. McIlraith},\n  Publisher                = {AAAI Press},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Booktitle                = {KR},\n  ISBN                     = {978-1-57735-560-1},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (37)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n The Power of Modeling - a Response to PDDL2.1.\n \n \n \n \n\n\n \n Bacchus, F.\n\n\n \n\n\n\n CoRR, abs/1110.2729. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"TheLink\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{DBLP:journals/corr/abs-1110-2729,\n  Title                    = {The Power of Modeling - a Response to PDDL2.1},\n  Author                   = {Fahiem Bacchus},\n  Journal                  = {CoRR},\n  Year                     = {2011},\n  Volume                   = {abs/1110.2729},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1110.2729},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Semantical Account of Progression in the Presence of Uncertainty.\n \n \n \n \n\n\n \n Belle, V.; and Lakemeyer, G.\n\n\n \n\n\n\n In Proc. AAAI, pages 165-170, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{KBSG_220,\n  Title                    = {A Semantical Account of Progression in the Presence of Uncertainty},\n  Author                   = {Belle, Vaishak and Lakemeyer, Gerhard},\n  Booktitle                = {Proc. AAAI},\n  Year                     = {2011},\n  Pages                    = {165-170},\n\n  Abstract                 = {Building on a general theory of action by Reiter and his colleagues, Bacchus et al give an account for formalizing degrees of belief and noisy actions in the situation calculus. Unfortunately, there is no clear solution to the projection problem for the formalism. And, while the model has epistemic features, it is not obvious what the agent{\\textquoteright}s knowledge base should look like. Also, reasoning about uncertainty essentially resorts to second-order logic. In recent work, Gabaldon and Lakemeyer remedy these shortcomings somewhat, but here too the utility seems to be restricted to queries (with action operators) about the initial theory. In this paper, we propose a fresh amalgamation of a modal fragment of the situation calculus and uncertainty, where the idea will be to update the initial knowledge base, containing both ordinary and (certain kinds of) probabilistic beliefs, when noisy actions are performed. We show that the new semantics has the right properties, and study a special case where updating probabilistic beliefs is computable. Our ideas are closely related to the Lin and Reiter notion of progression. },\n  Date-added               = {2011-05-16 13:15:50 +0200},\n  Date-modified            = {2012-02-22 14:53:45 +0000},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://kbsg.rwth-aachen.de/fileskbsg/prog-noisy.pdf}\n}\n\n
\n
\n\n\n
\n Building on a general theory of action by Reiter and his colleagues, Bacchus et al give an account for formalizing degrees of belief and noisy actions in the situation calculus. Unfortunately, there is no clear solution to the projection problem for the formalism. And, while the model has epistemic features, it is not obvious what the agent\\textquoterights knowledge base should look like. Also, reasoning about uncertainty essentially resorts to second-order logic. In recent work, Gabaldon and Lakemeyer remedy these shortcomings somewhat, but here too the utility seems to be restricted to queries (with action operators) about the initial theory. In this paper, we propose a fresh amalgamation of a modal fragment of the situation calculus and uncertainty, where the idea will be to update the initial knowledge base, containing both ordinary and (certain kinds of) probabilistic beliefs, when noisy actions are performed. We show that the new semantics has the right properties, and study a special case where updating probabilistic beliefs is computable. Our ideas are closely related to the Lin and Reiter notion of progression. \n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Progression and Query Evaluation in First-Order Knowledge Bases with Function Symbols.\n \n \n \n \n\n\n \n Belle, V.; and Lakemeyer, G.\n\n\n \n\n\n\n In Proc. IJCAI, pages 255-260, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{KBSG_219,\n  Title                    = {On Progression and Query Evaluation in First-Order Knowledge Bases with Function Symbols},\n  Author                   = {Belle, Vaishak and Lakemeyer, Gerhard},\n  Booktitle                = {Proc. IJCAI},\n  Year                     = {2011},\n  Pages                    = {255-260},\n\n  Abstract                 = {In a seminal paper, Lin and Reiter introduced the notion of progression of basic action theories. Unfortunately, progression is second-order in general. Recently, Liu and Lakemeyer improve on earlier results and show that for the local-effect and normal actions case, progression is computable but may lead to an exponential blow-up. Nevertheless, they show that for certain kinds of expressive first-order knowledge bases with disjunctive information, called proper$^+$, it is efficient. However, answering queries about the resulting state is still undecidable. In this paper, we continue this line of research and extend proper$^+$ KBs to include functions. We prove that their progression wrt local-effect, normal actions, and range-restricted theories, is first-order definable and efficiently computable. We then provide a new logically sound and complete decision procedure for certain kinds of queries. },\n  Date-added               = {2011-05-16 13:15:30 +0200},\n  Date-modified            = {2012-02-22 14:52:49 +0000},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://kbsg.rwth-aachen.de/fileskbsg/ijcai11.pdf}\n}\n\n
\n
\n\n\n
\n In a seminal paper, Lin and Reiter introduced the notion of progression of basic action theories. Unfortunately, progression is second-order in general. Recently, Liu and Lakemeyer improve on earlier results and show that for the local-effect and normal actions case, progression is computable but may lead to an exponential blow-up. Nevertheless, they show that for certain kinds of expressive first-order knowledge bases with disjunctive information, called proper$^+$, it is efficient. However, answering queries about the resulting state is still undecidable. In this paper, we continue this line of research and extend proper$^+$ KBs to include functions. We prove that their progression wrt local-effect, normal actions, and range-restricted theories, is first-order definable and efficiently computable. We then provide a new logically sound and complete decision procedure for certain kinds of queries. \n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Multi-Agent Only-Knowing.\n \n \n \n\n\n \n Belle, V.; and Lakemeyer, G.\n\n\n \n\n\n\n In Lakemeyer, G.; and McIlraith, S. A., editor(s), Knowing, Reasoning, and Acting: Essays in Honour of Hector J. Levesque, pages 67-86. College Publications, 2011.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InCollection{bellelakbook,\n  Title                    = {Multi-Agent Only-Knowing},\n  Author                   = {Vaishak Belle and Gerhard Lakemeyer},\n  Booktitle                = {Knowing, Reasoning, and Acting: Essays in Honour of Hector J. Levesque},\n  Publisher                = {College Publications},\n  Year                     = {2011},\n  Editor                   = {Gerhard Lakemeyer and Sheila A. McIlraith},\n  Pages                    = {67-86},\n\n  Date-added               = {2011-11-20 10:23:08 +0000},\n  Date-modified            = {2012-02-27 12:00:41 +0100},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Specifying and computing preferred plans.\n \n \n \n \n\n\n \n Bienvenu, M.; Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n Artif. Intell., 175(7-8): 1308-1345. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"SpecifyingLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/ai/BienvenuFM11,\n  Title                    = {Specifying and computing preferred plans},\n  Author                   = {Meghyn Bienvenu and\n Christian Fritz and\n Sheila A. McIlraith},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2011},\n  Number                   = {7-8},\n  Pages                    = {1308-1345},\n  Volume                   = {175},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1016/j.artint.2010.11.021},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preference Elicitation and Preference Learning in Social Choice.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings, pages 1, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"PreferenceLink\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{DBLP:conf/cpaior/Boutilier11,\n  Title                    = {Preference Elicitation and Preference Learning in Social\n Choice},\n  Author                   = {Craig Boutilier},\n  Booktitle                = {Integration of AI and OR Techniques in Constraint Programming\n for Combinatorial Optimization Problems - 8th International\n Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011.\n Proceedings},\n  Year                     = {2011},\n  Pages                    = {1},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-21311-3_1},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Eliciting Forecasts from Self-interested Experts: Scoring Rules for Decision Makers.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n CoRR, abs/1106.2489. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"ElicitingLink\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{DBLP:journals/corr/abs-1106-2489,\n  Title                    = {Eliciting Forecasts from Self-interested Experts: Scoring\n Rules for Decision Makers},\n  Author                   = {Craig Boutilier},\n  Journal                  = {CoRR},\n  Year                     = {2011},\n  Volume                   = {abs/1106.2489},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1106.2489},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Partial-Order Planning with Concurrent Interacting Actions.\n \n \n \n \n\n\n \n Boutilier, C.; and Brafman, R. I.\n\n\n \n\n\n\n CoRR, abs/1106.0249. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"Partial-OrderLink\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{DBLP:journals/corr/abs-1106-0249,\n  Title                    = {Partial-Order Planning with Concurrent Interacting Actions},\n  Author                   = {Craig Boutilier and\n Ronen I. Brafman},\n  Journal                  = {CoRR},\n  Year                     = {2011},\n  Volume                   = {abs/1106.0249},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1106.0249},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements.\n \n \n \n \n\n\n \n Boutilier, C.; Brafman, R. I.; Domshlak, C.; Hoos, H. H.; and Poole, D.\n\n\n \n\n\n\n CoRR, abs/1107.0023. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"CP-nets:Link\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{DBLP:journals/corr/abs-1107-0023,\n  Title                    = {CP-nets: A Tool for Representing and Reasoning withConditional\n Ceteris Paribus Preference Statements},\n  Author                   = {Craig Boutilier and\n Ronen I. Brafman and\n Carmel Domshlak and\n Holger H. Hoos and\n David Poole},\n  Journal                  = {CoRR},\n  Year                     = {2011},\n  Volume                   = {abs/1107.0023},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1107.0023},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decision-Theoretic Planning: Structural Assumptions and Computational Leverage.\n \n \n \n \n\n\n \n Boutilier, C.; Dean, T.; and Hanks, S.\n\n\n \n\n\n\n CoRR, abs/1105.5460. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"Decision-TheoreticLink\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{DBLP:journals/corr/abs-1105-5460,\n  Title                    = {Decision-Theoretic Planning: Structural Assumptions and\n Computational Leverage},\n  Author                   = {Craig Boutilier and\n Thomas Dean and\n Steve Hanks},\n  Journal                  = {CoRR},\n  Year                     = {2011},\n  Volume                   = {abs/1105.5460},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1105.5460},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Accelerating Reinforcement Learning through Implicit Imitation.\n \n \n \n \n\n\n \n Boutilier, C.; and Price, B.\n\n\n \n\n\n\n CoRR, abs/1106.0681. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"AcceleratingLink\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{DBLP:journals/corr/abs-1106-0681,\n  Title                    = {Accelerating Reinforcement Learning through Implicit Imitation},\n  Author                   = {Craig Boutilier and\n Bob Price},\n  Journal                  = {CoRR},\n  Year                     = {2011},\n  Volume                   = {abs/1106.0681},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1106.0681},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Framework for Optimizing Paper Matching.\n \n \n \n \n\n\n \n Charlin, L.; Zemel, R. S.; and Boutilier, C.\n\n\n \n\n\n\n In UAI 2011, Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, Barcelona, Spain, July 14-17, 2011, pages 86-95, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\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{DBLP:conf/uai/CharlinZB11,\n  Title                    = {A Framework for Optimizing Paper Matching},\n  Author                   = {Laurent Charlin and\n Richard S. Zemel and\n Craig Boutilier},\n  Booktitle                = {UAI 2011, Proceedings of the Twenty-Seventh Conference on\n Uncertainty in Artificial Intelligence, Barcelona, Spain,\n July 14-17, 2011},\n  Year                     = {2011},\n  Pages                    = {86-95},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://uai.sis.pitt.edu/displayArticleDetails.jsp?mmnu=1{\\&amp;}smnu=2{\\&amp;}article_id=2195{\\&amp;}proceeding_id=27},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Solving MAXSAT by Solving a Sequence of Simpler SAT Instances.\n \n \n \n \n\n\n \n Davies, J.; and Bacchus, F.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming - CP 2011 - 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings, pages 225-239, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"SolvingLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 21 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/cp/DaviesB11,\n  Title                    = {Solving MAXSAT by Solving a Sequence of Simpler SAT Instances},\n  Author                   = {Jessica Davies and\n Fahiem Bacchus},\n  Booktitle                = {Principles and Practice of Constraint Programming - CP 2011\n - 17th International Conference, CP 2011, Perugia, Italy,\n September 12-16, 2011. Proceedings},\n  Year                     = {2011},\n  Pages                    = {225-239},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-23786-7_19},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Agent Supervision in Situation-Determined ConGolog.\n \n \n \n \n\n\n \n De Giacomo, G.; Lesperance, Y.; and Muise, C.\n\n\n \n\n\n\n In Nonmonotonic Reasoning, Action and Change, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"AgentPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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
@InProceedings{DeGiacomo2011,\n  Title                    = {{Agent Supervision in Situation-Determined ConGolog}},\n  Author                   = {{De Giacomo}, Giuseppe and Lesperance, Yves and Muise, Christian},\n  Booktitle                = {Nonmonotonic Reasoning, Action and Change},\n  Year                     = {2011},\n\n  Abstract                 = {We investigate agent supervision, a form of customization, which constrains the actions of an agent so as to enforce certain desired behavioral specifications. This is done in a setting based on the Situation Calculus and a variant of the ConGolog programming language which allows for nondeterminism, but requires the remainder of a program after the execution of an action to be determined by the resulting situation. Such programs can be fully characterized by the set of action sequences that they generate. The main results are a characterization of the maximally permissive supervisor that minimally constrains the agent so as to enforce the desired behavioral constraints when some agent actions are uncontrollable, and a sound and complete technique to execute the agent as constrained by such a supervisor.},\n  File                     = {:home/cjmuise/Documents/Mendeley Desktop/Nonmonotonic Reasoning, Action and Change/2011/Agent Supervision in Situation-Determined ConGolog.pdf:pdf},\n  Keywords                 = {golog},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://ijcai-11.iiia.csic.es/files/proceedings/W4- NRAC11-Proceedings.pdf\\#page=27}\n}\n\n
\n
\n\n\n
\n We investigate agent supervision, a form of customization, which constrains the actions of an agent so as to enforce certain desired behavioral specifications. This is done in a setting based on the Situation Calculus and a variant of the ConGolog programming language which allows for nondeterminism, but requires the remainder of a program after the execution of an action to be determined by the resulting situation. Such programs can be fully characterized by the set of action sequences that they generate. The main results are a characterization of the maximally permissive supervisor that minimally constrains the agent so as to enforce the desired behavioral constraints when some agent actions are uncontrollable, and a sound and complete technique to execute the agent as constrained by such a supervisor.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient Reasoning in Proper Knowledge Bases with Unknown Individuals.\n \n \n \n \n\n\n \n Giacomo, G. D.; Lespérance, Y.; and Levesque, H. J.\n\n\n \n\n\n\n In IJCAI, pages 827-832, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"EfficientLink\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{DBLP:conf/ijcai/GiacomoLL11,\n  Title                    = {Efficient Reasoning in Proper Knowledge Bases with Unknown\n Individuals},\n  Author                   = {Giuseppe De Giacomo and\n Yves Lesp{\\'e}rance and\n Hector J. Levesque},\n  Booktitle                = {IJCAI},\n  Year                     = {2011},\n  Pages                    = {827-832},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers11/Papers/IJCAI11-144.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas.\n \n \n \n \n\n\n \n Goultiaeva, A.; Gelder, A. V.; and Bacchus, F.\n\n\n \n\n\n\n In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pages 546-553, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/ijcai/GoultiaevaGB11,\n  Title                    = {A Uniform Approach for Generating Proofs and Strategies\n for Both True and False QBF Formulas},\n  Author                   = {Alexandra Goultiaeva and\n Allen Van Gelder and\n Fahiem Bacchus},\n  Booktitle                = {IJCAI 2011, Proceedings of the 22nd International Joint\n Conference on Artificial Intelligence, Barcelona, Catalonia,\n Spain, July 16-22, 2011},\n  Year                     = {2011},\n  Pages                    = {546-553},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers11/Papers/IJCAI11-099.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Correctness Result for Reasoning about One-Dimensional Planning Problems.\n \n \n \n \n\n\n \n Hu, Y.; and Levesque, H. J.\n\n\n \n\n\n\n In IJCAI, pages 2638-2643, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\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{DBLP:conf/ijcai/HuL11,\n  Title                    = {A Correctness Result for Reasoning about One-Dimensional\n Planning Problems},\n  Author                   = {Yuxiao Hu and\n Hector J. Levesque},\n  Booktitle                = {IJCAI},\n  Year                     = {2011},\n  Pages                    = {2638-2643},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers11/Papers/IJCAI11-439.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A semantic characterization of a useful fragment of the situation calculus with knowledge.\n \n \n \n \n\n\n \n Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n Artif. Intell., 175(1): 142-164. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"ALink\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
@Article{DBLP:journals/ai/LakemeyerL11,\n  Title                    = {A semantic characterization of a useful fragment of the\n situation calculus with knowledge},\n  Author                   = {Gerhard Lakemeyer and\n Hector J. Levesque},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2011},\n  Number                   = {1},\n  Pages                    = {142-164},\n  Volume                   = {175},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1016/j.artint.2010.04.005},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Winograd Schema Challenge.\n \n \n \n \n\n\n \n Levesque, H. J.\n\n\n \n\n\n\n In AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"TheLink\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{DBLP:conf/aaaiss/Levesque11,\n  Title                    = {The Winograd Schema Challenge},\n  Author                   = {Hector J. Levesque},\n  Booktitle                = {AAAI Spring Symposium: Logical Formalizations of Commonsense\n Reasoning},\n  Year                     = {2011},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/SSS/SSS11/paper/view/2502},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Representing and reasoning about preferences in requirements engineering.\n \n \n \n \n\n\n \n Liaskos, S.; McIlraith, S. A.; Sohrabi, S.; and Mylopoulos, J.\n\n\n \n\n\n\n Requir. Eng., 16(3): 227-249. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"RepresentingLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/re/LiaskosMSM11,\n  Title                    = {Representing and reasoning about preferences in requirements\n engineering},\n  Author                   = {Sotirios Liaskos and\n Sheila A. McIlraith and\n Shirin Sohrabi and\n John Mylopoulos},\n  Journal                  = {Requir. Eng.},\n  Year                     = {2011},\n  Number                   = {3},\n  Pages                    = {227-249},\n  Volume                   = {16},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/s00766-011-0129-9},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs.\n \n \n \n \n\n\n \n Lu, T.; and Boutilier, C.\n\n\n \n\n\n\n In Algorithmic Decision Theory - Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings, pages 135-149, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"VoteLink\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{DBLP:conf/aldt/LuB11,\n  Title                    = {Vote Elicitation with Probabilistic Preference Models: Empirical\n Estimation and Cost Tradeoffs},\n  Author                   = {Tyler Lu and\n Craig Boutilier},\n  Booktitle                = {Algorithmic Decision Theory - Second International Conference,\n ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings},\n  Year                     = {2011},\n  Pages                    = {135-149},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-24873-3_11},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Learning Mallows Models with Pairwise Preferences.\n \n \n \n\n\n \n Lu, T.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the 28th International Conference on Machine Learning, ICML 2011, Bellevue, Washington, USA, June 28 - July 2, 2011, pages 145-152, 2011. \n \n\n\n\n
\n\n\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{DBLP:conf/icml/LuB11,\n  Title                    = {Learning Mallows Models with Pairwise Preferences},\n  Author                   = {Tyler Lu and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the 28th International Conference on Machine\n Learning, ICML 2011, Bellevue, Washington, USA, June 28\n - July 2, 2011},\n  Year                     = {2011},\n  Pages                    = {145-152},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Budgeted Social Choice: From Consensus to Personalized Decision Making.\n \n \n \n \n\n\n \n Lu, T.; and Boutilier, C.\n\n\n \n\n\n\n In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pages 280-286, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"BudgetedLink\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{DBLP:conf/ijcai/LuB11,\n  Title                    = {Budgeted Social Choice: From Consensus to Personalized Decision\n Making},\n  Author                   = {Tyler Lu and\n Craig Boutilier},\n  Booktitle                = {IJCAI 2011, Proceedings of the 22nd International Joint\n Conference on Artificial Intelligence, Barcelona, Catalonia,\n Spain, July 16-22, 2011},\n  Year                     = {2011},\n  Pages                    = {280-286},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers11/Papers/IJCAI11-057.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Robust Approximation and Incremental Elicitation in Voting Protocols.\n \n \n \n \n\n\n \n Lu, T.; and Boutilier, C.\n\n\n \n\n\n\n In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pages 287-293, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"RobustLink\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{DBLP:conf/ijcai/LuB11a,\n  Title                    = {Robust Approximation and Incremental Elicitation in Voting\n Protocols},\n  Author                   = {Tyler Lu and\n Craig Boutilier},\n  Booktitle                = {IJCAI 2011, Proceedings of the 22nd International Joint\n Conference on Artificial Intelligence, Barcelona, Catalonia,\n Spain, July 16-22, 2011},\n  Year                     = {2011},\n  Pages                    = {287-293},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers11/Papers/IJCAI11-058.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n John McCarthy's legacy.\n \n \n \n \n\n\n \n Morgenstern, L.; and McIlraith, S. A.\n\n\n \n\n\n\n Artif. Intell., 175(1): 1-24. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"JohnLink\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{DBLP:journals/ai/MorgensternM11,\n  Title                    = {John McCarthy's legacy},\n  Author                   = {Leora Morgenstern and\n Sheila A. McIlraith},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2011},\n  Number                   = {1},\n  Pages                    = {1-24},\n  Volume                   = {175},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1016/j.artint.2010.11.003},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Monitoring the Execution of Partial-Order Plans via Regression.\n \n \n \n \n\n\n \n Muise, C.; McIlraith, S. A.; and Beck, J. C.\n\n\n \n\n\n\n In International Joint Conference On Artificial Intelligence, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"MonitoringPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{muise-ijcai11,\n  Title                    = {{Monitoring the Execution of Partial-Order Plans via Regression}},\n  Author                   = {Muise, Christian and McIlraith, Sheila A. and Beck, J. Christopher},\n  Booktitle                = {International Joint Conference On Artificial Intelligence},\n  Year                     = {2011},\n  Series                   = {International Joint Conference On Artificial Intelligence},\n\n  Abstract                 = {Partial-order plans (POPs) have the capacity to compactly represent numerous distinct plan lin- earizations and as a consequence are inherently ro- bust. We exploit this robustness to do effective ex- ecutionmonitoring. We characterize the conditions underwhich a POP remains viable as the regression of the goal through the structure of a POP.We then develop a method for POP execution monitoring via a structured policy, expressed as an ordered al- gebraic decision diagram. The policy encompasses both state evaluation and action selection, enabling an agent to seamlessly switch between POP lin- earizations to accommodate unexpected changes during execution. We demonstrate the effective- ness of our approach by comparing it empirically and analytically to a standard technique for execu- tion monitoring of sequential plans. On standard benchmark planning domains, our approach is 2 to 17 times faster and up to 2.5 times more robust than comparable monitoring of a sequential plan. On POPs that have few ordering constraints among actions, our approach is significantly more robust, with the ability to continue executing in up to an exponential number of additional states.},\n  File                     = {:home/cjmuise/Documents/Mendeley Desktop/International Joint Conference On Artificial Intelligence/2011/Monitoring the Execution of Partial-Order Plans via Regression.pdf:pdf},\n  Keywords                 = {personal},\n  Mendeley-tags            = {personal},\n  Timestamp                = {2018.09.23},\n  Type                     = {Conference Proceedings},\n  Url                      = {http://ijcai.org/papers11/Papers/IJCAI11-330.pdf}\n}\n\n
\n
\n\n\n
\n Partial-order plans (POPs) have the capacity to compactly represent numerous distinct plan lin- earizations and as a consequence are inherently ro- bust. We exploit this robustness to do effective ex- ecutionmonitoring. We characterize the conditions underwhich a POP remains viable as the regression of the goal through the structure of a POP.We then develop a method for POP execution monitoring via a structured policy, expressed as an ordered al- gebraic decision diagram. The policy encompasses both state evaluation and action selection, enabling an agent to seamlessly switch between POP lin- earizations to accommodate unexpected changes during execution. We demonstrate the effective- ness of our approach by comparing it empirically and analytically to a standard technique for execu- tion monitoring of sequential plans. On standard benchmark planning domains, our approach is 2 to 17 times faster and up to 2.5 times more robust than comparable monitoring of a sequential plan. On POPs that have few ordering constraints among actions, our approach is significantly more robust, with the ability to continue executing in up to an exponential number of additional states.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimization of Partial-Order Plans via MaxSAT.\n \n \n \n \n\n\n \n Muise, C.; McIlratih, S. A.; and Beck, J. C.\n\n\n \n\n\n\n In Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS'11), 2011. \n \n\n\n\n
\n\n\n\n \n \n \"OptimizationPaper\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{muise2011optimally,\n  Title                    = {{Optimization of Partial-Order Plans via MaxSAT}},\n  Author                   = {Muise, Christian and McIlratih, Sheila A. and Beck, J. Christopher},\n  Booktitle                = {Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS'11)},\n  Year                     = {2011},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.haz.ca/research/papers/coplas-muise-11.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards Completely Lifted Search-based Probabilistic Inference.\n \n \n \n \n\n\n \n Poole, D.; Bacchus, F.; and Kisynski, J.\n\n\n \n\n\n\n CoRR, abs/1107.4035. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"TowardsLink\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{DBLP:journals/corr/abs-1107-4035,\n  Title                    = {Towards Completely Lifted Search-based Probabilistic Inference},\n  Author                   = {David Poole and\n Fahiem Bacchus and\n Jacek Kisynski},\n  Journal                  = {CoRR},\n  Year                     = {2011},\n  Volume                   = {abs/1107.4035},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://arxiv.org/abs/1107.4035},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Eliciting Additive Reward Functions for Markov Decision Processes.\n \n \n \n \n\n\n \n Regan, K.; and Boutilier, C.\n\n\n \n\n\n\n In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pages 2159-2164, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"ElicitingLink\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{DBLP:conf/ijcai/ReganB11,\n  Title                    = {Eliciting Additive Reward Functions for Markov Decision\n Processes},\n  Author                   = {Kevin Regan and\n Craig Boutilier},\n  Booktitle                = {IJCAI 2011, Proceedings of the 22nd International Joint\n Conference on Artificial Intelligence, Barcelona, Catalonia,\n Spain, July 16-22, 2011},\n  Year                     = {2011},\n  Pages                    = {2159-2164},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers11/Papers/IJCAI11-360.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Robust Online Optimization of Reward-Uncertain MDPs.\n \n \n \n \n\n\n \n Regan, K.; and Boutilier, C.\n\n\n \n\n\n\n In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pages 2165-2171, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"RobustLink\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{DBLP:conf/ijcai/ReganB11a,\n  Title                    = {Robust Online Optimization of Reward-Uncertain MDPs},\n  Author                   = {Kevin Regan and\n Craig Boutilier},\n  Booktitle                = {IJCAI 2011, Proceedings of the 22nd International Joint\n Conference on Artificial Intelligence, Barcelona, Catalonia,\n Spain, July 16-22, 2011},\n  Year                     = {2011},\n  Pages                    = {2165-2171},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers11/Papers/IJCAI11-361.pdf},\n  Timestamp                = {2018.09.23}\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 Artif. Intell., 175(1): 165-192. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"IteratedLink\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
@Article{DBLP:journals/ai/ShapiroPLL11,\n  Title                    = {Iterated belief change in the situation calculus},\n  Author                   = {Steven Shapiro and\n Maurice Pagnucco and\n Yves Lesp{\\'e}rance and\n Hector J. Levesque},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2011},\n  Number                   = {1},\n  Pages                    = {165-192},\n  Volume                   = {175},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1016/j.artint.2010.04.003},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preferred Explanations: Theory and Generation via Planning.\n \n \n \n \n\n\n \n Sohrabi, S.; Baier, J. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In AAAI, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"PreferredLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 45 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/aaai/SohrabiBM11,\n  Title                    = {Preferred Explanations: Theory and Generation via Planning},\n  Author                   = {Shirin Sohrabi and\n Jorge A. Baier and\n Sheila A. McIlraith},\n  Booktitle                = {AAAI},\n  Year                     = {2011},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3568},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficiency and Privacy Tradeoffs in Mechanism Design.\n \n \n \n \n\n\n \n Sui, X.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"EfficiencyLink\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{DBLP:conf/aaai/SuiB11,\n  Title                    = {Efficiency and Privacy Tradeoffs in Mechanism Design},\n  Author                   = {Xin Sui and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Fifth AAAI Conference on Artificial\n Intelligence, AAAI 2011, San Francisco, California, USA,\n August 7-11, 2011},\n  Year                     = {2011},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3527},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!.\n \n \n \n \n\n\n \n Viappiani, P.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"RecommendationLink\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{DBLP:conf/aaai/ViappianiB11,\n  Title                    = {Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation\n Tradeoff!},\n  Author                   = {Paolo Viappiani and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Fifth AAAI Conference on Artificial\n Intelligence, AAAI 2011, San Francisco, California, USA,\n August 7-11, 2011},\n  Year                     = {2011},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3592},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Bayesian Concept Learning Approach to Crowdsourcing.\n \n \n \n \n\n\n \n Viappiani, P.; Zilles, S.; Hamilton, H. J.; and Boutilier, C.\n\n\n \n\n\n\n In Interactive Decision Theory and Game Theory, Papers from the 2011 AAAI Workshop, San Francisco, California, USA, August 8, 2011, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\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{DBLP:conf/aaai/ViappianiZHB11,\n  Title                    = {A Bayesian Concept Learning Approach to Crowdsourcing},\n  Author                   = {Paolo Viappiani and\n Sandra Zilles and\n Howard J. Hamilton and\n Craig Boutilier},\n  Booktitle                = {Interactive Decision Theory and Game Theory, Papers from\n the 2011 AAAI Workshop, San Francisco, California, USA,\n August 8, 2011},\n  Year                     = {2011},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/WS/AAAIW11/paper/view/3807},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach.\n \n \n \n \n\n\n \n Viappiani, P.; Zilles, S.; Hamilton, H. J.; and Boutilier, C.\n\n\n \n\n\n\n In Algorithmic Decision Theory - Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings, pages 277-291, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"LearningLink\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{DBLP:conf/aldt/ViappianiZHB11,\n  Title                    = {Learning Complex Concepts Using Crowdsourcing: A Bayesian\n Approach},\n  Author                   = {Paolo Viappiani and\n Sandra Zilles and\n Howard J. Hamilton and\n Craig Boutilier},\n  Booktitle                = {Algorithmic Decision Theory - Second International Conference,\n ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings},\n  Year                     = {2011},\n  Pages                    = {277-291},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-24873-3_21},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011.\n \n \n \n\n\n \n Bacchus, F.; Domshlak, C.; Edelkamp, S.; and Helmert, M.,\n editors.\n \n\n\n \n\n\n\n AAAI. 2011.\n \n\n\n\n
\n\n\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
@Proceedings{DBLP:conf/aips/2011,\n  Title                    = {Proceedings of the 21st International Conference on Automated\n Planning and Scheduling, ICAPS 2011, Freiburg, Germany June\n 11-16, 2011},\n  Year                     = {2011},\n  Editor                   = {Fahiem Bacchus and\n Carmel Domshlak and\n Stefan Edelkamp and\n Malte Helmert},\n  Publisher                = {AAAI},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Booktitle                = {ICAPS},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (22)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Reasoning about Imperfect Information Games in the Epistemic Situation Calculus.\n \n \n \n \n\n\n \n Belle, V.; and Lakemeyer, G.\n\n\n \n\n\n\n In Proc. AAAI, pages 255–261, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"ReasoningLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 15 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/aaai/BelleL10,\n  Title                    = {Reasoning about Imperfect Information Games in the Epistemic Situation Calculus},\n  Author                   = {Vaishak Belle and Gerhard Lakemeyer},\n  Booktitle                = {Proc. AAAI},\n  Year                     = {2010},\n  Pages                    = {255--261},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Date-modified            = {2012-02-22 14:51:15 +0000},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1803},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Multi-Agent Only-Knowing Revisited.\n \n \n \n \n\n\n \n Belle, V.; and Lakemeyer, G.\n\n\n \n\n\n\n In Proc. KR, pages 49–60, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"Multi-AgentLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/kr/BelleL10,\n  Title                    = {Multi-Agent Only-Knowing Revisited},\n  Author                   = {Vaishak Belle and Gerhard Lakemeyer},\n  Booktitle                = {Proc. KR},\n  Year                     = {2010},\n  Pages                    = {49--60},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Date-modified            = {2012-02-22 14:50:35 +0000},\n  Ee                       = {http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1361},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Simultaneous Elicitation of Preference Features and Utility.\n \n \n \n \n\n\n \n Boutilier, C.; Regan, K.; and Viappiani, P.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"SimultaneousLink\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{DBLP:conf/aaai/BoutilierRV10,\n  Title                    = {Simultaneous Elicitation of Preference Features and Utility},\n  Author                   = {Craig Boutilier and\n Kevin Regan and\n Paolo Viappiani},\n  Booktitle                = {Proceedings of the Twenty-Fourth AAAI Conference on Artificial\n Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15,\n 2010},\n  Year                     = {2010},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1665},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Assessing regret-based preference elicitation with the UTPREF recommendation system.\n \n \n \n \n\n\n \n Braziunas, D.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010, pages 219-228, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"AssessingLink\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{DBLP:conf/sigecom/BraziunasB10,\n  Title                    = {Assessing regret-based preference elicitation with the UTPREF\n recommendation system},\n  Author                   = {Darius Braziunas and\n Craig Boutilier},\n  Booktitle                = {Proceedings 11th ACM Conference on Electronic Commerce (EC-2010),\n Cambridge, Massachusetts, USA, June 7-11, 2010},\n  Year                     = {2010},\n  Pages                    = {219-228},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/1807342.1807377},\n  Timestamp                = {2018.09.23}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Categorization of KR&R Methods for Requirement Analysis of a Query Answering Knowledge Base.\n \n \n \n \n\n\n \n Chaudhri, V. K.; Bredeweg, B.; Fikes, R.; McIlraith, S. A.; and Wellman, M. P.\n\n\n \n\n\n\n In FOIS, pages 158-171, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\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{DBLP:conf/fois/ChaudhriBFMW10,\n  Title                    = {A Categorization of KR{\\&amp;}R Methods for Requirement Analysis\n of a Query Answering Knowledge Base},\n  Author                   = {Vinay K. Chaudhri and\n Bert Bredeweg and\n Richard Fikes and\n Sheila A. McIlraith and\n Michael P. Wellman},\n  Booktitle                = {FOIS},\n  Year                     = {2010},\n  Pages                    = {158-171},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.3233/978-1-60750-535-8-158},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using Learnt Clauses in maxsat.\n \n \n \n \n\n\n \n Davies, J.; Cho, J.; and Bacchus, F.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference, CP 2010, St. Andrews, Scotland, UK, September 6-10, 2010. Proceedings, pages 176-190, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"UsingLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/cp/DaviesCB10,\n  Title                    = {Using Learnt Clauses in maxsat},\n  Author                   = {Jessica Davies and\n Jeremy Cho and\n Fahiem Bacchus},\n  Booktitle                = {Principles and Practice of Constraint Programming - CP 2010\n - 16th International Conference, CP 2010, St. Andrews, Scotland,\n UK, September 6-10, 2010. Proceedings},\n  Year                     = {2010},\n  Pages                    = {176-190},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-15396-9_17},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting QBF Duality on a Circuit Representation.\n \n \n \n \n\n\n \n Goultiaeva, A.; and Bacchus, F.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"ExploitingLink\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{DBLP:conf/aaai/GoultiaevaB10,\n  Title                    = {Exploiting QBF Duality on a Circuit Representation},\n  Author                   = {Alexandra Goultiaeva and\n Fahiem Bacchus},\n  Booktitle                = {Proceedings of the Twenty-Fourth AAAI Conference on Artificial\n Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15,\n 2010},\n  Year                     = {2010},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1791},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting Circuit Representations in QBF Solving.\n \n \n \n \n\n\n \n Goultiaeva, A.; and Bacchus, F.\n\n\n \n\n\n\n In Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings, pages 333-339, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"ExploitingLink\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{DBLP:conf/sat/GoultiaevaB10,\n  Title                    = {Exploiting Circuit Representations in QBF Solving},\n  Author                   = {Alexandra Goultiaeva and\n Fahiem Bacchus},\n  Booktitle                = {Theory and Applications of Satisfiability Testing - SAT\n 2010, 13th International Conference, SAT 2010, Edinburgh,\n UK, July 11-14, 2010. Proceedings},\n  Year                     = {2010},\n  Pages                    = {333-339},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-14186-7_29},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automated handwashing assistance for persons with dementia using video and a partially observable Markov decision process.\n \n \n \n \n\n\n \n Hoey, J.; Poupart, P.; von Bertoldi, A.; Craig, T.; Boutilier, C.; and Mihailidis, A.\n\n\n \n\n\n\n Computer Vision and Image Understanding, 114(5): 503-519. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"AutomatedLink\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{DBLP:journals/cviu/HoeyPBCBM10,\n  Title                    = {Automated handwashing assistance for persons with dementia\n using video and a partially observable Markov decision process},\n  Author                   = {Jesse Hoey and\n Pascal Poupart and\n Axel von Bertoldi and\n Tammy Craig and\n Craig Boutilier and\n Alex Mihailidis},\n  Journal                  = {Computer Vision and Image Understanding},\n  Year                     = {2010},\n  Number                   = {5},\n  Pages                    = {503-519},\n  Volume                   = {114},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1016/j.cviu.2009.06.008},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search.\n \n \n \n \n\n\n \n Hsu, E. I.; and McIlraith, S. A.\n\n\n \n\n\n\n In SOCS, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"ComputingLink\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{DBLP:conf/socs/HsuM10,\n  Title                    = {Computing Equivalent Transformations for Combinatorial Optimization\n by Branch-and-Bound Search},\n  Author                   = {Eric I. Hsu and\n Sheila A. McIlraith},\n  Booktitle                = {SOCS},\n  Year                     = {2010},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://aaai.org/ocs/index.php/SOCS/SOCS10/paper/view/2097},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Correctness Result for Reasoning about One-Dimensional Planning Problems.\n \n \n \n \n\n\n \n Hu, Y.; and Levesque, H. J.\n\n\n \n\n\n\n In KR, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/kr/HuL10,\n  Title                    = {A Correctness Result for Reasoning about One-Dimensional\n Planning Problems},\n  Author                   = {Yuxiao Hu and\n Hector J. Levesque},\n  Booktitle                = {KR},\n  Year                     = {2010},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1270},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Integrating Preferences into Goal Models for Requirements Engineering.\n \n \n \n \n\n\n \n Liaskos, S.; McIlraith, S. A.; Sohrabi, S.; and Mylopoulos, J.\n\n\n \n\n\n\n In Proceedings of the 10th International Requirements Engineering Conference (RE'10), Sydney, Australia, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"IntegratingPaper\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{LiMM.10,\n  Title                    = {Integrating Preferences into Goal Models for Requirements Engineering},\n  Author                   = {Sotirios Liaskos and\n Sheila A. McIlraith and\n Shirin Sohrabi and\n John Mylopoulos},\n  Booktitle                = {Proceedings of the 10th International Requirements Engineering Conference \n(RE'10)},\n  Year                     = {2010},\n\n  Address                  = {Sydney, Australia},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1284489411_PrefsRE10.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The unavailable candidate model: a decision-theoretic view of social choice.\n \n \n \n \n\n\n \n Lu, T.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010, pages 263-274, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"TheLink\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{DBLP:conf/sigecom/LuB10,\n  Title                    = {The unavailable candidate model: a decision-theoretic view\n of social choice},\n  Author                   = {Tyler Lu and\n Craig Boutilier},\n  Booktitle                = {Proceedings 11th ACM Conference on Electronic Commerce (EC-2010),\n Cambridge, Massachusetts, USA, June 7-11, 2010},\n  Year                     = {2010},\n  Pages                    = {263-274},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/1807342.1807385},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Leveraging dominators for preprocessing QBF.\n \n \n \n \n\n\n \n Mangassarian, H.; Le, B.; Goultiaeva, A.; Veneris, A. G.; and Bacchus, F.\n\n\n \n\n\n\n In Design, Automation and Test in Europe, DATE 2010, Dresden, Germany, March 8-12, 2010, pages 1695-1700, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"LeveragingLink\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{DBLP:conf/date/MangassarianLGVB10,\n  Title                    = {Leveraging dominators for preprocessing QBF},\n  Author                   = {Hratch Mangassarian and\n Bao Le and\n Alexandra Goultiaeva and\n Andreas G. Veneris and\n Fahiem Bacchus},\n  Booktitle                = {Design, Automation and Test in Europe, DATE 2010, Dresden,\n Germany, March 8-12, 2010},\n  Year                     = {2010},\n  Pages                    = {1695-1700},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5457088},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Fast d-DNNF Compilation with sharpSAT.\n \n \n \n \n\n\n \n Muise, C.; McIlraith, S. A.; and Beck, J. C.\n\n\n \n\n\n\n In Workshop on Abstraction, Reformulation, and Approximation (AAAI-10), Atlanta, GA, USA, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"FastPaper\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{mui-etal-wara10,\n  Title                    = {{Fast d-DNNF Compilation with sharpSAT}},\n  Author                   = {Muise, Christian and McIlraith, Sheila A. and Beck, J. Christopher},\n  Booktitle                = {Workshop on Abstraction, Reformulation, and Approximation (AAAI-10)},\n  Year                     = {2010},\n\n  Address                  = {Atlanta, GA, USA},\n\n  File                     = {:home/cjmuise/Documents/Mendeley Desktop/Workshop on Abstraction, Reformulation, and Approximation (AAAI-10)/2010/Fast d-DNNF Compilation with sharpSAT.pdf:pdf},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.haz.ca/docs/papers/wara-muise-10.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies.\n \n \n \n \n\n\n \n Regan, K.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"RobustLink\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{DBLP:conf/aaai/ReganB10,\n  Title                    = {Robust Policy Computation in Reward-Uncertain MDPs Using\n Nondominated Policies},\n  Author                   = {Kevin Regan and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Fourth AAAI Conference on Artificial\n Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15,\n 2010},\n  Year                     = {2010},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1610},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Customizing the Composition of Actions, Programs, and Web Services with User Preferences.\n \n \n \n \n\n\n \n Sohrabi, S.\n\n\n \n\n\n\n In ISWC10 Doctoral Consortium, Shanghai, China, November 2010. \n \n\n\n\n
\n\n\n\n \n \n \"CustomizingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{soh-mci-iswc-dc-10,\n  Title                    = { Customizing the Composition of Actions, Programs, and Web Services with User \nPreferences.},\n  Author                   = {Shirin Sohrabi},\n  Booktitle                = {ISWC10 Doctoral Consortium},\n  Year                     = {2010},\n\n  Address                  = {Shanghai, China},\n  Month                    = {November},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1284490303_}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Diagnosis as Planning Revisited.\n \n \n \n \n\n\n \n Sohrabi, S.; Baier, J. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR-10), pages 26-36, Toronto, Canada, May 2010. \n \n\n\n\n
\n\n\n\n \n \n \"DiagnosisPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 61 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{sohBiaMcIKR10,\n  Title                    = {Diagnosis as Planning Revisited},\n  Author                   = {Shirin Sohrabi and Jorge A. Baier and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR-10)},\n  Year                     = {2010},\n\n  Address                  = {Toronto, Canada},\n  Month                    = {May},\n  Pages                    = {26-36},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1273446217_KR10-014.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preference-Based Web Service Composition: A Middle Ground between Execution and Search.\n \n \n \n \n\n\n \n Sohrabi, S.; and McIlraith, S. A.\n\n\n \n\n\n\n In International Semantic Web Conference (1), pages 713-729, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"Preference-BasedLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/semweb/SohrabiM10,\n  Title                    = {Preference-Based Web Service Composition: A Middle Ground\n between Execution and Search},\n  Author                   = {Shirin Sohrabi and\n Sheila A. McIlraith},\n  Booktitle                = {International Semantic Web Conference (1)},\n  Year                     = {2010},\n  Pages                    = {713-729},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-17746-0_45},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preference-based Web Service Composition: A Middle Ground Between Execution and Search.\n \n \n \n \n\n\n \n Sohrabi, S.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 9th International Semantic Web Conference (ISWC10), Shanghai, China, November 2010. \n \n\n\n\n
\n\n\n\n \n \n \"Preference-basedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{soh-mci-iswc10,\n  Title                    = {Preference-based Web Service Composition: A Middle Ground Between Execution and \nSearch},\n  Author                   = {Shirin Sohrabi and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 9th International Semantic Web \nConference (ISWC10)},\n  Year                     = {2010},\n\n  Address                  = {Shanghai, China},\n  Month                    = {November},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1284490294_}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets.\n \n \n \n \n\n\n \n Viappiani, P.; and Boutilier, C.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, Vancouver, British Columbia, Canada, pages 2352-2360, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"OptimalLink\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{DBLP:conf/nips/ViappianiB10,\n  Title                    = {Optimal Bayesian Recommendation Sets and Myopically Optimal\n Choice Query Sets},\n  Author                   = {Paolo Viappiani and\n Craig Boutilier},\n  Booktitle                = {Advances in Neural Information Processing Systems 23: 24th\n Annual Conference on Neural Information Processing Systems\n 2010. Proceedings of a meeting held 6-9 December 2010, Vancouver,\n British Columbia, Canada},\n  Year                     = {2010},\n  Pages                    = {2352-2360},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://books.nips.cc/papers/files/nips23/NIPS2010_0444.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automated Channel Abstraction for Advertising Auctions.\n \n \n \n \n\n\n \n Walsh, W. E.; Boutilier, C.; Sandholm, T.; Shields, R.; Nemhauser, G. L.; and Parkes, D. C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"AutomatedLink\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{DBLP:conf/aaai/WalshBSSNP10,\n  Title                    = {Automated Channel Abstraction for Advertising Auctions},\n  Author                   = {William E. Walsh and\n Craig Boutilier and\n Tuomas Sandholm and\n Rob Shields and\n George L. Nemhauser and\n David C. Parkes},\n  Booktitle                = {Proceedings of the Twenty-Fourth AAAI Conference on Artificial\n Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15,\n 2010},\n  Year                     = {2010},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1905},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (24)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Solving #SAT and Bayesian Inference with Backtracking Search.\n \n \n \n \n\n\n \n Bacchus, F.; Dalmao, S.; and Pitassi, T.\n\n\n \n\n\n\n J. Artif. Intell. Res. (JAIR), 34: 391-442. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"SolvingLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/jair/BacchusDP09,\n  Title                    = {Solving \\#SAT and Bayesian Inference with Backtracking Search},\n  Author                   = {Fahiem Bacchus and\n Shannon Dalmao and\n Toniann Pitassi},\n  Journal                  = {J. Artif. Intell. Res. (JAIR)},\n  Year                     = {2009},\n  Pages                    = {391-442},\n  Volume                   = {34},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1613/jair.2648},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A heuristic search approach to planning with temporally extended preferences.\n \n \n \n \n\n\n \n Baier, J. A.; Bacchus, F.; and McIlraith, S. A.\n\n\n \n\n\n\n Artif. Intell., 173(5-6): 593-618. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 24 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/ai/BaierBM09,\n  Title                    = {A heuristic search approach to planning with temporally\n extended preferences},\n  Author                   = {Jorge A. Baier and\n Fahiem Bacchus and\n Sheila A. McIlraith},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2009},\n  Number                   = {5-6},\n  Pages                    = {593-618},\n  Volume                   = {173},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1016/j.artint.2008.11.011},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Online feature elicitation in interactive optimization.\n \n \n \n \n\n\n \n Boutilier, C.; Regan, K.; and Viappiani, P.\n\n\n \n\n\n\n In Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, pages 10, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"OnlineLink\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{DBLP:conf/icml/BoutilierRV09,\n  Title                    = {Online feature elicitation in interactive optimization},\n  Author                   = {Craig Boutilier and\n Kevin Regan and\n Paolo Viappiani},\n  Booktitle                = {Proceedings of the 26th Annual International Conference\n on Machine Learning, ICML 2009, Montreal, Quebec, Canada,\n June 14-18, 2009},\n  Year                     = {2009},\n  Pages                    = {10},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/1553374.1553384},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preference elicitation with subjective features.\n \n \n \n \n\n\n \n Boutilier, C.; Regan, K.; and Viappiani, P.\n\n\n \n\n\n\n In Proceedings of the 2009 ACM Conference on Recommender Systems, RecSys 2009, New York, NY, USA, October 23-25, 2009, pages 341-344, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"PreferenceLink\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{DBLP:conf/recsys/BoutilierRV09,\n  Title                    = {Preference elicitation with subjective features},\n  Author                   = {Craig Boutilier and\n Kevin Regan and\n Paolo Viappiani},\n  Booktitle                = {Proceedings of the 2009 ACM Conference on Recommender Systems,\n RecSys 2009, New York, NY, USA, October 23-25, 2009},\n  Year                     = {2009},\n  Pages                    = {341-344},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/1639714.1639783},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Monitoring the Generation and Execution of Optimal Plans.\n \n \n \n \n\n\n \n Fritz, C.\n\n\n \n\n\n\n Ph.D. Thesis, University of Toronto, April 2009.\n \n\n\n\n
\n\n\n\n \n \n \"MonitoringPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@PhdThesis{fri-phd09,\n  Title                    = {Monitoring the Generation and Execution of Optimal Plans},\n  Author                   = {Christian Fritz},\n  School                   = {University of Toronto},\n  Year                     = {2009},\n  Month                    = {April},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {Fritz_Christian_W_200906_PhD_thesis.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automatic Construction of Simple Artifact-based Business Processes.\n \n \n \n \n\n\n \n Fritz, C.; Hull, R.; and Su, J.\n\n\n \n\n\n\n In Proceedings of the 12th International Conference on Database Theory (ICDT), St. Petersburg, Russia, March 23-25, 2009, pages 225-238, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"AutomaticPaper\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{fri-hull-su-icdt09,\n  Title                    = {Automatic Construction of Simple Artifact-based Business Processes},\n  Author                   = {Christian Fritz and Rick Hull and Jianwen Su},\n  Booktitle                = {Proceedings of the 12th International Conference on Database Theory (ICDT), St. Petersburg, Russia, March 23-25, 2009},\n  Year                     = {2009},\n  Pages                    = {225-238},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {fri-hull-su-icdt09.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computing Robust Plans in Continuous Domains.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS), September 19-23, 2009, Thessaloniki, Greece, pages 346–349, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"ComputingPaper\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
@InProceedings{fri-mci-icaps09,\n  Title                    = {Computing Robust Plans in Continuous Domains},\n  Author                   = {Christian Fritz and Sheila McIlraith},\n  Booktitle                = {Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS), September 19-23, 2009, Thessaloniki, Greece},\n  Year                     = {2009},\n  Pages                    = {346--349},\n\n  Keyword                  = {Planning},\n  Timestamp                = {2018.09.23},\n  Urlpaper                 = {fri-mci-icaps09.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Generating Optimal Plans in Highly-Dynamic Domains.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of The 25th Conference on Uncertainty in Artificial Intelligence (UAI), Montreal, Canada, June 18-21, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"GeneratingPaper\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\n
\n
@InProceedings{fri-mci-uai09,\n  Title                    = {Generating Optimal Plans in Highly-Dynamic Domains},\n  Author                   = {Christian Fritz and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of The 25th Conference on Uncertainty in Artificial Intelligence (UAI), Montreal, Canada, June 18-21},\n  Year                     = {2009},\n\n  Keyword                  = {Planning},\n  Timestamp                = {2018.09.23},\n  Urlpaper                 = {fri-mci-uai09.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Beyond CNF: A Circuit-Based QBF Solver.\n \n \n \n \n\n\n \n Goultiaeva, A.; Iverson, V.; and Bacchus, F.\n\n\n \n\n\n\n In Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pages 412-426, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"BeyondLink\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{DBLP:conf/sat/GoultiaevaIB09,\n  Title                    = {Beyond CNF: A Circuit-Based QBF Solver},\n  Author                   = {Alexandra Goultiaeva and\n Vicki Iverson and\n Fahiem Bacchus},\n  Booktitle                = {Theory and Applications of Satisfiability Testing - SAT\n 2009, 12th International Conference, SAT 2009, Swansea,\n UK, June 30 - July 3, 2009. Proceedings},\n  Year                     = {2009},\n  Pages                    = {412-426},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-02777-2_38},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A probabilistic mental model for estimating disruption.\n \n \n \n \n\n\n \n Hui, B.; Partridge, G.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the 2009 International Conference on Intelligent User Interfaces, February 8-11, 2009, Sanibel Island, Florida, USA, pages 287-296, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\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{DBLP:conf/iui/HuiPB09,\n  Title                    = {A probabilistic mental model for estimating disruption},\n  Author                   = {Bowen Hui and\n Grant Partridge and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the 2009 International Conference on Intelligent\n User Interfaces, February 8-11, 2009, Sanibel Island, Florida,\n USA},\n  Year                     = {2009},\n  Pages                    = {287-296},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/1502650.1502691},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting Decomposition on Constraint Problems with High Tree-Width.\n \n \n \n \n\n\n \n Kitching, M.; and Bacchus, F.\n\n\n \n\n\n\n In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pages 525-531, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"ExploitingLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/ijcai/KitchingB09,\n  Title                    = {Exploiting Decomposition on Constraint Problems with High\n Tree-Width},\n  Author                   = {Matthew Kitching and\n Fahiem Bacchus},\n  Booktitle                = {IJCAI 2009, Proceedings of the 21st International Joint\n Conference on Artificial Intelligence, Pasadena, California,\n USA, July 11-17, 2009},\n  Year                     = {2009},\n  Pages                    = {525-531},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers09/Papers/IJCAI09-094.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Set Branching in Constraint Optimization.\n \n \n \n \n\n\n \n Kitching, M.; and Bacchus, F.\n\n\n \n\n\n\n In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pages 532-537, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"SetLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/ijcai/KitchingB09a,\n  Title                    = {Set Branching in Constraint Optimization},\n  Author                   = {Matthew Kitching and\n Fahiem Bacchus},\n  Booktitle                = {IJCAI 2009, Proceedings of the 21st International Joint\n Conference on Artificial Intelligence, Pasadena, California,\n USA, July 11-17, 2009},\n  Year                     = {2009},\n  Pages                    = {532-537},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers09/Papers/IJCAI09-095.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Semantical Account of Progression in the Presence of Defaults.\n \n \n \n \n\n\n \n Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n In Conceptual Modeling: Foundations and Applications, pages 82-98, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\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{DBLP:conf/birthday/LakemeyerL09,\n  Title                    = {A Semantical Account of Progression in the Presence of Defaults},\n  Author                   = {Gerhard Lakemeyer and\n Hector J. Levesque},\n  Booktitle                = {Conceptual Modeling: Foundations and Applications},\n  Year                     = {2009},\n  Pages                    = {82-98},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-642-02463-4_6},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Semantical Account of Progression in the Presence of Defaults.\n \n \n \n \n\n\n \n Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n In IJCAI, pages 842-847, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\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{DBLP:conf/ijcai/LakemeyerL09,\n  Title                    = {A Semantical Account of Progression in the Presence of Defaults},\n  Author                   = {Gerhard Lakemeyer and\n Hector J. Levesque},\n  Booktitle                = {IJCAI},\n  Year                     = {2009},\n  Pages                    = {842-847},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers09/Papers/IJCAI09-144.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Is It Enough to Get the Behavior Right?.\n \n \n \n \n\n\n \n Levesque, H. J.\n\n\n \n\n\n\n In IJCAI, pages 1439-1444, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"IsLink\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{DBLP:conf/ijcai/Levesque09,\n  Title                    = {Is It Enough to Get the Behavior Right?},\n  Author                   = {Hector J. Levesque},\n  Booktitle                = {IJCAI},\n  Year                     = {2009},\n  Pages                    = {1439-1444},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ijcai.org/papers09/Papers/IJCAI09-241.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting N-gram Analysis to Predict Operator Sequences.\n \n \n \n \n\n\n \n Muise, C.; Mcilraith, S. A.; Baier, J. A.; and Reimer, M.\n\n\n \n\n\n\n In 19th International Conference on Automated Planning and Scheduling, Thessaloniki, Greece, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"ExploitingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Muise2009,\n  Title                    = {{Exploiting N-gram Analysis to Predict Operator Sequences}},\n  Author                   = {Muise, Christian and Mcilraith, Sheila A. and Baier, Jorge A. and Reimer, Michael},\n  Booktitle                = {19th International Conference on Automated Planning and Scheduling},\n  Year                     = {2009},\n\n  Address                  = {Thessaloniki, Greece},\n\n  File                     = {:home/cjmuise/Documents/Mendeley Desktop/19th International Conference on Automated Planning and Scheduling/2009/Exploiting N-gram Analysis to Predict Operator Sequences.pdf:pdf},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.haz.ca/docs/papers/mui-etal-icaps09.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Regret-based Reward Elicitation for Markov Decision Processes.\n \n \n \n \n\n\n \n Regan, K.; and Boutilier, C.\n\n\n \n\n\n\n In UAI 2009, Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, Montreal, QC, Canada, June 18-21, 2009, pages 444-451, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"Regret-basedLink\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{DBLP:conf/uai/ReganB09,\n  Title                    = {Regret-based Reward Elicitation for Markov Decision Processes},\n  Author                   = {Kevin Regan and\n Craig Boutilier},\n  Booktitle                = {UAI 2009, Proceedings of the Twenty-Fifth Conference on\n Uncertainty in Artificial Intelligence, Montreal, QC, Canada,\n June 18-21, 2009},\n  Year                     = {2009},\n  Pages                    = {444-451},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://uai.sis.pitt.edu/displayArticleDetails.jsp?mmnu=1{\\&amp;}smnu=2{\\&amp;}article_id=1627{\\&amp;}proceeding_id=25},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Practical solution techniques for first-order MDPs.\n \n \n \n \n\n\n \n Sanner, S.; and Boutilier, C.\n\n\n \n\n\n\n Artif. Intell., 173(5-6): 748-788. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"PracticalLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 21 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/ai/SannerB09,\n  Title                    = {Practical solution techniques for first-order MDPs},\n  Author                   = {Scott Sanner and\n Craig Boutilier},\n  Journal                  = {Artif. Intell.},\n  Year                     = {2009},\n  Number                   = {5-6},\n  Pages                    = {748-788},\n  Volume                   = {173},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1016/j.artint.2008.11.003},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n HTN Planning with Preferences.\n \n \n \n \n\n\n \n Sohrabi, S.; Baier, J. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pages 1790 –1797, Pasadena, CA, USA, July 2009. \n This paper also appears in Commonsense 2009.\n\n\n\n
\n\n\n\n \n \n \"HTNPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 43 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{sohBiaMcIIJCAI09,\n  Title                    = {HTN Planning with Preferences},\n  Author                   = {Shirin Sohrabi and Jorge A. Baier and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09)},\n  Year                     = {2009},\n\n  Address                  = {Pasadena, CA, USA},\n  Month                    = {July},\n  Note                     = {This paper also appears in Commonsense 2009.},\n  Pages                    = {1790 --1797},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1242050782_Sohrabi-IJCAI09.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimizing Web Service Composition while Enforcing Regulations.\n \n \n \n \n\n\n \n Sohrabi, S.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 8th International Semantic Web Conference (ISWC09), pages 601-617, Chantilly, VA, USA, October 2009. \n \n\n\n\n
\n\n\n\n \n \n \"OptimizingPaper\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{soh-mci-iswc09,\n  Title                    = {Optimizing Web Service Composition while Enforcing Regulations},\n  Author                   = {Shirin Sohrabi and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 8th International Semantic Web Conference (ISWC09)},\n  Year                     = {2009},\n\n  Address                  = {Chantilly, VA, USA},\n  Month                    = {October},\n  Pages                    = {601-617},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1256919754_soh-mci-ISWC-09.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Web Service Composition via the Customization of Golog Programs with User Preferences.\n \n \n \n \n\n\n \n Sohrabi, S.; Prokoshyna, N.; and McIlraith, S. A.\n\n\n \n\n\n\n In Borgida, A. T.; Chaudhri, V. K.; Giorgini, P.; and Yu, E. S., editor(s), Conceptual Modeling: Foundations and Applications: Essays in Honor of John Mylopoulos, pages 319–334. Springer-Verlag, 2009.\n \n\n\n\n
\n\n\n\n \n \n \"WebPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InCollection{soh-pro-mci-jm09,\n  Title                    = {Web Service Composition via the Customization of Golog Programs with User Preferences},\n  Author                   = {Shirin Sohrabi and Nataliya Prokoshyna and Sheila A. McIlraith},\n  Booktitle                = {Conceptual Modeling: Foundations and Applications: Essays in Honor of John Mylopoulos},\n  Publisher                = {Springer-Verlag},\n  Year                     = {2009},\n  Editor                   = {Alexander T. Borgida and Vinay K. Chaudhri and Paolo Giorgini and Eric S. Yu},\n  Pages                    = {319--334},\n\n  Keywords                 = {Golog},\n  Opturl                   = {soh-pro-mci-jm09.pdf},\n  Timestamp                = {2018.09.23},\n  Url                      = {1249664263_soh-pro-mci-jm09.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal Set Recommendations Based on Regret.\n \n \n \n \n\n\n \n Viappiani, P.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the 7th Workshop on Intelligent Techniques for Web Personalization & Recommender Systems (ITWP'09), Pasadena, California, USA, July 11-17, 2009 in conjunction with the 21st International Joint Conference on Artificial Intelligence - IJCAI 2009, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"OptimalLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/ijcai/ViappianiB09,\n  Title                    = {Optimal Set Recommendations Based on Regret},\n  Author                   = {Paolo Viappiani and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the 7th Workshop on Intelligent Techniques\n for Web Personalization {\\&amp;} Recommender Systems (ITWP'09),\n Pasadena, California, USA, July 11-17, 2009 in conjunction\n with the 21st International Joint Conference on Artificial\n Intelligence - IJCAI 2009},\n  Year                     = {2009},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://ceur-ws.org/Vol-528/paper3.pdf},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Regret-based optimal recommendation sets in conversational recommender systems.\n \n \n \n \n\n\n \n Viappiani, P.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the 2009 ACM Conference on Recommender Systems, RecSys 2009, New York, NY, USA, October 23-25, 2009, pages 101-108, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"Regret-basedLink\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{DBLP:conf/recsys/ViappianiB09,\n  Title                    = {Regret-based optimal recommendation sets in conversational\n recommender systems},\n  Author                   = {Paolo Viappiani and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the 2009 ACM Conference on Recommender Systems,\n RecSys 2009, New York, NY, USA, October 23-25, 2009},\n  Year                     = {2009},\n  Pages                    = {101-108},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/1639714.1639732},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009.\n \n \n \n\n\n \n Boutilier, C.,\n editor.\n \n\n\n \n\n\n\n 2009.\n \n\n\n\n
\n\n\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
@Proceedings{DBLP:conf/ijcai/2009,\n  Title                    = {IJCAI 2009, Proceedings of the 21st International Joint\n Conference on Artificial Intelligence, Pasadena, California,\n USA, July 11-17, 2009},\n  Year                     = {2009},\n  Editor                   = {Craig Boutilier},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Booktitle                = {IJCAI},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (22)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners.\n \n \n \n \n\n\n \n Baier, J. A.; Fritz, C.; Bienvenu, M.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI), Nectar Track, pages 1509–1512, Chicago, Illinois, USA, July 13–17 2008. \n \n\n\n\n
\n\n\n\n \n \n \"BeyondPaper\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{bai-fri-bie-mci-aaai08nectar,\n  Title                    = {Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners},\n  Author                   = {Jorge A. Baier and Christian Fritz and Meghyn Bienvenu and Sheila McIlraith},\n  Booktitle                = {Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI), Nectar Track},\n  Year                     = {2008},\n\n  Address                  = {Chicago, Illinois, USA},\n  Month                    = {July 13--17},\n  Pages                    = {1509--1512},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bai-fri-bie-mci-aaai08nectar.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Peer-to-peer Query Answering with Inconsistent Knowledge.\n \n \n \n \n\n\n \n Binas, A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning, pages 329–339, Sydney, Australia, September 16–19 2008. \n \n\n\n\n
\n\n\n\n \n \n \"Peer-to-peerPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{bin-mci-kr08,\n  Title                    = {Peer-to-peer Query Answering with Inconsistent Knowledge},\n  Author                   = {Arnold Binas and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning},\n  Year                     = {2008},\n\n  Address                  = {Sydney, Australia},\n  Month                    = {September 16--19},\n  Pages                    = {329--339},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bin-mci-kr08.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing.\n \n \n \n \n\n\n \n Boutilier, C.; Parkes, D. C.; Sandholm, T.; and Walsh, W. E.\n\n\n \n\n\n\n In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pages 30-37, 2008. \n \n\n\n\n
\n\n\n\n \n \n \"ExpressiveLink\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{DBLP:conf/aaai/BoutilierPSW08,\n  Title                    = {Expressive Banner Ad Auctions and Model-Based Online Optimization\n for Clearing},\n  Author                   = {Craig Boutilier and\n David C. Parkes and\n Tuomas Sandholm and\n William E. Walsh},\n  Booktitle                = {Proceedings of the Twenty-Third AAAI Conference on Artificial\n Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,\n 2008},\n  Year                     = {2008},\n  Pages                    = {30-37},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/Library/AAAI/2008/aaai08-005.php},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Elicitation of Factored Utilities.\n \n \n \n \n\n\n \n Braziunas, D.; and Boutilier, C.\n\n\n \n\n\n\n AI Magazine, 29(4): 79-92. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"ElicitationLink\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{DBLP:journals/aim/BraziunasB08,\n  Title                    = {Elicitation of Factored Utilities},\n  Author                   = {Darius Braziunas and\n Craig Boutilier},\n  Journal                  = {AI Magazine},\n  Year                     = {2008},\n  Number                   = {4},\n  Pages                    = {79-92},\n  Volume                   = {29},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/ojs/index.php/aimagazine/article/view/2203},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sequential decision making in repeated coalition formation under uncertainty.\n \n \n \n \n\n\n \n Chalkiadakis, G.; and Boutilier, C.\n\n\n \n\n\n\n In 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), Estoril, Portugal, May 12-16, 2008, Volume 1, pages 347-354, 2008. \n \n\n\n\n
\n\n\n\n \n \n \"SequentialLink\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{DBLP:conf/atal/ChalkiadakisB08,\n  Title                    = {Sequential decision making in repeated coalition formation\n under uncertainty},\n  Author                   = {Georgios Chalkiadakis and\n Craig Boutilier},\n  Booktitle                = {7th International Joint Conference on Autonomous Agents\n and Multiagent Systems (AAMAS 2008), Estoril, Portugal,\n May 12-16, 2008, Volume 1},\n  Year                     = {2008},\n  Pages                    = {347-354},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/1402383.1402435},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Finding State Similarities for Faster Planning.\n \n \n \n \n\n\n \n Fritz, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI), pages 925–930, Chicago, Illinois, USA, July 13–17 2008. \n \n\n\n\n
\n\n\n\n \n \n \"FindingPaper\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{fri-aaai08,\n  Title                    = {Finding State Similarities for Faster Planning},\n  Author                   = {Christian Fritz},\n  Booktitle                = {Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI)},\n  Year                     = {2008},\n\n  Address                  = {Chicago, Illinois, USA},\n  Month                    = {July 13--17},\n  Pages                    = {925--930},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {fri-aaai08.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond.\n \n \n \n \n\n\n \n Fritz, C.; Baier, J. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings on the 11th International Conference on Principles of Knowledge Representation and Reasoning, pages 600–610, Sydney, Australia, September 16–19 2008. \n Technical Report CSRG-576, containing the proofs of the theorems and a more detailed description of the compilation, can be found <a href=\"ftp://ftp.cs.toronto.edu/csrg-technical-reports/576/fri-bai-mci-kr08-techreport.pdf\">here</a>.\n\n\n\n
\n\n\n\n \n \n \"ConGolog,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
@InProceedings{fri-bai-mci-kr08,\n  Title                    = {Con{G}olog, {S}in {T}rans: Compiling {ConGolog} into Basic Action Theories for Planning and Beyond},\n  Author                   = {Christian Fritz and Jorge A. Baier and Sheila A. McIlraith},\n  Booktitle                = {Proceedings on the 11th International Conference on Principles of Knowledge Representation and Reasoning},\n  Year                     = {2008},\n\n  Address                  = {Sydney, Australia},\n  Month                    = {September 16--19},\n  Note                     = {Technical Report CSRG-576, containing the proofs of the theorems and a more detailed description of the compilation, can be found \\&lt;a href="ftp://ftp.cs.toronto.edu/csrg-technical-reports/576/fri-bai-mci-kr08-techreport.pdf"\\&gt;here\\&lt;/a\\&gt;.},\n  Pages                    = {600--610},\n\n  Keywords                 = {Golog},\n  Timestamp                = {2018.09.23},\n  Url                      = {fri-bai-mci-kr08.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning in the Face of Frequent Exogenous Events.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Online Poster Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS), Sydney, Australia, September 14–18 2008. \n Also appeared in <i>Proceedings of The 1st International Symposium on Search Techniques in Artificial Intelligence and Robotics (at AAAI08)</i>, July 13–14, Chicago, IL, USA.\n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\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{fri-mci-icaps08,\n  Title                    = {Planning in the Face of Frequent Exogenous Events},\n  Author                   = {Christian Fritz and Sheila A. McIlraith},\n  Booktitle                = {Online Poster Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS)},\n  Year                     = {2008},\n\n  Address                  = {Sydney, Australia},\n  Month                    = {September 14--18},\n  Note                     = {Also appeared in \\&lt;i\\&gt;Proceedings of The 1st International Symposium on Search Techniques in Artificial Intelligence and Robotics (at AAAI08)\\&lt;/i\\&gt;, July 13--14, Chicago, IL, USA.},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {fri-mci-icaps08.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasoning about Large Taxonomies of Actions.\n \n \n \n \n\n\n \n Gu, Y.; and Soutchanski, M.\n\n\n \n\n\n\n In Proceedings of the Twenty-Third National Conference on Artificial Intelligence (AAAI-08), pages 931–937, 2008. AAAI\n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\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{GuSou2008ReasoningB,\n  Title                    = {Reasoning about Large Taxonomies of Actions},\n  Author                   = {Yilan Gu and Mikhail Soutchanski},\n  Booktitle                = {Proceedings of the Twenty-Third National Conference on Artificial Intelligence ({AAAI-08})},\n  Year                     = {2008},\n  Pages                    = {931--937},\n  Publisher                = {AAAI},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1239204621_GuSou2008.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A model-theoretic characterization of Asher and Vieu's ontology of mereotopology.\n \n \n \n \n\n\n \n Hahmann, T.; and Gruninger, M.\n\n\n \n\n\n\n In Proceedings of KR'08: Principles of Knowledge Representation and Reasoning, Sydney, Australia, September 16–19 2008. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{hahmann08mereotopology,\n  Title                    = {A model-theoretic characterization of {Asher and Vieu's} ontology of mereotopology},\n  Author                   = {Hahmann, Torsten and Gruninger, Michael},\n  Booktitle                = {Proceedings of {KR}'08: Principles of Knowledge Representation and Reasoning},\n  Year                     = {2008},\n\n  Address                  = {Sydney, Australia},\n  Month                    = {September 16--19},\n\n  Opturl                   = {hahmann08mereotopology.pdf},\n  Timestamp                = {2018.09.23},\n  Url                      = {1225747764_hahmann08mereotopology.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Clause Learning Can Effectively P-Simulate General Propositional Resolution.\n \n \n \n \n\n\n \n Hertel, P.; Bacchus, F.; Pitassi, T.; and Gelder, A. V.\n\n\n \n\n\n\n In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pages 283-290, 2008. \n \n\n\n\n
\n\n\n\n \n \n \"ClauseLink\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{DBLP:conf/aaai/HertelBPG08,\n  Title                    = {Clause Learning Can Effectively P-Simulate General Propositional\n Resolution},\n  Author                   = {Philipp Hertel and\n Fahiem Bacchus and\n Toniann Pitassi and\n Allen Van Gelder},\n  Booktitle                = {Proceedings of the Twenty-Third AAAI Conference on Artificial\n Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,\n 2008},\n  Year                     = {2008},\n  Pages                    = {283-290},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/Library/AAAI/2008/aaai08-045.php},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Probabilistically Estimating Backbones and Variable Bias: Experimental Overview.\n \n \n \n \n\n\n \n Hsu, E. I; Muise, C.; Beck, J. C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming, 14th International Conference, pages 613–617, Sydney, Australia, 2008. \n \n\n\n\n
\n\n\n\n \n \n \"ProbabilisticallyPaper\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{DBLP:conf/cp/HsuMBM08,\n  Title                    = {{Probabilistically Estimating Backbones and Variable Bias: Experimental Overview}},\n  Author                   = {Hsu, Eric I and Muise, Christian and Beck, J. Christopher and McIlraith, Sheila A.},\n  Booktitle                = {Principles and Practice of Constraint Programming, 14th International Conference},\n  Year                     = {2008},\n\n  Address                  = {Sydney, Australia},\n  Pages                    = {613--617},\n\n  File                     = {:home/cjmuise/Documents/Mendeley Desktop/Principles and Practice of Constraint Programming, 14th International Conference/2008/Probabilistically Estimating Backbones and Variable Bias Experimental Overview.pdf:pdf},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.haz.ca/docs/papers/hsu-cp2008.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Toward Experiential Utility Elicitation for Interface Customization.\n \n \n \n \n\n\n \n Hui, B.; and Boutilier, C.\n\n\n \n\n\n\n In UAI 2008, Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence, Helsinki, Finland, July 9-12, 2008, pages 298-305, 2008. \n \n\n\n\n
\n\n\n\n \n \n \"TowardLink\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{DBLP:conf/uai/HuiB08,\n  Title                    = {Toward Experiential Utility Elicitation for Interface Customization},\n  Author                   = {Bowen Hui and\n Craig Boutilier},\n  Booktitle                = {UAI 2008, Proceedings of the 24th Conference in Uncertainty\n in Artificial Intelligence, Helsinki, Finland, July 9-12,\n 2008},\n  Year                     = {2008},\n  Pages                    = {298-305},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://uai.sis.pitt.edu/displayArticleDetails.jsp?mmnu=1{\\&amp;}smnu=2{\\&amp;}article_id=1954{\\&amp;}proceeding_id=24},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The need for an interaction cost model in adaptive interfaces.\n \n \n \n \n\n\n \n Hui, B.; Gustafson, S.; Irani, P.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the working conference on Advanced Visual Interfaces, AVI 2008, Napoli, Italy, May 28-30, 2008, pages 458-461, 2008. \n \n\n\n\n
\n\n\n\n \n \n \"TheLink\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{DBLP:conf/avi/HuiGIB08,\n  Title                    = {The need for an interaction cost model in adaptive interfaces},\n  Author                   = {Bowen Hui and\n Sean Gustafson and\n Pourang Irani and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the working conference on Advanced Visual\n Interfaces, AVI 2008, Napoli, Italy, May 28-30, 2008},\n  Year                     = {2008},\n  Pages                    = {458-461},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://doi.acm.org/10.1145/1385569.1385658},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting Decomposition in Constraint Optimization Problems.\n \n \n \n \n\n\n \n Kitching, M.; and Bacchus, F.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings, pages 478-492, 2008. \n \n\n\n\n
\n\n\n\n \n \n \"ExploitingLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/cp/KitchingB08,\n  Title                    = {Exploiting Decomposition in Constraint Optimization Problems},\n  Author                   = {Matthew Kitching and\n Fahiem Bacchus},\n  Booktitle                = {Principles and Practice of Constraint Programming, 14th\n International Conference, CP 2008, Sydney, Australia, September\n 14-18, 2008. Proceedings},\n  Year                     = {2008},\n  Pages                    = {478-492},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-540-85958-1_32},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Intelligent Decision Support in Medicine: Back to Bayes?.\n \n \n \n\n\n \n Lindgaard, G.; Egan, P.; Jones, C. N.; Pyper, C.; Frize, M.; Walker, R. C.; Boutilier, C.; Hui, B.; Narasimhan, S.; Folkens, J.; and Winogron, B.\n\n\n \n\n\n\n J. UCS, 14(16): 2720-2736. 2008.\n \n\n\n\n
\n\n\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{DBLP:journals/jucs/LindgaardEJPFWBHNFW08,\n  Title                    = {Intelligent Decision Support in Medicine: Back to Bayes?},\n  Author                   = {Gitte Lindgaard and\n Peter Egan and\n Colin N. Jones and\n Catherine Pyper and\n Monique Frize and\n Robin C. Walker and\n Craig Boutilier and\n Bowen Hui and\n Sheila Narasimhan and\n Janette Folkens and\n Bill Winogron},\n  Journal                  = {J. UCS},\n  Year                     = {2008},\n  Number                   = {16},\n  Pages                    = {2720-2736},\n  Volume                   = {14},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n HTN Planning with Quantitative Preferences via Heuristic Search.\n \n \n \n \n\n\n \n Sohrabi, S.; Baier, J. A.; and McIlraith, S.\n\n\n \n\n\n\n In Eighteeth International Conference on Automated Planning and Scheduling (ICAPS) Workshop on Oversubscribed Planning and Scheduling, Sydney, Australia, 2008. \n \n\n\n\n
\n\n\n\n \n \n \"HTNPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{sohMciBiaICAPSworkshop08,\n  Title                    = {HTN Planning with Quantitative Preferences via Heuristic Search},\n  Author                   = {Shirin Sohrabi and Jorge A. Baier and Sheila McIlraith},\n  Booktitle                = {Eighteeth International Conference on Automated Planning and Scheduling (ICAPS) Workshop on Oversubscribed Planning and Scheduling},\n  Year                     = {2008},\n\n  Address                  = {Sydney, Australia},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {soh-bai-mci-icaps08wkshp.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Planning with Preferences in HTN.\n \n \n \n \n\n\n \n Sohrabi, S.; and McIlraith, S. A.\n\n\n \n\n\n\n In the 4th Multidisciplinary Workshop on Advances in Preference Handling (M-Pref08) at AAAI-08, pages 103-109, Chicago, IL, USA, July 2008. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{mpref08SohMcI,\n  Title                    = {On Planning with Preferences in HTN},\n  Author                   = {Shirin Sohrabi and Sheila A. McIlraith},\n  Booktitle                = {the 4th Multidisciplinary Workshop on Advances in Preference Handling (M-Pref08) at AAAI-08},\n  Year                     = {2008},\n\n  Address                  = {Chicago, IL, USA},\n  Month                    = {July},\n  Pages                    = {103-109},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1225922953_soh-mci-m-pref08.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Planning with Preferences in HTN.\n \n \n \n \n\n\n \n Sohrabi, S.; and McIlraith, S. A.\n\n\n \n\n\n\n In the 12th International Workshop on Non-Monotonic Reasoning (NMR08), pages 241-248, Sydney, Australia, September 2008. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{nmr08sohMcI,\n  Title                    = {On Planning with Preferences in HTN},\n  Author                   = {Shirin Sohrabi and Sheila A. McIlraith},\n  Booktitle                = {the 12th International Workshop on Non-Monotonic Reasoning (NMR08)},\n  Year                     = {2008},\n\n  Address                  = {Sydney, Australia},\n  Month                    = {September},\n  Pages                    = {241-248},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1225923005_soh-mci-nmr08.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n First-Order Strong Progression for Local-Effect Basic Action Theories.\n \n \n \n \n\n\n \n Vassos, S.; Gerhard, L.; and Levesque, H.\n\n\n \n\n\n\n In Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR-08), Sydney, Australia, September 16–19 2008. \n To appear.\n\n\n\n
\n\n\n\n \n \n \"First-OrderPaper\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{vassos08localeffect,\n  Title                    = {First-Order Strong Progression for Local-Effect Basic Action\n Theories},\n  Author                   = {Vassos, Stavros and Gerhard, Lakemeyer and Levesque, Hector},\n  Booktitle                = {Proceedings of the Eleventh International Conference on\n Principles of Knowledge Representation and Reasoning (KR-08)},\n  Year                     = {2008},\n\n  Address                  = {Sydney, Australia},\n  Month                    = {September 16--19},\n  Note                     = {To appear.},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {vassos-lakemeyer-levesque08localeffect.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture.\n \n \n \n \n\n\n \n Vassos, S.; and Levesque, H.\n\n\n \n\n\n\n In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-08), pages 1004-1009, Chicago, Illinois, USA, July 13–17 2008. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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 \n \n\n\n\n
\n
@InProceedings{vassos08conjecture,\n  Title                    = {On the Progression of Situation Calculus Basic Action Theories:\n Resolving a 10-year-old Conjecture},\n  Author                   = {Vassos, Stavros and Levesque, Hector},\n  Booktitle                = {Proceedings of the Twenty-Third AAAI Conference on Artificial\n Intelligence (AAAI-08)},\n  Year                     = {2008},\n\n  Address                  = {Chicago, Illinois, USA},\n  Month                    = {July 13--17},\n  Pages                    = {1004-1009},\n\n  Abstract                 = {In a seminal paper, Lin and Reiter introduced a\nmodel-theoretic definition for the progression of the initial\nknowledge base of a basic action theory. This definition comes\nwith a strong negative result, namely that for certain kinds of\naction theories, first-order logic is not expressive enough to\ncorrectly characterize this form of progression, and second-order\naxioms are necessary. However, Lin and Reiter also considered an\nalternative definition for progression which is always\nfirst-order definable. They conjectured that this alternative\ndefinition is incorrect in the sense that the progressed theory\nis too weak and may sometimes lose information. This conjecture,\nand the status of first-order definable progression, has remained\nopen since then. In this paper we present two significant results\nabout this alternative definition of progression. First, we prove\nthe Lin and Reiter conjecture by presenting a case where the\nprogressed theory indeed does lose information. Second, we prove\nthat the alternative definition is nonetheless correct for\nreasoning about a large class of sentences, including some that\nquantify over situations. In this case the alternative definition\nis a preferred option due to its simplicity and the fact that it\nis always first-order.},\n  Areas                    = {Cognitive Robotics},\n  Keyword                  = {progression, reasoning about action, situation calculus, cognitive robotics},\n  Timestamp                = {2018.09.23},\n  Url                      = {vassos-levesque08conjecture.pdf}\n}\n\n
\n
\n\n\n
\n In a seminal paper, Lin and Reiter introduced a model-theoretic definition for the progression of the initial knowledge base of a basic action theory. This definition comes with a strong negative result, namely that for certain kinds of action theories, first-order logic is not expressive enough to correctly characterize this form of progression, and second-order axioms are necessary. However, Lin and Reiter also considered an alternative definition for progression which is always first-order definable. They conjectured that this alternative definition is incorrect in the sense that the progressed theory is too weak and may sometimes lose information. This conjecture, and the status of first-order definable progression, has remained open since then. In this paper we present two significant results about this alternative definition of progression. First, we prove the Lin and Reiter conjecture by presenting a case where the progressed theory indeed does lose information. Second, we prove that the alternative definition is nonetheless correct for reasoning about a large class of sentences, including some that quantify over situations. In this case the alternative definition is a preferred option due to its simplicity and the fact that it is always first-order.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computing Reserve Prices and Identifying the Value Distribution in Real-world Auctions with Market Disruptions.\n \n \n \n \n\n\n \n Walsh, W. E.; Parkes, D. C.; Sandholm, T.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pages 1499-1502, 2008. \n \n\n\n\n
\n\n\n\n \n \n \"ComputingLink\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{DBLP:conf/aaai/WalshPSB08,\n  Title                    = {Computing Reserve Prices and Identifying the Value Distribution\n in Real-world Auctions with Market Disruptions},\n  Author                   = {William E. Walsh and\n David C. Parkes and\n Tuomas Sandholm and\n Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Third AAAI Conference on Artificial\n Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,\n 2008},\n  Year                     = {2008},\n  Pages                    = {1499-1502},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://www.aaai.org/Library/AAAI/2008/aaai08-248.php},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (23)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Caching in Backtracking Search.\n \n \n \n \n\n\n \n Bacchus, F.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings, pages 1, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"CachingLink\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{DBLP:conf/cp/Bacchus07,\n  Title                    = {Caching in Backtracking Search},\n  Author                   = {Fahiem Bacchus},\n  Booktitle                = {Principles and Practice of Constraint Programming - CP 2007,\n 13th International Conference, CP 2007, Providence, RI,\n USA, September 23-27, 2007, Proceedings},\n  Year                     = {2007},\n  Pages                    = {1},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-540-74970-7_1},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n GAC Via Unit Propagation.\n \n \n \n \n\n\n \n Bacchus, F.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings, pages 133-147, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"GACLink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/cp/Bacchus07a,\n  Title                    = {GAC Via Unit Propagation},\n  Author                   = {Fahiem Bacchus},\n  Booktitle                = {Principles and Practice of Constraint Programming - CP 2007,\n 13th International Conference, CP 2007, Providence, RI,\n USA, September 23-27, 2007, Proceedings},\n  Year                     = {2007},\n  Pages                    = {133-147},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-540-74970-7_12},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Solution Directed Backjumping for QCSP.\n \n \n \n \n\n\n \n Bacchus, F.; and Stergiou, K.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings, pages 148-163, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"SolutionLink\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{DBLP:conf/cp/BacchusS07,\n  Title                    = {Solution Directed Backjumping for QCSP},\n  Author                   = {Fahiem Bacchus and\n Kostas Stergiou},\n  Booktitle                = {Principles and Practice of Constraint Programming - CP 2007,\n 13th International Conference, CP 2007, Providence, RI,\n USA, September 23-27, 2007, Proceedings},\n  Year                     = {2007},\n  Pages                    = {148-163},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-540-74970-7_13},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners.\n \n \n \n \n\n\n \n Baier, J. A.; Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007), Providence, Rhode Island, USA, September 22 - 26 2007. \n \n\n\n\n
\n\n\n\n \n \n \"ExploitingPaper\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{bai-fri-mci-icaps07,\n  Title                    = {Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners},\n  Author                   = {Jorge A. Baier and Christian Fritz and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007)},\n  Year                     = {2007},\n\n  Address                  = {Providence, Rhode Island, USA},\n  Month                    = {September 22 - 26},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bai-fri-mci-icaps07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Domain-Independent Heuristics for Planning with Qualitative Preferences.\n \n \n \n \n\n\n \n Baier, J. A.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 7th IJCAI International Workshop on Nonmonotonic Reasoning, Action and Change (NRAC-07), Hyderabad, India, January 2007. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{bai-mci-nrac07,\n  Title                    = {On Domain-Independent Heuristics for Planning with Qualitative Preferences},\n  Author                   = {Jorge A. Baier and Sheila McIlraith},\n  Booktitle                = {Proceedings of the 7th IJCAI International Workshop on\nNonmonotonic Reasoning, Action and Change (NRAC-07)},\n  Year                     = {2007},\n\n  Address                  = {Hyderabad, India},\n  Month                    = {January},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bai-mci-nrac07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Heuristic Search Approach to Planning with Temporally Extended Preferences.\n \n \n \n \n\n\n \n Baier, J.; Bacchus, F.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), pages 1808-1815, Hyderabad, India, January 2007. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{bai-bac-mci-ijcai07,\n  Title                    = {A Heuristic Search Approach to Planning with Temporally Extended Preferences},\n  Author                   = {Baier, J. and Bacchus, F. and McIlraith, S.},\n  Booktitle                = {Proceedings of the Twentieth International Joint \n Conference on Artificial Intelligence (IJCAI-07)},\n  Year                     = {2007},\n\n  Address                  = {Hyderabad, India},\n  Month                    = {January},\n  Pages                    = {1808-1815},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bai-bac-mci-ijcai07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Stochastic Constraint Satisfaction Framework.\n \n \n \n \n\n\n \n Bordeaux, L.; and Samulowitz, H.\n\n\n \n\n\n\n In SAC 2007 (The 22nd Annual ACM Symposium on Applied Computing), 2007. ACM\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{BSSCSP,\n  Title                    = {On the Stochastic Constraint Satisfaction Framework},\n  Author                   = {L. Bordeaux and H. Samulowitz},\n  Booktitle                = { SAC 2007 (The 22nd Annual ACM Symposium on Applied Computing)},\n  Year                     = {2007},\n  Publisher                = ACM,\n\n  Timestamp                = {2018.09.23},\n  Url                      = {BSSCSP.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Minimax regret based elicitation of generalized additive utilities.\n \n \n \n \n\n\n \n Braziunas, D.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-third Conference on Uncertainty in Artificial Intelligence (UAI-07), Vancouver, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"MinimaxPaper\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{BraziunasBoutilier-UAI07,\n  Title                    = {Minimax regret based elicitation of generalized additive utilities},\n  Author                   = {Darius Braziunas and Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-third Conference on Uncertainty in Artificial \nIntelligence (UAI-07)},\n  Year                     = {2007},\n\n  Address                  = {Vancouver},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {BraziunasBoutilier-UAI07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Coalitional Bargaining with Agent Type Uncertainty.\n \n \n \n \n\n\n \n Chalkiadakis, G.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twentieth International Joint Conference in Artificial Intelligence (IJCAI-07), pages 1227–1232, Hyderabad, India, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"CoalitionalPaper\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{chalkiadakis:ijcai07,\n  Title                    = {Coalitional Bargaining with Agent Type Uncertainty},\n  Author                   = {Georgios Chalkiadakis and Craig Boutilier},\n  Booktitle                = {Proceedings of the Twentieth International Joint Conference in Artificial Intelligence (IJCAI-07)},\n  Year                     = {2007},\n\n  Address                  = {Hyderabad, India},\n  Pages                    = {1227--1232},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {gehalk_IJCAI07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Coalition Formation under Uncertainty: Bargaining Equilibria and the Bayesian Core Stability Concept.\n \n \n \n \n\n\n \n Chalkiadakis, G.; Markakis, E.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-07), Hawaii, USA, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"CoalitionPaper\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{chalkiadakis:aamas07,\n  Title                    = {Coalition Formation under Uncertainty: Bargaining Equilibria and the Bayesian Core Stability Concept},\n  Author                   = {Georgios Chalkiadakis and Evangelos Markakis and Craig Boutilier},\n  Booktitle                = {Proceedings of the Sixth International Joint\n Conference on Autonomous Agents and Multiagent Systems (AAMAS-07)},\n  Year                     = {2007},\n\n  Address                  = {Hawaii, USA},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {gehalk_AAMAS07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Situation-Calculus Semantics for an Expressive Fragment of PDDL.\n \n \n \n \n\n\n \n Classen, J.; Hu, Y.; and Lakemeyer, G.\n\n\n \n\n\n\n In Proceedings of the Twentysecond Conference on Artificial Intelligence (AAAI-07), 2007. AAAI Press\n to appear\n\n\n\n
\n\n\n\n \n \n \"APaper\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{ClassenHuLakemeyer2007PDDL,\n  Title                    = {A Situation-Calculus Semantics for an Expressive Fragment of\nPDDL},\n  Author                   = {Jens Classen and Yuxiao Hu and Gerhard Lakemeyer},\n  Booktitle                = {Proceedings of the Twentysecond Conference on Artificial Intelligence\n(AAAI-07)},\n  Year                     = {2007},\n  Note                     = {to appear},\n  Publisher                = {AAAI Press},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ClassenHuLakemeyer2007PDDL.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using More Reasoning to Improve #SAT Solving.\n \n \n \n \n\n\n \n Davies, J.; and Bacchus, F.\n\n\n \n\n\n\n In AAAI, 2007. Springer\n \n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{sharp2clseq07,\n  Title                    = {Using More Reasoning to Improve \\#SAT Solving},\n  Author                   = {J. Davies and F. Bacchus},\n  Booktitle                = {AAAI},\n  Year                     = {2007},\n  Publisher                = Springer,\n\n  Timestamp                = {2018.09.23},\n  Url                      = {davies_aaai07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Monitoring Plan Optimality during Execution: Theory and Implementation.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S.\n\n\n \n\n\n\n In The 18th International Workshop on Principles of Diagnosis (DX-07), Nashville, TN, USA, May 29–31 2007. \n An extended version of this paper appeared at ICAPS07.\n\n\n\n
\n\n\n\n \n \n \"MonitoringPaper\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{fri-mci-dx07.pdf_200705141423,\n  Title                    = {Monitoring Plan Optimality during Execution: Theory and Implementation},\n  Author                   = {Christian Fritz and Sheila McIlraith},\n  Booktitle                = {The 18th International Workshop on Principles of Diagnosis (DX-07)},\n  Year                     = {2007},\n\n  Address                  = {Nashville, TN, USA},\n  Month                    = {May 29--31},\n  Note                     = {An extended version of this paper appeared at ICAPS07.},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {200705141423_fri-mci-dx07.pdf.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Monitoring Plan Optimality During Execution.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007), Providence, Rhode Island, USA, September 22 - 26 2007. \n \n\n\n\n
\n\n\n\n \n \n \"MonitoringPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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\n
\n
@InProceedings{fri-mci-icaps07,\n  Title                    = {Monitoring Plan Optimality During Execution},\n  Author                   = {Christian Fritz and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007)},\n  Year                     = {2007},\n\n  Address                  = {Providence, Rhode Island, USA},\n  Month                    = {September 22 - 26},\n\n  Abstract                 = {\nA great deal of research has addressed the problem of generating\noptimal plans, but these plans are of limited use in\ncircumstances where noisy sensors, unanticipated exogenous\nactions, or imperfect models result in discrepancies between\npredicted and observed states of the world during plan execution.\nSuch discrepancies bring into question the continued optimality\nof the plan being executed and, according to current-day\npractice, are resolved by aborting the plan and replanning, often\nunnecessarily. In this paper we address the problem of monitoring\nthe continued optimality of a given plan at execution time, in\nthe face of such discrepancies. While replanning cannot be\navoided when critical aspects of the environment change, our\nobjective is to avoid replanning unnecessarily. We address the\nproblem by building on practical approaches to monitoring plan\nvalidity. We begin by formalizing plan validity in the situation\ncalculus and characterizing common approaches to monitoring plan\nvalidity. We then generalize this characterization to the notion\nof plan optimality and propose an algorithm that verifies\ncontinued plan optimality. We have implemented our algorithm and\ntested it on simulated execution failures in well-known planning\ndomains. Experimental results yield a significant speed-up in\nperformance over the alternative of replanning, clearly\ndemonstrating the merit of our approach.},\n  Keyword                  = {execution monitoring, planning},\n  Timestamp                = {2018.09.23},\n  Url                      = {fri-mci-icaps07.pdf}\n}\n\n
\n
\n\n\n
\n A great deal of research has addressed the problem of generating optimal plans, but these plans are of limited use in circumstances where noisy sensors, unanticipated exogenous actions, or imperfect models result in discrepancies between predicted and observed states of the world during plan execution. Such discrepancies bring into question the continued optimality of the plan being executed and, according to current-day practice, are resolved by aborting the plan and replanning, often unnecessarily. In this paper we address the problem of monitoring the continued optimality of a given plan at execution time, in the face of such discrepancies. While replanning cannot be avoided when critical aspects of the environment change, our objective is to avoid replanning unnecessarily. We address the problem by building on practical approaches to monitoring plan validity. We begin by formalizing plan validity in the situation calculus and characterizing common approaches to monitoring plan validity. We then generalize this characterization to the notion of plan optimality and propose an algorithm that verifies continued plan optimality. We have implemented our algorithm and tested it on simulated execution failures in well-known planning domains. Experimental results yield a significant speed-up in performance over the alternative of replanning, clearly demonstrating the merit of our approach.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Monitoring Policy Execution.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 3rd Workshop on Planning and Plan Execution for Real-World Systems, Providence, Rhode Island, USA, September 22 2007. \n (at ICAPS07)\n\n\n\n
\n\n\n\n \n \n \"MonitoringPaper\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{fri-mci-icaps07ws,\n  Title                    = {Monitoring Policy Execution},\n  Author                   = {Christian Fritz and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 3rd Workshop on Planning and Plan Execution for Real-World Systems},\n  Year                     = {2007},\n\n  Address                  = {Providence, Rhode Island, USA},\n  Month                    = {September 22},\n  Note                     = {(at ICAPS07)},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {fri-mci-icaps07WS.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decidable Reasoning in a Modified Situation Calculus.\n \n \n \n \n\n\n \n Gu, Y.; and Soutchanski, M.\n\n\n \n\n\n\n In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), Hyderabad,Andhra Pradesh, India, January 2007. \n \n\n\n\n
\n\n\n\n \n \n \"DecidablePaper\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{GuSouIJCAI07decidableSC,\n  Title                    = {Decidable Reasoning in a Modified Situation Calculus},\n  Author                   = {Yilan Gu and Mikhail Soutchanski},\n  Booktitle                = {Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07)},\n  Year                     = {2007},\n\n  Address                  = {Hyderabad,Andhra Pradesh, India},\n  Month                    = {January},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {YGu_ijcai07_deciableSC.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Modular Basic Action Theories.\n \n \n \n \n\n\n \n Gu, Y.; and Soutchanski, M.\n\n\n \n\n\n\n In Williams, M. A.; Karol, A.; and Peppas, P., editor(s), Proceedings of the 7th IJCAI International Workshop on Nonmontonic Reasoning, Action and Change (NRAC-07), pages 73–78, Hyderabad,Andhra Pradesh, India, January 2007. \n \n\n\n\n
\n\n\n\n \n \n \"ModularPaper\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{GuSouNRAC07mbat,\n  Title                    = {Modular Basic Action Theories},\n  Author                   = {Yilan Gu and Mikhail Soutchanski},\n  Booktitle                = {Proceedings of the 7th IJCAI International Workshop on Nonmontonic Reasoning, Action and Change (NRAC-07)},\n  Year                     = {2007},\n\n  Address                  = {Hyderabad,Andhra Pradesh, India},\n  Editor                   = {Mary Anne Williams and Alankar Karol and Pavlos Peppas},\n  Month                    = {January},\n  Pages                    = {73--78},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {YGu_nrac07_mBAT.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using Expectation Maximization to Find Likely Assignments for Solving CSP's.\n \n \n \n \n\n\n \n Hsu, E. I.; Kitching, M.; Bacchus, F.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proc. of 22nd Conference on Artificial Intelligence (AAAI '07), Vancouver, Canada, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"UsingPaper\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{hsu07,\n  Title                    = {Using Expectation Maximization to Find Likely Assignments\n for Solving CSP's},\n  Author                   = {Eric I. Hsu and Matthew Kitching and Fahiem Bacchus and\n Sheila A. McIlraith},\n  Booktitle                = {Proc. of 22nd Conference on Artificial Intelligence (AAAI\n '07), Vancouver, Canada},\n  Year                     = {2007},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {eihsu_aaai07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n One-Shot Mechanism Design with Partial Revelation.\n \n \n \n \n\n\n \n Hyafil, N.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), 2007. \n \n\n\n\n
\n\n\n\n \n \n \"One-ShotPaper\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{hyafilBoutilier-ijcai07,\n  Title                    = {One-Shot Mechanism Design with Partial Revelation},\n  Author                   = {Nathanael Hyafil and Craig Boutilier},\n  Booktitle                = {Proceedings of the Twentieth International Joint\n Conference on Artificial Intelligence (IJCAI 2007)},\n  Year                     = {2007},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {HyafilBoutilier-IJCAI07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Symmetric Component Caching.\n \n \n \n\n\n \n Kitching, M.; and Bacchus, F.\n\n\n \n\n\n\n In Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI '07), Hyderabad, India, 2007. \n \n\n\n\n
\n\n\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{kitching07,\n  Title                    = {Symmetric Component Caching},\n  Author                   = {M. Kitching and F. Bacchus},\n  Booktitle                = {Proc. of the 20th International Joint Conference on\n Artificial Intelligence (IJCAI '07), Hyderabad, India},\n  Year                     = {2007},\n\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Dynamically Partitioning for Solving QBF.\n \n \n \n \n\n\n \n Samulowitz, H.; and Bacchus, F.\n\n\n \n\n\n\n In Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings, pages 215-229, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"DynamicallyLink\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{DBLP:conf/sat/SamulowitzB07,\n  Title                    = {Dynamically Partitioning for Solving QBF},\n  Author                   = {Horst Samulowitz and\n Fahiem Bacchus},\n  Booktitle                = {Theory and Applications of Satisfiability Testing - SAT\n 2007, 10th International Conference, Lisbon, Portugal, May\n 28-31, 2007, Proceedings},\n  Year                     = {2007},\n  Pages                    = {215-229},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1007/978-3-540-72788-0_22},\n  Timestamp                = {2018.09.23}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC.\n \n \n \n \n\n\n \n Simmonds, J.; Davies, J.; Gurfinkel, A.; and Chechik, M.\n\n\n \n\n\n\n In FMCAD, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"ExploitingPaper\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{vaqtree07,\n  Title                    = {Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC},\n  Author                   = {J. Simmonds and J. Davies and A. Gurfinkel and M. Chechik},\n  Booktitle                = {FMCAD},\n  Year                     = {2007},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {davies_fmcad07.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Progression of Situation Calculus Action Theories with Incomplete Information.\n \n \n \n \n\n\n \n Vassos, S.; and Levesque, H.\n\n\n \n\n\n\n In Veloso, M. M., editor(s), Proceedings of the 20th International Joint Conference on Artificial Intelligence, pages 2024.2029, Hyderabad, India, January 2007. \n \n\n\n\n
\n\n\n\n \n \n \"ProgressionPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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 \n \n\n\n\n
\n
@InProceedings{vassos07progression,\n  Title                    = {Progression of Situation Calculus Action Theories with Incomplete\nInformation},\n  Author                   = {Vassos, Stavros and Levesque, Hector },\n  Booktitle                = {Proceedings of the 20th International Joint Conference on\nArtificial Intelligence},\n  Year                     = {2007},\n\n  Address                  = {Hyderabad, India},\n  Editor                   = {Veloso, Manuela M. },\n  Month                    = {January},\n  Pages                    = {2024.2029},\n\n  Abstract                 = { \nIn this paper, we propose a new progression mechanism for a\nrestricted form of incomplete knowledge formulated as a basic\naction theory in the situation calculus. Specifically, we focus\non functional fluents and deal directly with the possible values\nthese fluents may have and how these values are affected by both\nphysical and sensing actions. The method we propose is logically\ncomplete and can be calculated efficiently using database\ntechniques under certain reasonable assumptions. },\n  Area                     = {Cognitive Robotics},\n  Citeulike-article-id     = {1923630},\n  Keyword                  = {progression, reasoning about action, situation calculus, cognitive robotics},\n  Keywords                 = {ai, progression, reasoning_about_action, situation_calculus},\n  Timestamp                = {2018.09.23},\n  Url                      = {vassos-levesque07progression.pdf}\n}\n\n
\n
\n\n\n
\n In this paper, we propose a new progression mechanism for a restricted form of incomplete knowledge formulated as a basic action theory in the situation calculus. Specifically, we focus on functional fluents and deal directly with the possible values these fluents may have and how these values are affected by both physical and sensing actions. The method we propose is logically complete and can be calculated efficiently using database techniques under certain reasonable assumptions. \n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (26)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Planning with Temporally Extended Preferences by Heuristic Search.\n \n \n \n \n\n\n \n Baier, J.; Hussell, J.; Bacchus, F.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the ICAPS06 Workshop on Planning with Preferences, pages 7-10, Lake District, UK, June 2006. \n A version of this paper also appeared in the Fifth International Planning Competition (IPC-5) Booklet.\n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\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{bai-etal-ipc5+wkshp,\n  Title                    = {Planning with Temporally Extended Preferences by Heuristic Search},\n  Author                   = {Baier, J. and Hussell, J. and Bacchus, F. and McIlraith, S.},\n  Booktitle                = {Proceedings of the ICAPS06 Workshop on Planning with Preferences},\n  Year                     = {2006},\n\n  Address                  = {Lake District, UK},\n  Month                    = {June},\n  Note                     = {A version of this paper also appeared in the Fifth International Planning Competition (IPC-5) Booklet.},\n  Pages                    = {7-10},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bai-etal-ipc5_wkshp.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with First-Order Temporally Extended Goals Using Heuristic Search.\n \n \n \n \n\n\n \n Baier, J.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI06), pages 788-795, Boston, MA, July 2006. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 21 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{bai-mci-aaai06,\n  Title                    = {Planning with First-Order Temporally Extended Goals Using Heuristic Search},\n  Author                   = {Baier, J. and McIlraith, S.},\n  Booktitle                = {Proceedings of the 21st National Conference on Artificial Intelligence (AAAI06)},\n  Year                     = {2006},\n\n  Address                  = {Boston, MA},\n  Month                    = {July},\n  Pages                    = {788-795},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bai-mci-aaai06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with Temporally Extended Goals Using Heuristic Search.\n \n \n \n \n\n\n \n Baier, J.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS06), pages 342-345, Lake District, UK, June 2006. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 24 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{bai-mci-icaps06,\n  Title                    = {Planning with Temporally Extended Goals Using Heuristic Search},\n  Author                   = {Baier, J. and McIlraith, S.},\n  Booktitle                = {Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS06)},\n  Year                     = {2006},\n\n  Address                  = {Lake District, UK},\n  Month                    = {June},\n  Pages                    = {342-345},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bai-mci-icaps06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Planning with Programs that Sense.\n \n \n \n \n\n\n \n Baier, J.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR06), pages 492-502, Lake District, UK, June 2006. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{bai-mci-kr06,\n  Title                    = {On Planning with Programs that Sense},\n  Author                   = {Baier, J. and McIlraith, S.},\n  Booktitle                = {Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR06)},\n  Year                     = {2006},\n\n  Address                  = {Lake District, UK},\n  Month                    = {June},\n  Pages                    = {492-502},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bai-mci-kr06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with Qualitative Temporal Preferences.\n \n \n \n \n\n\n \n Bienvenu, M.; Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 134-144, Lake District, UK, June 2–5 2006. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{KR06BienvenuM.pdf_200603101347,\n  Title                    = {Planning with Qualitative Temporal Preferences},\n  Author                   = {Meghyn Bienvenu and Christian Fritz and Sheila A. McIlraith},\n  Booktitle                = {Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR)},\n  Year                     = {2006},\n\n  Address                  = {Lake District, UK},\n  Month                    = {June 2--5},\n  Pages                    = {134-144},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {200603101347_KR06BienvenuM.pdf.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Planning System Based on Markov Decision Processes to Guide People with Dementia Through Activities of Daily Living.\n \n \n \n \n\n\n \n Boger, J.; Poupart, P.; Hoey, J.; Boutilier, C.; Fernie, G.; and Mihailidis, A.\n\n\n \n\n\n\n IEEE Transactions on Information Technology in Biomedicine, 10(2): 323–333. 2006.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\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
@Article{Boger-etal:ITB06,\n  Title                    = {A Planning System Based on Markov Decision Processes to Guide \n People with Dementia Through Activities of Daily Living},\n  Author                   = {Jennifer Boger and Pascal Poupart and Jesse Hoey and\n Craig Boutilier and Geoff Fernie and Alex Mihailidis},\n  Journal                  = {{IEEE} Transactions on Information Technology in Biomedicine},\n  Year                     = {2006},\n  Number                   = {2},\n  Pages                    = {323--333},\n  Volume                   = {10},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {CoachIEEE.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Constraint-based Optimization and Utility Elicitation using the Minimax Decision Criterion.\n \n \n \n \n\n\n \n Boutilier, C.; Patrascu, R.; Poupart, P.; and Schuurmans, D.\n\n\n \n\n\n\n Artifical Intelligence, 170(8–9): 686–713. 2006.\n \n\n\n\n
\n\n\n\n \n \n \"Constraint-basedPaper\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
@Article{BPPS:AIJ06,\n  Title                    = { Constraint-based Optimization and Utility Elicitation using\n the Minimax Decision Criterion},\n  Author                   = {Craig Boutilier and Relu Patrascu and Pascal Poupart and\n Dale Schuurmans},\n  Journal                  = {Artifical Intelligence},\n  Year                     = {2006},\n  Number                   = {8--9},\n  Pages                    = {686--713},\n  Volume                   = {170},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {BPPS-aij06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preference Elicitation and Generalized Additive Utility (Nectar paper).\n \n \n \n \n\n\n \n Braziunas, D.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-06), Boston, MA, 2006. \n \n\n\n\n
\n\n\n\n \n \n \"PreferencePaper\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{BraziunasBoutilier-AAAI06,\n  Title                    = {Preference Elicitation and Generalized Additive Utility (Nectar paper)},\n  Author                   = {Darius Braziunas and Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-First National Conference on\n Artificial Intelligence (AAAI-06)},\n  Year                     = {2006},\n\n  Address                  = {Boston, MA},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {BraziunasBoutilier-AAAI06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decision-Theoretic GOLOG with Qualitative Preferences.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR06), pages 153-163, Lake District, UK, June 2006. \n \n\n\n\n
\n\n\n\n \n \n \"Decision-TheoreticPaper\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{200603061828_KR0603FritzC.pdf_200604231150,\n  Title                    = {Decision-Theoretic GOLOG with Qualitative Preferences},\n  Author                   = {Fritz, C. and McIlraith, S.},\n  Booktitle                = {Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR06)},\n  Year                     = {2006},\n\n  Address                  = {Lake District, UK},\n  Month                    = {June},\n  Pages                    = {153-163},\n\n  Keywords                 = {Golog},\n  Timestamp                = {2018.09.23},\n  Url                      = {200603061828_KR0603FritzC.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Model Checking Meets Theorem Proving: a Situation Calculus Based Approach .\n \n \n \n \n\n\n \n Gu, Y.; and Kiringa, I.\n\n\n \n\n\n\n In Proceedings of the 11th International Workshop on Nonmonotonic Reasoning (NMR-06) at KR2006, Lake District of the UK, June 2006. \n \n\n\n\n
\n\n\n\n \n \n \"ModelPaper\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{GuKiringaNMR06,\n  Title                    = {Model Checking Meets Theorem Proving: a Situation Calculus Based Approach },\n  Author                   = {Yilan Gu and Iluju Kiringa},\n  Booktitle                = {Proceedings of the 11th International Workshop on Nonmonotonic Reasoning (NMR-06) at KR2006},\n  Year                     = {2006},\n\n  Address                  = {Lake District of the UK},\n  Month                    = {June},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {YGu_nmr06_modelChecking.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Logic for Decidable Reasoning about Services.\n \n \n \n \n\n\n \n Gu, Y.; and Soutchanski, M.\n\n\n \n\n\n\n In Proceedings of AAAI-06 workshop on AI-Driven Technologies for Services-Oriented Computing (AISOC-06), Boston, MA, US, July 2006. \n Also in the Proceedings of ECAI-06 workshop on AI for Service Composition, August 2006, Riva del Garda, Italy\n\n\n\n
\n\n\n\n \n \n \"APaper\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{GuSouAISOC06services,\n  Title                    = {A Logic for Decidable Reasoning about Services},\n  Author                   = {Yilan Gu and Mikhail Soutchanski},\n  Booktitle                = {Proceedings of AAAI-06 workshop on AI-Driven Technologies for Services-Oriented Computing (AISOC-06)},\n  Year                     = {2006},\n\n  Address                  = {Boston, MA, US},\n  Month                    = {July},\n  Note                     = {Also in the Proceedings of ECAI-06 workshop on AI for Service Composition, August 2006, Riva del Garda, Italy},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {YGu_aaai06_service.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Two-variable Situation Calculus.\n \n \n \n \n\n\n \n Gu, Y.; and Soutchanski, M.\n\n\n \n\n\n\n In Proceedings of the third European Starting AI Researcher Symposium (STAIRS-06) at ECAI06, Riva del Garda, Italy, August 2006. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{GuSouSTAIRS06,\n  Title                    = {The Two-variable Situation Calculus},\n  Author                   = {Yilan Gu and Mikhail Soutchanski},\n  Booktitle                = {Proceedings of the third European Starting AI Researcher Symposium (STAIRS-06) at ECAI06},\n  Year                     = {2006},\n\n  Address                  = {Riva del Garda, Italy},\n  Month                    = {August},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {YGu_stairs06_2vSC.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Characterizing Propagation Methods for Boolean Satisfiability.\n \n \n \n \n\n\n \n Hsu, E.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of The Ninth International Conference on Theory and Applications of Satisfiability Testing (SAT'06), pages 325-338, 2006. \n \n\n\n\n
\n\n\n\n \n \n \"CharacterizingPaper\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{hsu-mci-sat06,\n  Title                    = {Characterizing Propagation Methods for Boolean Satisfiability},\n  Author                   = {Hsu, E. and McIlraith, S.},\n  Booktitle                = {Proceedings of The Ninth International Conference on Theory and Applications of Satisfiability Testing (SAT'06)},\n  Year                     = {2006},\n  Pages                    = {325-338},\n\n  Optaddress               = {Seattle, Washington, USA},\n  Optmonth                 = {August 12 - 15},\n  Timestamp                = {2018.09.23},\n  Url                      = {hsu-mci-sat06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Who's Asking For Help? A Bayesian Approach to Intelligent Assistance.\n \n \n \n \n\n\n \n Hui, B.; and Boutilier, C.\n\n\n \n\n\n\n In International Conference on Intelligent User Interfaces (IUI-06) , pages 186–193, Sydney, 2006. \n \n\n\n\n
\n\n\n\n \n \n \"Who'sPaper\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{HuiBoutilier:iui06,\n  Title                    = {Who's Asking For Help? A Bayesian Approach to\n Intelligent Assistance},\n  Author                   = {Bowen Hui and Craig Boutilier},\n  Booktitle                = {International Conference on Intelligent User Interfaces\n (IUI-06) },\n  Year                     = {2006},\n\n  Address                  = {Sydney},\n  Pages                    = {186--193},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {Hui_Boutilier_IUI06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Regret-based Incremental Partial Revelation Mechanisms.\n \n \n \n \n\n\n \n Hyafil, N.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Second National Conference on Artificial Intelligence (AAAI 2006), 2006. \n \n\n\n\n
\n\n\n\n \n \n \"Regret-basedPaper\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{hyafilboutilier-aaai06,\n  Title                    = {Regret-based Incremental Partial Revelation Mechanisms},\n  Author                   = {Nathanael Hyafil and Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-Second National Conference on\n Artificial Intelligence (AAAI 2006)},\n  Year                     = {2006},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {HyafilBoutilier-AAAI06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bringing Semantics to Web Services with OWL-S.\n \n \n \n \n\n\n \n Martin, D.; Burstein, M.; McDermott, D.; McIlraith, S.; Paolucci, M.; Sycara, K.; McGuinness, D.; Sirin, E.; and Srinivasan, N.\n\n\n \n\n\n\n World Wide Web Journal. 2006.\n To appear.\n\n\n\n
\n\n\n\n \n \n \"BringingPaper\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{mar+wwwj06,\n  Title                    = {Bringing Semantics to Web Services with OWL-S},\n  Author                   = {Martin, D. and Burstein, M. and McDermott, D. and McIlraith, S. and\nPaolucci, M. and Sycara, K. and McGuinness, D. and Sirin, E. and Srinivasan, N.},\n  Journal                  = {World Wide Web Journal},\n  Year                     = {2006},\n  Note                     = {To appear.},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {mar-wwwj06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n QBF Solver 2clsQ.\n \n \n \n \n\n\n \n Samulowitz, H.; and Bacchus, F.\n\n\n \n\n\n\n 2006.\n available at http://www.cs.toronto.edu/̃fbacchus/sat.html\n\n\n\n
\n\n\n\n \n \n \"QBFPaper\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
@Misc{2clsQ,\n  Title                    = {{QBF Solver 2clsQ}},\n\n  Author                   = {H. Samulowitz and F. Bacchus},\n  Note                     = {available at http://www.cs.toronto.edu/\\~{}fbacchus/sat.html},\n  Year                     = {2006},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {2clsQ.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Binary Clause Reasoning in QBF.\n \n \n \n \n\n\n \n Samulowitz, H.; and Bacchus, F.\n\n\n \n\n\n\n In Ninth International Conference on Theory and Applications of Satisfiability Testing (SAT 2006), Lecture Notes in Computer Science 2919, 2006. \n \n\n\n\n
\n\n\n\n \n \n \"BinaryPaper\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{SBSAT2006,\n  Title                    = {Binary Clause Reasoning in QBF},\n  Author                   = {H. Samulowitz and F. Bacchus},\n  Booktitle                = {Ninth International Conference on Theory and Applications of Satisfiability Testing (SAT 2006), Lecture Notes in Computer Science 2919},\n  Year                     = {2006},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {SBSAT2006.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n QBF Solver SQBF.\n \n \n \n \n\n\n \n Samulowitz, H.; and Bacchus, F.\n\n\n \n\n\n\n 2006.\n available at http://www.cs.toronto.edu/̃fbacchus/sat.html\n\n\n\n
\n\n\n\n \n \n \"QBFPaper\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
@Misc{SQBF,\n  Title                    = {{QBF Solver SQBF}},\n\n  Author                   = {H. Samulowitz and F. Bacchus},\n  Note                     = {available at http://www.cs.toronto.edu/\\~{}fbacchus/sat.html},\n  Year                     = {2006},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {SQBF.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preprocessing QBF.\n \n \n \n \n\n\n \n Samulowitz, H.; Davies, J.; and Bacchus, F.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming, 2006. Springer\n \n\n\n\n
\n\n\n\n \n \n \"PreprocessingPaper\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{preQ06,\n  Title                    = {Preprocessing {QBF}},\n  Author                   = {H. Samulowitz and J. Davies and F. Bacchus},\n  Booktitle                = {Principles and Practice of Constraint Programming},\n  Year                     = {2006},\n  Publisher                = Springer,\n\n  Timestamp                = {2018.09.23},\n  Url                      = {SBCP2006.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n QBF Preprocessor Prequel.\n \n \n \n \n\n\n \n Samulowitz, H.; Davies, J.; and Bacchus, F.\n\n\n \n\n\n\n 2006.\n available at http://www.cs.toronto.edu/̃fbacchus/sat.html\n\n\n\n
\n\n\n\n \n \n \"QBFPaper\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
@Misc{Prequel,\n  Title                    = {{QBF Preprocessor Prequel}},\n\n  Author                   = {H. Samulowitz and J. Davies and F. Bacchus},\n  Note                     = {available at http://www.cs.toronto.edu/\\~{}fbacchus/sat.html},\n  Year                     = {2006},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {prequel.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preference Elicitation in Combinatorial Auctions.\n \n \n \n \n\n\n \n Sandholm, T.; and Boutilier, C.\n\n\n \n\n\n\n In Crampton, P.; Shoham, Y.; and Steinberg, R., editor(s), Combinatorial Auctions, pages 233–264. MIT Press, Cambridge, MA, 2006.\n \n\n\n\n
\n\n\n\n \n \n \"PreferencePaper\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
@InCollection{SandholmBoutilier:CA06,\n  Title                    = {Preference Elicitation in Combinatorial Auctions},\n  Author                   = {Tuomas Sandholm and Craig Boutilier },\n  Booktitle                = {Combinatorial Auctions},\n  Publisher                = {{MIT} Press},\n  Year                     = {2006},\n\n  Address                  = {Cambridge, MA},\n  Editor                   = {P. Crampton and Y. Shoham and R. Steinberg},\n  Pages                    = {233--264},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {elicitation.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Practical Linear Value-approximation Techniques for First-order MDPs.\n \n \n \n \n\n\n \n Sanner, S.; and Boutilier, C.\n\n\n \n\n\n\n In uai06, Cambridge, MA, 2006. \n to appear\n\n\n\n
\n\n\n\n \n \n \"PracticalPaper\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{SannerBoutilier:uai06,\n  Title                    = {Practical Linear Value-approximation Techniques \n for First-order MDPs},\n  Author                   = {Scott Sanner and Craig Boutilier},\n  Booktitle                = uai06,\n  Year                     = {2006},\n\n  Address                  = {Cambridge, MA},\n  Note                     = {to appear},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {foapi-uai06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Ordered theory resolution calculus for hybrid reasoning in first-order extensions of description logic.\n \n \n \n \n\n\n \n Sanner, S.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR06), pages 100-111, Lake District, UK, June 2006. \n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{san-mci-kr06,\n  Title                    = {An Ordered theory resolution calculus for hybrid reasoning in first-order extensions of description logic},\n  Author                   = {Sanner, S. and McIlraith, S.},\n  Booktitle                = {Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR06)},\n  Year                     = {2006},\n\n  Address                  = {Lake District, UK},\n  Month                    = {June},\n  Pages                    = {100-111},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {san-mci-kr06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Limits of Planning over Belief States Under Strict Uncertainty.\n \n \n \n \n\n\n \n Sardina, S.; De Giacomo, G.; Lespérance, Y.; and Levesque, H.\n\n\n \n\n\n\n In KR, pages 463–471, Lake District, UK, June 2006. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{SDLL-KR06,\n  Title                    = {On the Limits of Planning over Belief States Under Strict Uncertainty},\n  Author                   = {Sardina, Sebastian and De Giacomo, Giuseppe and\n Lesp\\'erance, Yves and Levesque, Hector},\n  Booktitle                = KR,\n  Year                     = {2006},\n\n  Address                  = {Lake District, UK},\n  Month                    = Jun,\n  Pages                    = {463--471},\n\n  Areas                    = {Cognitive Robotics},\n  File                     = {KR0603SardinaS.pdf:papers/KR0603SardinaS.pdf:PDF},\n  Timestamp                = {2018.09.23},\n  Url                      = {KR0603SardinaS.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Web Service Composition Via Generic Procedures and Customizing User Preferences.\n \n \n \n \n\n\n \n Sohrabi, S.; Prokoshyna, N.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the 5th International Semantic Web Conference (ISWC06), pages 597-611, Athens, GA, USA, November 2006. \n \n\n\n\n
\n\n\n\n \n \n \"WebPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{sohProMcI,\n  Title                    = {Web Service Composition Via Generic Procedures and Customizing User Preferences},\n  Author                   = {Shirin Sohrabi and\n Natasha Prokoshyna and\n Sheila. A. McIlraith},\n  Booktitle                = {Proceedings of the 5th International Semantic Web Conference (ISWC06)},\n  Year                     = {2006},\n\n  Address                  = {Athens, GA, USA},\n  Month                    = {November},\n  Pages                    = {597-611},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {1225923302_soh-pro-mci-iswc06.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (16)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Partition-Based Logical Reasoning for First-Order and Propositional Theories.\n \n \n \n \n\n\n \n Amir, E.; and McIlraith, S.\n\n\n \n\n\n\n Artificial Intelligence, 162(1-2): 49–88. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"Partition-BasedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{ami-mci-aij01,\n  Title                    = {Partition-Based Logical Reasoning for First-Order and Propositional Theories},\n  Author                   = {Amir, E. and McIlraith, S.},\n  Journal                  = {Artificial Intelligence},\n  Year                     = {2005},\n  Number                   = {1-2},\n  Pages                    = {49--88},\n  Volume                   = {162},\n\n  Address                  = {Essex, UK},\n  ISSN                     = {0004-3702},\n  Publisher                = {Elsevier Science Publishers Ltd.},\n  Timestamp                = {2018.09.23},\n  Url                      = {ami-mci-aij01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with Programs that Sense.\n \n \n \n \n\n\n \n Baier, J.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 6th International Workshop on Nonmonotonic Reasoning, Action and Change (NRAC-05), pages 7-14, 2005. \n An expanded version of this work appeared in KR-06.\n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\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{bai-mci-nrac05,\n  Title                    = {Planning with Programs that Sense},\n  Author                   = {Baier, J. and McIlraith, S.},\n  Booktitle                = {Proceedings of the 6th International Workshop on\nNonmonotonic Reasoning, Action and Change (NRAC-05)},\n  Year                     = {2005},\n  Note                     = {An expanded version of this work appeared in KR-06.},\n  Pages                    = {7-14},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bai-mci-nrac05.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Specifying and Generating Preferred Plans.\n \n \n \n \n\n\n \n Bienvenu, M.; and McIlraith, S.\n\n\n \n\n\n\n In Seventh International Symposium on Logical Formalizations of Commonsense Reasoning, pages 25-31, Corfu, Greece, May 22-24 2005. \n \n\n\n\n
\n\n\n\n \n \n \"SpecifyingPaper\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{bie-mci-cs05,\n  Title                    = {Specifying and Generating Preferred Plans},\n  Author                   = {Bienvenu, M. and McIlraith, S.},\n  Booktitle                = {Seventh International Symposium on Logical Formalizations \n of Commonsense Reasoning},\n  Year                     = {2005},\n\n  Address                  = {Corfu, Greece},\n  Month                    = {May 22-24},\n  Pages                    = {25-31},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bie-mci-cs05.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Decision-Theoretic Approach to Task Assistance for Persons with Dementia.\n \n \n \n \n\n\n \n Boger, J.; Poupart, P.; Hoey, J.; Boutilier, C.; Fernie, G.; and Mihailidis, A.\n\n\n \n\n\n\n In ijcai05, pages 1293–1299, Edinburgh, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{BPHBFH:ijcai05,\n  Title                    = {A Decision-Theoretic Approach to Task Assistance for Persons\n with Dementia},\n  Author                   = {Jennifer Boger and Pascal Poupart and Jesse Hoey and\n Craig Boutilier and Geoff Fernie and Alex Mihailidis},\n  Booktitle                = ijcai05,\n  Year                     = {2005},\n\n  Address                  = {Edinburgh},\n  Pages                    = {1293--1299},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {CoachIJCAI.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Influence of Influence Diagrams.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n Decision Analysis, 2(4): 229–231. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{Boutilier:DA05,\n  Title                    = {The Influence of Influence Diagrams},\n  Author                   = {Craig Boutilier},\n  Journal                  = {Decision Analysis},\n  Year                     = {2005},\n  Number                   = {4},\n  Pages                    = {229--231},\n  Volume                   = {2},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {Boutilier_HowardMathesonComment.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Regret-based Utility Elicitation in Constraint-based Decision Problems.\n \n \n \n \n\n\n \n Boutilier, C.; Patrascu, R.; Poupart, P.; and Schuurmans, D.\n\n\n \n\n\n\n In ijcai05, pages 929–934, Edinburgh, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"Regret-basedPaper\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{BPPS:ijcai05,\n  Title                    = {Regret-based Utility Elicitation in\n Constraint-based Decision Problems},\n  Author                   = {Craig Boutilier and Relu Patrascu and Pascal Poupart and\n Dale Schuurmans},\n  Booktitle                = ijcai05,\n  Year                     = {2005},\n\n  Address                  = {Edinburgh},\n  Pages                    = {929--934},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {elicConstraintsIJCAI05.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Local Utility Elicitation in GAI Models.\n \n \n \n \n\n\n \n Braziunas, D.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-first Conference on Uncertainty in Artificial Intelligence, pages 42–49, Edinburgh, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"LocalPaper\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{BraziunasBoutilier-UAI05,\n  Title                    = {Local Utility Elicitation in {GAI} Models},\n  Author                   = {Darius Braziunas and Craig Boutilier},\n  Booktitle                = {Proceedings of the Twenty-first Conference on\n Uncertainty in Artificial Intelligence},\n  Year                     = {2005},\n\n  Address                  = {Edinburgh},\n  Pages                    = {42--49},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {BraziunasBoutilier-UAI05.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards a Practical Theory of Reformulation for Reasoning about Physical Systems.\n \n \n \n \n\n\n \n Choueiry, B.; Iwasaki, Y.; and McIlraith, S.\n\n\n \n\n\n\n Artificial Intelligence, 162(1-2): 145-204. February 2005.\n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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{cho-iwa-mci-aij05,\n  Title                    = {Towards a Practical Theory of Reformulation for Reasoning\n about Physical Systems},\n  Author                   = {Choueiry, B. and Iwasaki, Y. and McIlraith, S.},\n  Journal                  = {Artificial Intelligence},\n  Year                     = {2005},\n\n  Month                    = {February},\n  Number                   = {1-2},\n  Pages                    = {145-204},\n  Volume                   = {162},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {cho-iwa-mci-aij05.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Compiling Qualitative Preferences into Decision-Theoretic GOLOG.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 6th International Workshop on Nonmonotonic Reasoning, Action and Change (NRAC-05), pages 45-52, 2005. \n An expanded version of this work appeared at KR-06.\n\n\n\n
\n\n\n\n \n \n \"CompilingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{fri-mci-nrac05,\n  Title                    = {Compiling Qualitative Preferences into Decision-Theoretic GOLOG},\n  Author                   = {Fritz, C. and McIlraith, S.},\n  Booktitle                = {Proceedings of the 6th International Workshop on\n Nonmonotonic Reasoning, Action and Change (NRAC-05)},\n  Year                     = {2005},\n  Note                     = {An expanded version of this work appeared at KR-06.},\n  Pages                    = {45-52},\n\n  Keywords                 = {Golog},\n  Timestamp                = {2018.09.23},\n  Url                      = {fri-mci-nrac05.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computational Mechanism Design – Depth report.\n \n \n \n \n\n\n \n Hyafil, N.\n\n\n \n\n\n\n Technical Report University of Toronto, 2005.\n \n\n\n\n
\n\n\n\n \n \n \"ComputationalPaper\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
@TechReport{hyafil-depth,\n  Title                    = {Computational Mechanism Design -- Depth report},\n  Author                   = {Nathanael Hyafil},\n  Institution              = {University of Toronto},\n  Year                     = {2005},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {Hyafil-Depth.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with Loops.\n \n \n \n \n\n\n \n Levesque, H.\n\n\n \n\n\n\n In Proceedings of IJCAI-05, Edinburgh, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{hector-ijcai05,\n  Title                    = {Planning with Loops},\n  Author                   = {Levesque, Hector},\n  Booktitle                = {Proceedings of IJCAI-05},\n  Year                     = {2005},\n\n  Address                  = {Edinburgh},\n\n  Areas                    = {Cognitive Robotics},\n  File                     = {planner.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/planner.pdf:PDF},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {planner.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n New Approaches to Optimization and Utility Elicitation in Autonomic Computing.\n \n \n \n \n\n\n \n Patrascu, R.; Boutilier, C.; Das, R.; hart , J. O. K.; Tesauro, G.; and Walsh, W. E.\n\n\n \n\n\n\n In aaai05, pages 140–145, Pittsburgh, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"NewPaper\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{PBDKTW:aaai05,\n  Title                    = {New Approaches to Optimization and Utility Elicitation \n in Autonomic Computing},\n  Author                   = {Relu Patrascu and Craig Boutilier and Rajarshi Das and Jeffrey O. Kep\nhart\n and Gerald Tesauro and William E. Walsh},\n  Booktitle                = aaai05,\n  Year                     = {2005},\n\n  Address                  = {Pittsburgh},\n  Pages                    = {140--145},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {autonomicCG-elic.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using SAT in QBF.\n \n \n \n \n\n\n \n Samulowitz, H.; and Bacchus, F.\n\n\n \n\n\n\n In Principles and Practice of Constraint Programming, 2005. Springer\n \n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{sqbf05,\n  Title                    = {Using {SAT} in {QBF}},\n  Author                   = {H. Samulowitz and F. Bacchus},\n  Booktitle                = {Principles and Practice of Constraint Programming},\n  Year                     = {2005},\n  Publisher                = Springer,\n\n  Timestamp                = {2018.09.23},\n  Url                      = {cp2005.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automated Design of Multistage Mechanisms.\n \n \n \n \n\n\n \n Sandholm, T.; Conitzer, V.; and Boutilier, C.\n\n\n \n\n\n\n In First International Workshop on Incentive Based Computing, pages 2–12, Compiegne, France, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"AutomatedPaper\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{SCB:multistageAMD,\n  Title                    = {Automated Design of Multistage Mechanisms},\n  Author                   = {Tuomas Sandholm and Vincent Conitzer and Craig Boutilier},\n  Booktitle                = {First International Workshop on Incentive Based Computing},\n  Year                     = {2005},\n\n  Address                  = {Compiegne, France},\n  Pages                    = {2--12},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {multistageamdIBC05.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Approximate Linear Programming for First-order MDPs.\n \n \n \n \n\n\n \n Sanner, S.; and Boutilier, C.\n\n\n \n\n\n\n In uai05, pages 509–517, Edinburgh, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"ApproximatePaper\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{SannerBoutilier:uai05,\n  Title                    = {Approximate Linear Programming for First-order {MDP}s},\n  Author                   = {Scott Sanner and Craig Boutilier},\n  Booktitle                = uai05,\n  Year                     = {2005},\n\n  Address                  = {Edinburgh},\n  Pages                    = {509--517},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {foalp-uai05.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Wumpus World in IndiGolog: A preliminary report.\n \n \n \n \n\n\n \n Sardina, S.; and Vassos, S.\n\n\n \n\n\n\n In Morgenstern, L.; and Pagnucco, M., editor(s), Proceedings of the Workshop on Non-monotonic Reasoning, Action and Change at IJCAI (NRAC-05), pages 90–95, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{SardinaVassos-NRAC05,\n  Title                    = {The {W}umpus {W}orld in {I}ndi{G}olog: {A} preliminary report},\n  Author                   = {Sardina, Sebastian and Vassos, Stavros},\n  Booktitle                = {Proceedings of the Workshop on Non-monotonic\n Reasoning, Action and Change at IJCAI (NRAC-05)},\n  Year                     = {2005},\n  Editor                   = {Morgenstern, L. and Pagnucco, M.},\n  Pages                    = {90--95},\n\n  File                     = {nrac05SV.pdf:papers/nrac05SV.pdf:PDF},\n  Timestamp                = {2018.09.23},\n  Url                      = {nrac05SV.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (14)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Preference-based Constrained Optimization with CP-nets.\n \n \n \n \n\n\n \n Boutilier, C.; Brafman, R.; Domshlak, C.; Hoos, H.; and Poole, D.\n\n\n \n\n\n\n Computational Intelligence, 19(9): 137–157. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Preference-basedPaper\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{BBDHP:CI04,\n  Title                    = {Preference-based Constrained Optimization with CP-nets},\n  Author                   = {Craig Boutilier and Ronen Brafman and Carmel Domshlak\n and Holger Hoos and David Poole},\n  Journal                  = {Computational Intelligence},\n  Year                     = {2004},\n  Number                   = {9},\n  Pages                    = {137--157},\n  Volume                   = {19},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {cp-constraints.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n CP-networks: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements.\n \n \n \n \n\n\n \n Boutilier, C.; Brafman, R.; Domshlak, C.; Hoos, H.; and Poole, D.\n\n\n \n\n\n\n Journal of Artificial Intelligence Research, 21: 135–191. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"CP-networks: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{BBDHP:JAIR04,\n  Title                    = {CP-networks: A Tool for Representing and Reasoning with Conditional\n Ceteris Paribus Preference Statements},\n  Author                   = {Craig Boutilier and Ronen Brafman and Carmel Domshlak\n and Holger Hoos and David Poole},\n  Journal                  = {Journal of Artificial Intelligence Research},\n  Year                     = {2004},\n  Pages                    = {135--191},\n  Volume                   = {21},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {BoBrDoHoPoJAIR03-abs.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions.\n \n \n \n \n\n\n \n Boutilier, C.; Sandholm, T.; and Shields, R.\n\n\n \n\n\n\n In aaai04, pages 204–211, San Jose, CA, 2004. \n \n\n\n\n
\n\n\n\n \n \n \"ElicitingPaper\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{BSS:aaai04,\n  Title                    = {Eliciting Bid Taker Non-price Preferences in\n (Combinatorial) Auctions},\n  Author                   = {Craig Boutilier and Tuomas Sandholm and Rob Shields},\n  Booktitle                = aaai04,\n  Year                     = {2004},\n\n  Address                  = {San Jose, CA},\n  Pages                    = {204--211},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {scenarioNvgtn.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Stochastic Local Search for POMDP Controllers.\n \n \n \n \n\n\n \n Braziunas, D.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Nineteenth National Conference on Artificial Intelligence, pages 690–696, San Jose, CA, 2004. \n \n\n\n\n
\n\n\n\n \n \n \"StochasticPaper\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{BraziunasBoutilier-AAAI04,\n  Title                    = {Stochastic Local Search for {POMDP} Controllers},\n  Author                   = {Darius Braziunas and Craig Boutilier},\n  Booktitle                = {Proceedings of the Nineteenth National Conference on\n Artificial Intelligence},\n  Year                     = {2004},\n\n  Address                  = {San Jose, CA},\n  Pages                    = {690--696},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {BraziunasBoutilier-AAAI04.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bayesian Reinforcement Learning for Coalition Formation Under Uncertainty.\n \n \n \n \n\n\n \n Chalkiadakis, G.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-04), pages 1090–1097, New York, 2004. \n \n\n\n\n
\n\n\n\n \n \n \"BayesianPaper\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{chalkiadakis:aamas04,\n  Title                    = {Bayesian Reinforcement Learning for Coalition Formation \n Under Uncertainty},\n  Author                   = {Georgios Chalkiadakis and Craig Boutilier},\n  Booktitle                = {Proceedings of the Third International Joint\n Conference on Autonomous Agents and Multiagent Systems (AAMAS-04)},\n  Year                     = {2004},\n\n  Address                  = {New York},\n  Pages                    = {1090--1097},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bayesianCoalForm.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Utilizing Structured Representations and CSPs in Conformant Probabilistic Planning.\n \n \n \n \n\n\n \n Hyafil, N.; and Bacchus, F.\n\n\n \n\n\n\n In European Conference on Artificial Intelligence (ECAI 2004), 2004. \n \n\n\n\n
\n\n\n\n \n \n \"UtilizingPaper\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{hyafilbacchus-ecai04,\n  Title                    = {Utilizing Structured Representations and CSPs in Conformant \nProbabilistic Planning},\n  Author                   = {Nathanael Hyafil and Fahiem Bacchus},\n  Booktitle                = {European Conference on Artificial Intelligence\n(ECAI 2004)},\n  Year                     = {2004},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {HyafilBacchus-ECAI04.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty.\n \n \n \n \n\n\n \n Hyafil, N.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI 2004), Banff, Alberta, Canada, 2004. \n \n\n\n\n
\n\n\n\n \n \n \"RegretPaper\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{hyafilboutilier-uai04,\n  Title                    = {{Regret Minimizing Equilibria and Mechanisms for Games with \n Strict Type Uncertainty}},\n  Author                   = {Nathanael Hyafil and Craig Boutilier},\n  Booktitle                = {Proceedings of the Twentieth Conference on\n Uncertainty in Artificial Intelligence (UAI 2004)},\n  Year                     = {2004},\n\n  Address                  = {Banff, Alberta, Canada},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {HyafilBoutilier-UAI04.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Study of Limited-Precision, Incremental Elicitation in Auctions.\n \n \n \n \n\n\n \n Kress, A.; and Boutilier, C.\n\n\n \n\n\n\n 2004.\n Working paper (see also AAMAS-04, pp.1344–1345)\n\n\n\n
\n\n\n\n \n \n \"APaper\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
@Unpublished{kress:msc,\n  Title                    = {A Study of Limited-Precision, Incremental Elicitation in Auctions},\n  Author                   = {Alexander Kress and Craig Boutilier},\n  Note                     = {Working paper (see also AAMAS-04, pp.1344--1345)},\n  Year                     = {2004},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {limPrecBid-draft.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Logic of Limited Belief for Reasoning with Disjunctive Information.\n \n \n \n \n\n\n \n Liu, Y.; Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n In Proc. KR-04, pages 587–597, Whistler, Canada, June 2004. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{LLL04,\n  Title                    = {A Logic of Limited Belief for Reasoning with\n Disjunctive Information},\n  Author                   = {Yongmei Liu and Gerhard Lakemeyer and Hector J.\n Levesque},\n  Booktitle                = {Proc. KR-04},\n  Year                     = {2004},\n\n  Address                  = {Whistler, Canada},\n  Month                    = {June},\n  Pages                    = {587--597},\n\n  File                     = {lll-kr2004.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/lll-kr2004.pdf:PDF},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {lll-kr2004.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bringing Semantics to Web Services: The OWL-S Approach.\n \n \n \n \n\n\n \n Martin, D.; Paolucci, M.; McIlraith, S.; Burstein, M.; McDermott, D.; McGuinness, D.; Parsia, B.; Payne, T.; Sabou, M.; Solanki, M.; Srinivasan, N.; and Sycara, K.\n\n\n \n\n\n\n In First International Workshop on Semantic Web Services and Web Process Composition (SWSWPC 2004), pages 26-42, San Diego, CA, USA, July 6-9 2004. \n Revised Selected Papers\n\n\n\n
\n\n\n\n \n \n \"BringingPaper\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{owls-swswpc04,\n  Title                    = {Bringing Semantics to Web Services: The OWL-S Approach},\n  Author                   = {Martin, D. and Paolucci, M. and McIlraith, S. and Burstein, M. and \n McDermott, D. and McGuinness, D. and Parsia, B. and Payne, T. and Sabou, \n M. and Solanki, M. and Srinivasan, N. and Sycara, K.},\n  Booktitle                = {First International Workshop on Semantic Web Services and \n Web Process Composition (SWSWPC 2004)},\n  Year                     = {2004},\n\n  Address                  = {San Diego, CA, USA},\n  Month                    = {July 6-9},\n  Note                     = {Revised Selected Papers},\n  Pages                    = {26-42},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {owls-swswpc04.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n VDCBPI: an Approximate Scalable Algorithm for Large Scale POMDPs.\n \n \n \n \n\n\n \n Poupart, P.; and Boutilier, C.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 17 (NIPS-2004), pages 1081–1088, Vancouver, 2004. \n \n\n\n\n
\n\n\n\n \n \n \"VDCBPI: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{PoupartBoutilier:nips04,\n  Title                    = {{VDCBPI}: an Approximate Scalable Algorithm for Large Scale POMDPs},\n  Author                   = {Pascal Poupart and Craig Boutilier},\n  Booktitle                = {Advances in Neural Information Processing Systems 17 (NIPS-2004)},\n  Year                     = {2004},\n\n  Address                  = {Vancouver},\n  Pages                    = {1081--1088},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {vdcbpi.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Ability to Autonomously Execute Agent Programs with Sensing.\n \n \n \n \n\n\n \n Sardina, S.; De Giacomo, G.; Lespérance, Y.; and Levesque, H.\n\n\n \n\n\n\n In Proceedings of the 4th International Workshop on Cognitive Robotics (CoRobo-04), Valencia, Spain, 2004. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{SDLL-COGROBO04,\n  Title                    = {On Ability to Autonomously Execute Agent Programs with\n Sensing},\n  Author                   = {Sardina, Sebastian and De Giacomo, Giuseppe and\n Lesp\\'erance, Yves and Levesque, Hector},\n  Booktitle                = {Proceedings of the 4th International Workshop on\n Cognitive Robotics (CoRobo-04)},\n  Year                     = {2004},\n\n  Address                  = {Valencia, Spain},\n\n  File                     = {sgll-cogrobo04.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/sgll-cogrobo04.pdf:PDF},\n  Key                      = {CogRobo},\n  Optmonth                 = {July},\n  Optpages                 = {88--93},\n  Timestamp                = {2018.09.23},\n  Url                      = {sgll-cogrobo04.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Semantics of Deliberation in IndiGolog – From Theory to Implementation.\n \n \n \n \n\n\n \n Sardina, S.; De Giacomo, G.; Lespérance, Y.; and Levesque, H.\n\n\n \n\n\n\n Annals of Mathematics and Artificial Intelligence, 41(2–4): 259–299. August 2004.\n Previous version appeared in Proc. of KR-2002\n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{SGLL04,\n  Title                    = {On the Semantics of Deliberation in {I}ndi{G}olog --\n From Theory to Implementation},\n  Author                   = {Sardina, Sebastian and De Giacomo, Giuseppe and\n Lesp\\'erance, Yves and Levesque, Hector},\n  Journal                  = {Annals of Mathematics and Artificial Intelligence},\n  Year                     = {2004},\n\n  Month                    = {August},\n  Note                     = {Previous version appeared in Proc. of KR-2002},\n  Number                   = {2--4},\n  Pages                    = {259--299},\n  Volume                   = {41},\n\n  File                     = {sgll-amai04.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/sgll-amai04.pdf:PDF},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {sgll-amai04.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Iterated Belief Change and Exogenous Actions in the Situation Calculus.\n \n \n \n \n\n\n \n Shapiro, S.; and Pagnucco, M.\n\n\n \n\n\n\n In López de Mántaras, R.; and Saitta, L., editor(s), Proceedings of the 16th European Conference on Artificial Intelligence (ECAI-04), pages 878–882, Amsterdam, 2004. IOS Press\n \n\n\n\n
\n\n\n\n \n \n \"IteratedPaper\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{shapiro04,\n  Title                    = {Iterated Belief Change and Exogenous Actions in the\n Situation Calculus},\n  Author                   = {Shapiro, Steven and Pagnucco, Maurice},\n  Booktitle                = {Proceedings of the 16th European Conference on\n Artificial Intelligence (ECAI-04)},\n  Year                     = {2004},\n\n  Address                  = {Amsterdam},\n  Editor                   = {L\\'opez de M\\'antaras, R. and Saitta, L.},\n  Pages                    = {878--882},\n  Publisher                = {IOS Press},\n\n  File                     = {interbeliefecai04.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/interbeliefecai04.pdf:PDF},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {interbeliefecai04.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2003\n \n \n (21)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the Foundations of \\em Expected Expected Utility.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In ijcai03, pages 285–290, Acapulco, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{boutilier-eeu:ijcai03,\n  Title                    = {On the Foundations of {\\em Expected} Expected Utility},\n  Author                   = {Craig Boutilier},\n  Booktitle                = ijcai03,\n  Year                     = {2003},\n\n  Address                  = {Acapulco},\n  Pages                    = {285--290},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {foundations.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Cooperative Negotiation in Autonomic Systems using Incremental Utility Elicitation.\n \n \n \n \n\n\n \n Boutilier, C.; Das, R.; Kephart, J. O.; Tesauro, G.; and Walsh, W. E.\n\n\n \n\n\n\n In uai03, pages 89–97, Acapulco, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"CooperativePaper\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{BDKTW:uai03,\n  Title                    = {Cooperative Negotiation in Autonomic Systems using\n Incremental Utility Elicitation},\n  Author                   = {Craig Boutilier and Rajarshi Das and Jeffrey O. Kephart\n and Gerald Tesauro and William E. Walsh},\n  Booktitle                = uai03,\n  Year                     = {2003},\n\n  Address                  = {Acapulco},\n  Pages                    = {89--97},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {autonomic.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Constraint-based Optimization with the Minimax Decision Criterion.\n \n \n \n \n\n\n \n Boutilier, C.; Patrascu, R.; Poupart, P.; and Schuurmans, D.\n\n\n \n\n\n\n In Ninth International Conference on Principles and Practice of Constraint Programming, pages 168–182, Kinsale, Ireland, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"Constraint-basedPaper\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{BPPS:cp03,\n  Title                    = {Constraint-based Optimization with the Minimax Decision Criterion},\n  Author                   = {Craig Boutilier and Relu Patrascu and Pascal Poupart and\n Dale Schuurmans},\n  Booktitle                = {Ninth International Conference on Principles and Practice\n of Constraint Programming},\n  Year                     = {2003},\n\n  Address                  = {Kinsale, Ireland},\n  Pages                    = {168--182},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {minimax-CP.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Online Queries for Collaborative Filtering.\n \n \n \n \n\n\n \n Boutilier, C.; and Zemel, R. S.\n\n\n \n\n\n\n In Ninth International Workshop on Artificial Intelligence and Statistics Systems (AI-Stats-03), Key West, FL, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"OnlinePaper\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{BoutilierZemel:aistats03,\n  Title                    = {Online Queries for Collaborative Filtering},\n  Author                   = {Craig Boutilier and Richard S. Zemel},\n  Booktitle                = {Ninth International Workshop on Artificial\n Intelligence and Statistics Systems (AI-Stats-03)},\n  Year                     = {2003},\n\n  Address                  = {Key West, FL},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {querycf.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Active Collaborative Filtering.\n \n \n \n \n\n\n \n Boutilier, C.; Zemel, R. S.; and Marlin, B.\n\n\n \n\n\n\n In uai03, pages 98–106, Acapulco, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"ActivePaper\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{BZM:uai03,\n  Title                    = {Active Collaborative Filtering},\n  Author                   = {Craig Boutilier and Richard S. Zemel and Benjamin Marlin},\n  Booktitle                = uai03,\n  Year                     = {2003},\n\n  Address                  = {Acapulco},\n  Pages                    = {98--106},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {acf.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Coordination in Multiagent Reinforcement Learning: a Bayesian Approach.\n \n \n \n \n\n\n \n Chalkiadakis, G.; and Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-03), pages 709–716, Melbourne, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"CoordinationPaper\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{Chalkiadakis:aamas03,\n  Title                    = {Coordination in Multiagent Reinforcement Learning: a {Bayesian}\n Approach},\n  Author                   = {Georgios Chalkiadakis and Craig Boutilier},\n  Booktitle                = {Proceedings of the Second International Joint\n Conference on Autonomous Agents and Multiagent Systems (AAMAS-03)},\n  Year                     = {2003},\n\n  Address                  = {Melbourne},\n  Pages                    = {709--716},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bayesMARL.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Macro-actions in the Situation Calculus.\n \n \n \n \n\n\n \n Gu, Y.\n\n\n \n\n\n\n In Proceedings of the 5th IJCAI International Workshop on Nonmontonic Reasoning, Action and Change (NRAC-03), Acapulco, Mexico, August 2003. \n \n\n\n\n
\n\n\n\n \n \n \"Macro-actionsPaper\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{GuNRAC03macro,\n  Title                    = {Macro-actions in the Situation Calculus},\n  Author                   = {Yilan Gu},\n  Booktitle                = {Proceedings of the 5th IJCAI International Workshop on Nonmontonic Reasoning, Action and Change (NRAC-03)},\n  Year                     = {2003},\n\n  Address                  = {Acapulco, Mexico},\n  Month                    = {August},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {YGu_nrac03_macro.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Conformant Probabilistic Planning via CSPs.\n \n \n \n \n\n\n \n Hyafil, N.; and Bacchus, F.\n\n\n \n\n\n\n In International Conference on Automated Planning and Scheduling (ICAPS 2003), 2003. \n \n\n\n\n
\n\n\n\n \n \n \"ConformantPaper\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{hyafilbacchus-icaps03,\n  Title                    = {Conformant Probabilistic Planning via CSPs},\n  Author                   = {Nathanael Hyafil and Fahiem Bacchus},\n  Booktitle                = {International Conference on Automated\n Planning and Scheduling (ICAPS 2003)},\n  Year                     = {2003},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {HyafilBacchus-ICAPS03.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Logical Foundations of Active Databases.\n \n \n \n \n\n\n \n Kiringa, I.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Computer Science, University of Toronto, Toronto, Canada, 2003.\n \n\n\n\n
\n\n\n\n \n \n \"LogicalPaper\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
@PhdThesis{Kiringa03-Phd,\n  Title                    = {Logical Foundations of Active Databases},\n  Author                   = {Kiringa, Iluju},\n  School                   = {Department of Computer Science, University of Toronto},\n  Year                     = {2003},\n\n  Address                  = {Toronto, Canada},\n\n  File                     = {phdKiringa.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/phdKiringa.pdf:PDF},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {phdKiringa.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases.\n \n \n \n \n\n\n \n Liu, Y.; and Levesque, H.\n\n\n \n\n\n\n In Proc. IJCAI-03, pages 83–88, Acapulco, Mexico, August 2003. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{Liu03,\n  Title                    = {A Tractability Result for Reasoning with Incomplete\n First-Order Knowledge Bases},\n  Author                   = {Liu, Yongmei and Levesque, Hector},\n  Booktitle                = {Proc. IJCAI-03},\n  Year                     = {2003},\n\n  Address                  = {Acapulco, Mexico},\n  Month                    = {August},\n  Pages                    = {83--88},\n\n  File                     = {liu03trac.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/liu03trac.ps:PostScript},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {liu03trac.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Practical Partition-Based Theorem Proving for Large Knowledge Bases.\n \n \n \n \n\n\n \n MacCartney, B.; McIlraith, S.; Amir, E.; and Uribe, T.\n\n\n \n\n\n\n In Proceedings of the Nineteenth International Conference on Artificial Intelligence (IJCAI-03), pages 89-98, Acapulco, Mexico, August 9-15 2003. \n \n\n\n\n
\n\n\n\n \n \n \"PracticalPaper\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{mp-ijcai03,\n  Title                    = {Practical Partition-Based Theorem Proving for Large Knowledge Bases},\n  Author                   = {MacCartney, B. and McIlraith, S. and Amir, E. and Uribe, T.},\n  Booktitle                = {Proceedings of the Nineteenth International Conference on Artificial Intelligence (IJCAI-03)},\n  Year                     = {2003},\n\n  Address                  = {Acapulco, Mexico},\n  Month                    = {August 9-15},\n  Pages                    = {89-98},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {mp-ijcai03.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Adapting BPEL4WS for the Semantic Web: The Bottom-Up Approach to Web Service Interoperation.\n \n \n \n \n\n\n \n Mandell, D.; and McIlraith, S.\n\n\n \n\n\n\n In Second International Semantic Web Conference (ISWC2003), pages 227-241, Sanibel Island, FL, USA, October 20-23 2003. \n \n\n\n\n
\n\n\n\n \n \n \"AdaptingPaper\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{iswc2003sam-djm-FINAL,\n  Title                    = {Adapting BPEL4WS for the Semantic Web: The Bottom-Up \n Approach to Web Service Interoperation},\n  Author                   = {Mandell, D.J. and McIlraith, S.},\n  Booktitle                = {Second International Semantic Web Conference (ISWC2003)},\n  Year                     = {2003},\n\n  Address                  = {Sanibel Island, FL, USA},\n  Month                    = {October 20-23},\n  Pages                    = {227-241},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {iswc2003sam-djm-FINAL.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Bottom-Up Approach to Automating Web Service Discovery, Customization, and Semantic Translation.\n \n \n \n \n\n\n \n Mandell, D.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Twelfth International World Wide Web Conference, Workshop on E-Services and the Semantic Web (ESSW'03), Budapest, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{www-ESSW03-workshop,\n  Title                    = {A Bottom-Up Approach to Automating Web Service Discovery, Customization, and Semantic Translation},\n  Author                   = {Mandell, D. and McIlraith, S.},\n  Booktitle                = {Proceedings of the Twelfth International World Wide Web Conference, Workshop on E-Services and the Semantic Web (ESSW'03)},\n  Year                     = {2003},\n\n  Address                  = {Budapest},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {www-ESSW03-workshop.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bringing Semantics to Web Services.\n \n \n \n \n\n\n \n McIlraith, S.; and Martin, D.\n\n\n \n\n\n\n IEEE Intelligent Systems, 18(1): 90-93. January/February 2003.\n \n\n\n\n
\n\n\n\n \n \n \"BringingPaper\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{semantics-ieeeis03,\n  Title                    = {Bringing Semantics to Web Services},\n  Author                   = {McIlraith, S. and Martin, D.},\n  Journal                  = {IEEE Intelligent Systems},\n  Year                     = {2003},\n\n  Month                    = {January/February},\n  Number                   = {1},\n  Pages                    = {90-93},\n  Volume                   = {18},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ieee03.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Analysis and Simulation of Web Services.\n \n \n \n \n\n\n \n Narayanan, S.; and McIlraith, S.\n\n\n \n\n\n\n Computer Networks, 42(5): 675-693. 2003.\n \n\n\n\n
\n\n\n\n \n \n \"AnalysisPaper\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{web-services-03,\n  Title                    = {Analysis and Simulation of Web Services},\n  Author                   = {Narayanan, S. and McIlraith, S.},\n  Journal                  = {Computer Networks},\n  Year                     = {2003},\n  Number                   = {5},\n  Pages                    = {675-693},\n  Volume                   = {42},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {web-services-03.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bounded Finite State Controllers.\n \n \n \n \n\n\n \n Poupart, P.; and Boutilier, C.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 16 (NIPS-2003), Vancouver, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"BoundedPaper\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{PoupartBoutilier:nips03,\n  Title                    = {Bounded Finite State Controllers},\n  Author                   = {Pascal Poupart and Craig Boutilier},\n  Booktitle                = {Advances in Neural Information Processing Systems 16 (NIPS-2003)},\n  Year                     = {2003},\n\n  Address                  = {Vancouver},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bfsc.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Bayesian Approach to Imitation in Reinforcement Learning.\n \n \n \n \n\n\n \n Price, B.; and Boutilier, C.\n\n\n \n\n\n\n In ijcai03, pages 712–717, Acapulco, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{PriceBoutilier:ijcai03,\n  Title                    = {A Bayesian Approach to Imitation in Reinforcement Learning},\n  Author                   = {Bob Price and Craig Boutilier},\n  Booktitle                = ijcai03,\n  Year                     = {2003},\n\n  Address                  = {Acapulco},\n  Pages                    = {712--717},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {BayesImitation.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Accelerating Reinforcement Learning through Implicit Imitation.\n \n \n \n \n\n\n \n Price, B.; and Boutilier, C.\n\n\n \n\n\n\n Journal of Artificial Intelligence Research, 19: 569–629. 2003.\n \n\n\n\n
\n\n\n\n \n \n \"AcceleratingPaper\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{PriceBoutilier:JAIR03,\n  Title                    = {Accelerating Reinforcement Learning through Implicit Imitation},\n  Author                   = {Bob Price and Craig Boutilier},\n  Journal                  = {Journal of Artificial Intelligence Research},\n  Year                     = {2003},\n  Pages                    = {569--629},\n  Volume                   = {19},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {PriceBoutilierJAIR03-abs.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Rational Action in Agent Programs with Prioritized Goals.\n \n \n \n \n\n\n \n Sardiña, S.; and Shapiro, S.\n\n\n \n\n\n\n In Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-03), pages 417–424, Melbourne, Australia, July 2003. ACM Press\n \n\n\n\n
\n\n\n\n \n \n \"RationalPaper\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{Sardina03,\n  Title                    = {Rational Action in Agent Programs with Prioritized\n Goals},\n  Author                   = {Sardi\\~na, Sebastian and Shapiro, Steven},\n  Booktitle                = {Proceedings of the Second International Joint\n Conference on Autonomous Agents and Multiagent Systems\n (AAMAS-03)},\n  Year                     = {2003},\n\n  Address                  = {Melbourne, Australia},\n  Month                    = {July},\n  Pages                    = {417--424},\n  Publisher                = {ACM Press},\n\n  File                     = {aamas03.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/aamas03.pdf:PDF;aamas03.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/aamas03.ps:PostScript},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {aamas03.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Knowledge, Action, and the Frame Problem.\n \n \n \n \n\n\n \n Scherl, R.; and Levesque, H. J.\n\n\n \n\n\n\n Artificial Intelligence, 144(1–2): 1–39. 2003.\n \n\n\n\n
\n\n\n\n \n \n \"Knowledge,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
@Article{Scherl03,\n  Title                    = {Knowledge, Action, and the Frame Problem},\n  Author                   = {Scherl, R. and Levesque, H. J.},\n  Journal                  = {Artificial Intelligence},\n  Year                     = {2003},\n  Number                   = {1--2},\n  Pages                    = {1--39},\n  Volume                   = {144},\n\n  File                     = {aij03frame.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/aij03frame.pdf:PDF},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {aij03frame.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Incremental Utility Elicitation with the Minimax Regret Decision Criterion.\n \n \n \n \n\n\n \n Wang, T.; and Boutilier, C.\n\n\n \n\n\n\n In ijcai03, pages 309–316, Acapulco, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"IncrementalPaper\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{WangBoutilier:ijcai03,\n  Title                    = {Incremental Utility Elicitation with the Minimax Regret Decision\n Criterion},\n  Author                   = {Tianhan Wang and Craig Boutilier},\n  Booktitle                = ijcai03,\n  Year                     = {2003},\n\n  Address                  = {Acapulco},\n  Pages                    = {309--316},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {minimax.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (18)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Solving Concisely Expressed Combinatorial Auction Problems.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In aaai02, pages 359–366, Edmonton, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"SolvingPaper\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{Boutilier-bidlang:aaai02,\n  Title                    = {Solving Concisely Expressed Combinatorial Auction Problems},\n  Author                   = {Craig Boutilier},\n  Booktitle                = aaai02,\n  Year                     = {2002},\n\n  Address                  = {Edmonton},\n  Pages                    = {359--366},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bidcomp.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A POMDP Formulation of Preference Elicitation Problems.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In aaai02, pages 239–246, Edmonton, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{Boutilier-preference:aaai02,\n  Title                    = {A {POMDP} Formulation of Preference Elicitation Problems},\n  Author                   = {Craig Boutilier},\n  Booktitle                = aaai02,\n  Year                     = {2002},\n\n  Address                  = {Edmonton},\n  Pages                    = {239--246},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {pefa.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Toward Behavioral Intelligence in the Semantic Web.\n \n \n \n \n\n\n \n Bryson, J.; Martin, D.; McIlraith, S.; and Stein, L.\n\n\n \n\n\n\n IEEE Computer, Special Issue on Web Intelligence, 35(11): 48-55. November 2002.\n \n\n\n\n
\n\n\n\n \n \n \"TowardPaper\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{semweb-ieeec-02,\n  Title                    = {Toward Behavioral Intelligence in the Semantic Web},\n  Author                   = {Bryson, J. and Martin, D. and McIlraith, S. and Stein, L.},\n  Journal                  = {IEEE Computer, Special Issue on Web Intelligence},\n  Year                     = {2002},\n\n  Month                    = {November},\n  Number                   = {11},\n  Pages                    = {48-55},\n  Volume                   = {35},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {semweb-ieeec-02.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n DAML-S: Web Service Description for the Semantic Web.\n \n \n \n \n\n\n \n Coalition), (. S.; Ankolekar, A.; Burstein, M.; Hobbs, J.; Lassila, O.; Martin, D.; McDermott, D.; McIlraith, S.; Narayanan, S.; Paolucci, M.; Payne, T.; and Sycara, K.\n\n\n \n\n\n\n In Proceedings of the International Semantic Web Conference (ISWC), pages 348-363, Sardinia, Italy, July 9-12 2002. \n \n\n\n\n
\n\n\n\n \n \n \"DAML-S: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{damls-iswc02,\n  Title                    = {DAML-S: Web Service Description for the Semantic Web},\n  Author                   = {(DAML Services Coalition) and A. Ankolekar and M. Burstein and J. Hobbs and O. Lassila and D. Martin and \n D. McDermott and S. McIlraith and S. Narayanan and M. Paolucci and T. Payne and K. Sycara},\n  Booktitle                = {Proceedings of the International Semantic Web Conference (ISWC)},\n  Year                     = {2002},\n\n  Address                  = {Sardinia, Italy},\n  Month                    = {July 9-12},\n  Pages                    = {348-363},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {damls-iswc02.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Semantics of Deliberation in IndiGolog – From Theory to Implementation.\n \n \n \n \n\n\n \n De Giacomo, G.; Lespérance, Y.; Levesque, H.; and Sardiña, S.\n\n\n \n\n\n\n In Fensel, ..; Giunchiglia, F.; McGuinness, D.; and Williams, M. A., editor(s), Proceedings of Eighth International Conference in Principles of Knowledge Representation and Reasoning (KR-2002), pages 603–614, Toulouse, France, April 2002. Morgan Kaufmann\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{Giuseppe02,\n  Title                    = {On the Semantics of Deliberation in {I}ndi{G}olog --\n From Theory to Implementation},\n  Author                   = {De Giacomo, Giuseppe and Lesp\\'erance, Yves and\n Levesque, Hector and Sardi\\~na, Sebastian},\n  Booktitle                = {Proceedings of Eighth International Conference in\n Principles of Knowledge Representation and Reasoning\n (KR-2002)},\n  Year                     = {2002},\n\n  Address                  = {Toulouse, France},\n  Editor                   = {.\\ Fensel and F.\\ Giunchiglia and D.\\ McGuinness and\n M. A. Williams},\n  Month                    = {April},\n  Pages                    = {603--614},\n  Publisher                = {Morgan Kaufmann},\n\n  File                     = {kr02-semdelib.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/kr02-semdelib.pdf:PDF;kr02-semdelib.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/kr02-semdelib.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/kr02-semdelib.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {kr02-semdelib.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Programming Hierarchical Task Networks in the Situation Calculus.\n \n \n \n \n\n\n \n Gabaldon, A.\n\n\n \n\n\n\n In AIPS'02 Workshop on On-line Planning and Scheduling, Toulouse, France, April 2002. \n \n\n\n\n
\n\n\n\n \n \n \"ProgrammingPaper\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{Gabaldon02,\n  Title                    = {Programming Hierarchical Task Networks in the\n Situation Calculus},\n  Author                   = {Alfredo Gabaldon},\n  Booktitle                = {{AIPS}'02 Workshop on On-line Planning and Scheduling},\n  Year                     = {2002},\n\n  Address                  = {Toulouse, France},\n  Month                    = {April},\n\n  File                     = {htn-opw.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/htn-opw.pdf:PDF;htn-opw.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/htn-opw.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/htn-opw.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {htn-opw.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Handling Uncertainty System in the Situation Calculus with Macro-actions.\n \n \n \n \n\n\n \n Gu, Y.\n\n\n \n\n\n\n Master's thesis, Dept. of Computer Science, University of Toronto, October 2002.\n \n\n\n\n
\n\n\n\n \n \n \"HandlingPaper\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
@MastersThesis{Gu2002msthesis,\n  Title                    = {Handling Uncertainty System in the Situation Calculus with Macro-actions},\n  Author                   = {Yilan Gu},\n  School                   = {Dept. of Computer Science, University of Toronto},\n  Year                     = {2002},\n  Month                    = {October},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {YGu_ut02_MSthesis.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Specifying Event Logics for Active Databases.\n \n \n \n \n\n\n \n Kiringa, I.\n\n\n \n\n\n\n In Proceedings of the KR 8th International Workshop on Knowledge Representation Meets Databases (KRDB'02), Toulouse, April 2002. \n \n\n\n\n
\n\n\n\n \n \n \"SpecifyingPaper\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{Kiringa02a,\n  Title                    = {Specifying Event Logics for Active Databases},\n  Author                   = {Kiringa, I.},\n  Booktitle                = {Proceedings of the KR 8th International Workshop on\n Knowledge Representation Meets Databases (KRDB'02)},\n  Year                     = {2002},\n\n  Address                  = {Toulouse},\n  Month                    = {April},\n\n  File                     = {krdb02.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/krdb02.pdf:PDF;krdb02.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/krdb02.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/krdb02.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {krdb02.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Monitoring a Complex Physical System using a Hybrid Dynamic Bayes Net.\n \n \n \n \n\n\n \n Lerner, U.; Moses, B.; Scott, M.; McIlraith, S.; and Koller, D.\n\n\n \n\n\n\n In Proceedings of the Eighteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-2002), pages 301-310, University of Alberta, Edmonton, August 1-4 2002. \n \n\n\n\n
\n\n\n\n \n \n \"MonitoringPaper\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{uai02,\n  Title                    = {Monitoring a Complex Physical System using a Hybrid Dynamic Bayes Net},\n  Author                   = {Lerner, U. and Moses, B. and Scott, M. and McIlraith, S. and Koller, D.},\n  Booktitle                = {Proceedings of the Eighteenth Annual Conference \n on Uncertainty in Artificial Intelligence (UAI-2002)},\n  Year                     = {2002},\n\n  Address                  = {University of Alberta, Edmonton},\n  Month                    = {August 1-4},\n  Pages                    = {301-310},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {uai02.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Hoare-Style Proof System for Robot Programs.\n \n \n \n \n\n\n \n Liu, Y.\n\n\n \n\n\n\n In Proceedings of AAAI-02, Edmonton, Canada, July 2002. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{Liu02,\n  Title                    = {A Hoare-Style Proof System for Robot Programs},\n  Author                   = {Yongmei Liu},\n  Booktitle                = {Proceedings of AAAI-02},\n  Year                     = {2002},\n\n  Address                  = {Edmonton, Canada},\n  Month                    = {July},\n\n  File                     = {hg.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/hg.pdf:PDF;hg.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/hg.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/hg.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {hg.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with Complex Actions.\n \n \n \n \n\n\n \n McIlraith, S.; and Fadel, R.\n\n\n \n\n\n\n In Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning (NMR2002), pages 356-364, Toulouse, France, April 19-21 2002. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\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{mci-fad-nmr02f,\n  Title                    = {Planning with Complex Actions},\n  Author                   = {McIlraith, S. and Fadel, R.},\n  Booktitle                = {Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning (NMR2002)},\n  Year                     = {2002},\n\n  Address                  = {Toulouse, France},\n  Month                    = {April 19-21},\n  Pages                    = {356-364},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {mci-fad-nmr02f.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Adapting Golog for Composition of Semantic Web Services.\n \n \n \n \n\n\n \n McIlraith, S.; and Son, T.\n\n\n \n\n\n\n In Proceedings of the Eighth International Conference on Knowledge Representation and Reasoning (KR2002), pages 482-493, Toulouse, France, April 22-25 2002. \n \n\n\n\n
\n\n\n\n \n \n \"AdaptingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{mci-son-kr02,\n  Title                    = {Adapting Golog for Composition of Semantic Web Services},\n  Author                   = {McIlraith, S. and Son, T.},\n  Booktitle                = {Proceedings of the Eighth International Conference on Knowledge Representation and Reasoning (KR2002)},\n  Year                     = {2002},\n\n  Address                  = {Toulouse, France},\n  Month                    = {April 22-25},\n  Pages                    = {482-493},\n\n  Keywords                 = {Golog},\n  Timestamp                = {2018.09.23},\n  Url                      = {mci-son-kr02.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Simulation, Verification and Automated Composition of Web Services.\n \n \n \n \n\n\n \n Narayanan, S.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Eleventh International World Wide Web Conference (WWW-11), pages 77-88, Honolulu, Hawaii, USA, May 7-11 2002. \n \n\n\n\n
\n\n\n\n \n \n \"Simulation,Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{nar-mci-www11,\n  Title                    = {Simulation, Verification and Automated Composition of Web Services},\n  Author                   = {Narayanan, S. and McIlraith, S. },\n  Booktitle                = {Proceedings of the Eleventh International World Wide Web Conference (WWW-11)},\n  Year                     = {2002},\n\n  Address                  = {Honolulu, Hawaii, USA},\n  Month                    = {May 7-11},\n  Pages                    = {77-88},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {nar-mci-www11.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Knowledge Equivalence in Combined Action Theories.\n \n \n \n \n\n\n \n Petrick, R.; and Levesque, H.\n\n\n \n\n\n\n In Proceedings of KR-2002, Toulouse, France, April 2002. \n \n\n\n\n
\n\n\n\n \n \n \"KnowledgePaper\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{Petrick02,\n  Title                    = {Knowledge Equivalence in Combined Action Theories},\n  Author                   = {Petrick, Ron and Levesque, Hector},\n  Booktitle                = {Proceedings of KR-2002},\n  Year                     = {2002},\n\n  Address                  = {Toulouse, France},\n  Month                    = {April},\n\n  File                     = {kr2002-ron.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/kr2002-ron.pdf:PDF;kr2002-ron.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/kr2002-ron.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/kr2002-ron.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {kr2002-ron.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Value-directed Compressions of POMDPs.\n \n \n \n \n\n\n \n Poupart, P.; and Boutilier, C.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 15 (NIPS-2002), pages 1547–1554, Vancouver, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"Value-directedPaper\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{PoupartBoutilier:nips02,\n  Title                    = {Value-directed Compressions of {POMDPs}},\n  Author                   = {Pascal Poupart and Craig Boutilier},\n  Booktitle                = {Advances in Neural Information Processing Systems 15 (NIPS-2002)},\n  Year                     = {2002},\n\n  Address                  = {Vancouver},\n  Pages                    = {1547--1554},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {vdib.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Piecewise Linear Value Function Approximation for Factored MDPs.\n \n \n \n \n\n\n \n Poupart, P.; Boutilier, C.; Patrascu, R.; and Schuurmans, D.\n\n\n \n\n\n\n In aaai02, pages 292–299, Edmonton, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"PiecewisePaper\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{PBPS:aaai02,\n  Title                    = {Piecewise Linear Value Function Approximation for Factored {MDPs}},\n  Author                   = {Pascal Poupart and Craig Boutilier and Relu Patrascu\n and Dale Schuurmans},\n  Booktitle                = aaai02,\n  Year                     = {2002},\n\n  Address                  = {Edmonton},\n  Pages                    = {292--299},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {basistrees.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Greedy Linear Value-approximation for Factored Markov Decision Processes.\n \n \n \n \n\n\n \n Poupart, P.; Patrascu, R.; Schuurmans, D.; Boutilier, C.; and Guestrin, C.\n\n\n \n\n\n\n In aaai02, pages 285–291, Edmonton, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"GreedyPaper\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{PPSBG:aaai02,\n  Title                    = {Greedy Linear Value-approximation for Factored\n Markov Decision Processes},\n  Author                   = {Pascal Poupart and Relu Patrascu and Dale Schuurmans and\n Craig Boutilier and Carlos Guestrin},\n  Booktitle                = aaai02,\n  Year                     = {2002},\n\n  Address                  = {Edmonton},\n  Pages                    = {285--291},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {basislinear.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Cognitive Agents Specification Language and Verification Environment for Multiagent Systems.\n \n \n \n \n\n\n \n Shapiro, S.; Lespérance, Y.; and Levesque, H. J.\n\n\n \n\n\n\n In Castelfranchi, C.; and Johnson, W. L., editor(s), Proc. of the First Int. Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-02), pages 19–26. ACM Press, 2002.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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
@InCollection{shapiro02,\n  Title                    = {The Cognitive Agents Specification Language and\n Verification Environment for Multiagent Systems},\n  Author                   = {Shapiro, Steven and Lesp\\'{e}rance, Yves and Levesque,\n Hector J.},\n  Booktitle                = { Proc. of the First Int. Joint Conference on\n Autonomous Agents and Multiagent Systems (AAMAS-02)},\n  Publisher                = {ACM Press},\n  Year                     = {2002},\n  Editor                   = {Christiano Castelfranchi and W. L. Johnson},\n  Pages                    = {19--26},\n\n  File                     = {aamas02.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/aamas02.ps:PostScript},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {aamas02.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2001\n \n \n (26)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report).\n \n \n \n \n\n\n \n Amir, E.; and McIlraith, S.\n\n\n \n\n\n\n In Kautz, H.; and Selman, B., editor(s), Proceedings of LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), of Electronics Notes in Discrete Mathematics, Boston, Massachusetts, USA, June 14-15 2001. Elsevier Publishing\n \n\n\n\n
\n\n\n\n \n \n \"SolvingPaper\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{sat01,\n  Title                    = {Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report)},\n  Author                   = {Amir, E. and McIlraith, S.},\n  Booktitle                = {Proceedings of LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001)},\n  Year                     = {2001},\n\n  Address                  = {Boston, Massachusetts, USA},\n  Editor                   = {Henry Kautz and Bart Selman},\n  Month                    = {June 14-15},\n  Publisher                = {Elsevier Publishing},\n  Series                   = {Electronics Notes in Discrete Mathematics},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {sat01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Theorem Proving with Structured Theories (Preliminary Report).\n \n \n \n \n\n\n \n Amir, E.; and McIlraith, S.\n\n\n \n\n\n\n In Kautz, H.; and Selman, B., editor(s), Proceedings of LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), of Electronics Notes in Discrete Mathematics, Boston, Massachusetts, USA, June 14-15 2001. Elsevier Publishing\n \n\n\n\n
\n\n\n\n \n \n \"TheoremPaper\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{sat01ws,\n  Title                    = {Theorem Proving with Structured Theories (Preliminary Report)},\n  Author                   = {Amir, E. and McIlraith, S.},\n  Booktitle                = {Proceedings of LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001)},\n  Year                     = {2001},\n\n  Address                  = {Boston, Massachusetts, USA},\n  Editor                   = {Henry Kautz and Bart Selman},\n  Month                    = {June 14-15},\n  Publisher                = {Elsevier Publishing},\n  Series                   = {Electronics Notes in Discrete Mathematics},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ami-mci-sat01b.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n UCP-Networks: A Directed Graphical Representation of Conditional Utilities.\n \n \n \n \n\n\n \n Boutilier, C.; Bacchus, F.; and Brafman, R. I.\n\n\n \n\n\n\n In uai01, pages 56–64, Seattle, 2001. \n \n\n\n\n
\n\n\n\n \n \n \"UCP-Networks: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{ucpnets:uai01,\n  Title                    = {{UCP-Networks}: A Directed Graphical Representation of Conditional\n Utilities},\n  Author                   = {Craig Boutilier and Fahiem Bacchus and Ronen I. Brafman},\n  Booktitle                = uai01,\n  Year                     = {2001},\n\n  Address                  = {Seattle},\n  Pages                    = {56--64},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ucpnets.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with Concurrent Interacting Actions.\n \n \n \n \n\n\n \n Boutilier, C.; and Brafman, R. I.\n\n\n \n\n\n\n Journal of Artificial Intelligence Research, 14: 105–136. 2001.\n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\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{BoutilierBrafman:JAIR01,\n  Title                    = {Planning with Concurrent Interacting Actions},\n  Author                   = {Craig Boutilier and Ronen I. Brafman},\n  Journal                  = {Journal of Artificial Intelligence Research},\n  Year                     = {2001},\n  Pages                    = {105--136},\n  Volume                   = {14},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {boutilier01a.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bidding Languages for Combinatorial Auctions.\n \n \n \n \n\n\n \n Boutilier, C.; and Hoos, H. H.\n\n\n \n\n\n\n In ijcai01, pages 1211–1217, Seattle, 2001. \n \n\n\n\n
\n\n\n\n \n \n \"BiddingPaper\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{BoutilierHoos:ijcai01,\n  Title                    = {Bidding Languages for Combinatorial Auctions},\n  Author                   = {Craig Boutilier and Holger H. Hoos},\n  Booktitle                = ijcai01,\n  Year                     = {2001},\n\n  Address                  = {Seattle},\n  Pages                    = {1211--1217},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {bidlang.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Symbolic Dynamic Programming for First-Order MDPs.\n \n \n \n \n\n\n \n Boutilier, C.; Reiter, R.; and Price, B.\n\n\n \n\n\n\n In Nebel, B., editor(s), Proceedings of the seventeenth International Conference on Artificial Intelligence (IJCAI-01), pages 690–697, San Francisco, CA, August 4–10 2001. Morgan Kaufmann Publishers, Inc.\n \n\n\n\n
\n\n\n\n \n \n \"SymbolicPaper\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{Boutilier01,\n  Title                    = {Symbolic Dynamic Programming for {First-Order} {MDPs}},\n  Author                   = {Craig Boutilier and Ray Reiter and Bob Price},\n  Booktitle                = {Proceedings of the seventeenth International\n Conference on Artificial Intelligence (IJCAI-01)},\n  Year                     = {2001},\n\n  Address                  = {San Francisco, CA},\n  Editor                   = {Bernhard Nebel},\n  Month                    = {August 4--10},\n  Pages                    = {690--697},\n  Publisher                = {Morgan Kaufmann Publishers, Inc.},\n\n  File                     = {dtregression.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/dtregression.pdf:PDF;dtregression.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/dtregression.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/dtregression.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {dtregression.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n DAML-S: Semantic Markup for Web Services.\n \n \n \n \n\n\n \n Coalition), (. S.; Ankolekar, A.; Burstein, M.; Hobbs, J.; Lassila, O.; Martin, D.; McDermott, D.; McIlraith, S.; Narayanan, S.; Paolucci, M.; Payne, T.; and Sycara, K.\n\n\n \n\n\n\n In Proceedings of the International Semantic Web Working Symposium (SWWS), pages 411-430, Stanford University, California, USA, July 30 - August 1 2001. \n \n\n\n\n
\n\n\n\n \n \n \"DAML-S: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{daml-s,\n  Title                    = {DAML-S: Semantic Markup for Web Services},\n  Author                   = {(DAML Services Coalition) and A. Ankolekar and M. Burstein and J. Hobbs and O. Lassila and D. Martin and \n D. McDermott and S. McIlraith and S. Narayanan and M. Paolucci and T. Payne and K. Sycara},\n  Booktitle                = {Proceedings of the International Semantic Web Working Symposium (SWWS)},\n  Year                     = {2001},\n\n  Address                  = {Stanford University, California, USA},\n  Month                    = {July 30 - August 1},\n  Pages                    = {411-430},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {daml-s.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Incremental Execution of Guarded Theories.\n \n \n \n \n\n\n \n De Giacomo, G.; Levesque, H. J.; and Sardina, S.\n\n\n \n\n\n\n ACM Transactions on Computational Logic (TOCL), 2(4): 495–525. October 2001.\n \n\n\n\n
\n\n\n\n \n \n \"IncrementalPaper\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
@Article{Giuseppe01,\n  Title                    = {Incremental Execution of Guarded Theories},\n  Author                   = {De Giacomo, Giuseppe and Levesque, Hector J. and\n Sardina, Sebastian},\n  Journal                  = {ACM Transactions on Computational Logic (TOCL)},\n  Year                     = {2001},\n\n  Month                    = {October},\n  Number                   = {4},\n  Pages                    = {495--525},\n  Volume                   = {2},\n\n  File                     = {TOCL01-DGLS.pdf:papers/TOCL01-DGLS.pdf:PDF},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {TOCL01-DGLS.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Simulation of Advanced Transaction Models Using GOLOG.\n \n \n \n \n\n\n \n Kiringa, I\n\n\n \n\n\n\n In Proceedings of the 8th Biennial Workshop on Data Bases and Programming Languages (DBPL'01), 2001. \n \n\n\n\n
\n\n\n\n \n \n \"SimulationPaper\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{Kiringa01a,\n  Title                    = {Simulation of Advanced Transaction Models Using GOLOG},\n  Author                   = {Kiringa, I},\n  Booktitle                = {Proceedings of the 8th Biennial Workshop on Data Bases\n and Programming Languages (DBPL'01)},\n  Year                     = {2001},\n\n  File                     = {dbpl01.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/dbpl01.pdf:PDF;dbpl01.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/dbpl01.ps:PostScript},\n  Key                      = {CogRobo},\n  Keywords                 = {Golog},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/dbpl01.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {dbpl01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards a Theory of Advanced Transaction Models in the Situation Calculus (Extended Abstract).\n \n \n \n \n\n\n \n Kiringa, I.\n\n\n \n\n\n\n In Proceedings of the VLDB 8th International Workshop on Knowledge Representation Meets Databases (KRDB'01), 2001. \n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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{Kiringa01b,\n  Title                    = {Towards a Theory of Advanced Transaction Models in the\n Situation Calculus (Extended Abstract)},\n  Author                   = {Kiringa, I.},\n  Booktitle                = {Proceedings of the VLDB 8th International Workshop on\n Knowledge Representation Meets Databases (KRDB'01)},\n  Year                     = {2001},\n\n  File                     = {krdb01.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/krdb01.pdf:PDF;krdb01.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/krdb01.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/krdb01.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {krdb01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Epistemic Feasibility of Plans in Multiagent Systems Specifications.\n \n \n \n \n\n\n \n Lespérance, Y.\n\n\n \n\n\n\n In Meyer, J. C.; and Tambe, M., editor(s), Pre-Proceedings of the 8th International Workshop on Agent Theories, Architectures, and Languages (ATAL-01), volume 2333, of LNAI, pages 69–85, Seattle, USA, August 2001. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{Lesperance01,\n  Title                    = {On the Epistemic Feasibility of Plans in Multiagent\n Systems Specifications},\n  Author                   = {Lesp\\'erance, Yves},\n  Booktitle                = {Pre-Proceedings of the 8th International Workshop on\n Agent Theories, Architectures, and Languages (ATAL-01)},\n  Year                     = {2001},\n\n  Address                  = {Seattle, USA},\n  Editor                   = {Meyer, J.-J. Ch. and Tambe, M.},\n  Month                    = {August},\n  Pages                    = {69--85},\n  Series                   = {LNAI},\n  Volume                   = {2333},\n\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {Lesperance01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Logic of Knowledge Bases.\n \n \n \n \n\n\n \n Levesque, H. J.; and Lakemeyer, G.\n\n\n \n\n\n\n MIT Press, 2001.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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
@Book{Levesque01-LKB,\n  Title                    = {The Logic of Knowledge Bases},\n  Author                   = {Levesque, Hector J. and Lakemeyer, Gerhard},\n  Publisher                = {MIT Press},\n  Year                     = {2001},\n\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {Levesque01-LKB.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Theorem Proving with Structured Theories.\n \n \n \n \n\n\n \n McIlraith, S.; and Amir, E.\n\n\n \n\n\n\n In Proceedings of the Seventeenth International Conference on Artificial Intelligence (IJCAI-01), pages 624-634, Seattle, Washington, USA, August 4-10 2001. \n \n\n\n\n
\n\n\n\n \n \n \"TheoremPaper\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{ijcai01-final,\n  Title                    = {Theorem Proving with Structured Theories},\n  Author                   = {McIlraith, S. and Amir, E.},\n  Booktitle                = {Proceedings of the Seventeenth International Conference on Artificial Intelligence (IJCAI-01)},\n  Year                     = {2001},\n\n  Address                  = {Seattle, Washington, USA},\n  Month                    = {August 4-10},\n  Pages                    = {624-634},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ijcai01-final.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Adapting Golog for Programming the Semantic Web.\n \n \n \n \n\n\n \n McIlraith, S.; and Son, T.\n\n\n \n\n\n\n In Proceedings of the Fifth Symposium on Logical Formalizations of Commonsense Reasoning (Common Sense 2001), pages 195-202, New York, NY, USA, May 20-22 2001. \n \n\n\n\n
\n\n\n\n \n \n \"AdaptingPaper\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
@InProceedings{cs01,\n  Title                    = {Adapting Golog for Programming the Semantic Web},\n  Author                   = {McIlraith, S. and Son, T.},\n  Booktitle                = {Proceedings of the Fifth Symposium on Logical Formalizations of Commonsense Reasoning (Common Sense 2001)},\n  Year                     = {2001},\n\n  Address                  = {New York, NY, USA},\n  Month                    = {May 20-22},\n  Pages                    = {195-202},\n\n  Keywords                 = {Golog},\n  Timestamp                = {2018.09.23},\n  Url                      = {cs01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Mobilizing the Web with DAML-Enabled Web Services.\n \n \n \n \n\n\n \n McIlraith, S.; Son, T.; and Zeng, H.\n\n\n \n\n\n\n In The Second International Workshop on the Semantic Web (SemWeb'2001) at WWW-10, May 2001. \n \n\n\n\n
\n\n\n\n \n \n \"MobilizingPaper\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{semweb01,\n  Title                    = {Mobilizing the Web with DAML-Enabled Web Services},\n  Author                   = {McIlraith, S. and Son, T. and Zeng, H.},\n  Booktitle                = {The Second International Workshop on the Semantic Web (SemWeb'2001) at WWW-10},\n  Year                     = {2001},\n  Month                    = {May},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {semweb01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Semantic Web Services.\n \n \n \n \n\n\n \n McIlraith, S.; Son, T.; and Zeng, H.\n\n\n \n\n\n\n IEEE Intelligent Systems. Special Issue on the Semantic Web, 16(2): 46-53. March/April 2001.\n \n\n\n\n
\n\n\n\n \n \n \"SemanticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{webserv-ieeeis01,\n  Title                    = {Semantic Web Services},\n  Author                   = {McIlraith, S. and Son, T.C. and Zeng, H.},\n  Journal                  = {IEEE Intelligent Systems. Special Issue on the Semantic Web},\n  Year                     = {2001},\n\n  Month                    = {March/April},\n  Number                   = {2},\n  Pages                    = {46-53},\n  Volume                   = {16},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ieee01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Visualization of Eclipses and Planetary Conjunction Events: The Interplay between Model Coherence, Scaling and Animation.\n \n \n \n \n\n\n \n Oberschelp, W.; Hornung, A.; and Samulowitz, H.\n\n\n \n\n\n\n The Visual Computer. 2001.\n \n\n\n\n
\n\n\n\n \n \n \"VisualizationPaper\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{Eclipses,\n  Title                    = {Visualization of Eclipses and Planetary Conjunction Events: The Interplay between Model Coherence, Scaling and Animation},\n  Author                   = {Walter Oberschelp and Alexander Hornung and Horst Samulowitz},\n  Journal                  = {The Visual Computer},\n  Year                     = {2001},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {eclipses.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Vector-space Analysis of 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 uai01, pages 445–452, Seattle, 2001. \n \n\n\n\n
\n\n\n\n \n \n \"Vector-spacePaper\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{PoupartBoutilier:uai01,\n  Title                    = {Vector-space Analysis of Belief State Approximation for {POMDPs}},\n  Author                   = {Pascal Poupart and Craig Boutilier},\n  Booktitle                = uai01,\n  Year                     = {2001},\n\n  Address                  = {Seattle},\n  Pages                    = {445--452},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {vda-vs.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Value-Directed Sampling Methods for Monitoring POMDPs.\n \n \n \n \n\n\n \n Poupart, P.; Ortiz, L. E.; and Boutilier, C.\n\n\n \n\n\n\n In uai01, pages 453–461, Seattle, 2001. \n \n\n\n\n
\n\n\n\n \n \n \"Value-DirectedPaper\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{POB:uai01,\n  Title                    = {Value-Directed Sampling Methods for Monitoring {POMDPs}},\n  Author                   = {Pascal Poupart and Luis E. Ortiz and Craig Boutilier},\n  Booktitle                = uai01,\n  Year                     = {2001},\n\n  Address                  = {Seattle},\n  Pages                    = {453--461},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {filter-pomdps.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Imitation and Reinforcement Learning in Agents with Heterogeneous Actions.\n \n \n \n \n\n\n \n Price, B.; and Boutilier, C.\n\n\n \n\n\n\n In Stroulia, E.; and Matwin, S., editor(s), Proceedings 14th Biennial Conference of the Canadian Society for Computational Studies of Intelligence (AI 2001), of Lecture Notes in Computer Science, pages 111–120. Springer-Verlag, Berlin, 2001.\n \n\n\n\n
\n\n\n\n \n \n \"ImitationPaper\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
@InCollection{PriceBoutilier:cai01,\n  Title                    = {Imitation and Reinforcement Learning\n in Agents with Heterogeneous Actions},\n  Author                   = {Bob Price and Craig Boutilier},\n  Booktitle                = {Proceedings 14th Biennial Conference of the Canadian\n Society for Computational Studies of Intelligence (AI 2001)},\n  Publisher                = {Springer-Verlag},\n  Year                     = {2001},\n\n  Address                  = {Berlin},\n  Editor                   = {E. Stroulia and S. Matwin},\n  Number                   = {2056},\n  Pages                    = {111--120},\n  Series                   = {Lecture Notes in Computer Science},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {heterogeneous.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Knowledge-Based Programming with Sensing in the Situation Calculus.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n ACM Transactions on Computational Logic (TOCL), 2(4): 433–457. October 2001.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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
@Article{Reiter01,\n  Title                    = {On Knowledge-Based Programming with Sensing in the\n Situation Calculus},\n  Author                   = {Reiter, Ray},\n  Journal                  = {ACM Transactions on Computational Logic (TOCL)},\n  Year                     = {2001},\n\n  Month                    = {October},\n  Number                   = {4},\n  Pages                    = {433--457},\n  Volume                   = {2},\n\n  File                     = {kbprogramming.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/kbprogramming.pdf:PDF;kbprogramming.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/kbprogramming.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/kbprogramming.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {kbprogramming.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Knowledge in Action. Logical Foundations for Specifying and Implementing Dynamical Systems.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n MIT Press, 2001.\n \n\n\n\n
\n\n\n\n \n \n \"KnowledgePaper\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
@Book{Reiter01-Book,\n  Title                    = {Knowledge in Action. {L}ogical Foundations for\n Specifying and Implementing Dynamical Systems},\n  Author                   = {Reiter, Raymond},\n  Publisher                = {MIT Press},\n  Year                     = {2001},\n\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {http://www.cs.toronto.edu/cogrobo/kia/index.html}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Local Conditional High-Level Robot Programs.\n \n \n \n \n\n\n \n Sardina, S.\n\n\n \n\n\n\n In Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-01), volume 2250, of LNAI, pages 110–124, La Habana, Cuba, December 2001. \n \n\n\n\n
\n\n\n\n \n \n \"LocalPaper\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{Sardina01b,\n  Title                    = {Local Conditional High-Level Robot Programs},\n  Author                   = {Sardina, Sebastian},\n  Booktitle                = {Proceedings of the 8th International Conference on\n Logic for Programming, Artificial Intelligence and\n Reasoning (LPAR-01)},\n  Year                     = {2001},\n\n  Address                  = {La Habana, Cuba},\n  Month                    = {December},\n  Pages                    = {110--124},\n  Series                   = {LNAI},\n  Volume                   = {2250},\n\n  File                     = {lchlrp-ext.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/lchlrp-ext.pdf:PDF;lchlrp-ext.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/lchlrp-ext.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/lchlrp-ext.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {lchlrp-ext.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Modeling Multiagent Systems with the Cognitive Agents Specification Language — A Feature Interaction Resolution Application.\n \n \n \n \n\n\n \n Shapiro, S.; and Lespérance, Y.\n\n\n \n\n\n\n In Castelfranchi, C.; and Lespérance, Y., editor(s), Intelligent Agents Volume VII — Proceedings of the 2000 Workshop on Agent Theories, Architectures, and Languages (ATAL-00), volume 1986, of LNAI, pages 244–259. Springer-Verlag, Berlin, 2001.\n \n\n\n\n
\n\n\n\n \n \n \"ModelingPaper\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
@InCollection{shapiro01,\n  Title                    = {Modeling Multiagent Systems with the Cognitive Agents\n Specification Language --- A Feature Interaction\n Resolution Application},\n  Author                   = {Steven Shapiro and Yves Lesp\\'{e}rance},\n  Booktitle                = {Intelligent Agents Volume VII --- Proceedings of the\n 2000 Workshop on Agent Theories, Architectures, and\n Languages (ATAL-00)},\n  Publisher                = {Springer-Verlag},\n  Year                     = {2001},\n\n  Address                  = {Berlin},\n  Editor                   = {Christiano Castelfranchi and Yves Lesp\\'{e}rance},\n  Pages                    = {244--259},\n  Series                   = {LNAI},\n  Volume                   = {1986},\n\n  File                     = {atal00.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/atal00.ps:PostScript},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {atal00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Extending Answer Set Planning with Sequence, Conditional, Loop, Non-Deterministic Choice, and Procedure Constructs.\n \n \n \n \n\n\n \n Son, T.; Baral, C.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the AAAI Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 202-209, Stanford, ca, USA, March 26-28 2001. \n \n\n\n\n
\n\n\n\n \n \n \"ExtendingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{aps01,\n  Title                    = {Extending Answer Set Planning with Sequence, Conditional, Loop, Non-Deterministic Choice, and Procedure Constructs},\n  Author                   = {Son, T. and Baral, C. and McIlraith, S.},\n  Booktitle                = {Proceedings of the AAAI Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge\n Representation and Reasoning},\n  Year                     = {2001},\n\n  Address                  = {Stanford, ca, USA},\n  Month                    = {March 26-28},\n  Pages                    = {202-209},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {aps01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach.\n \n \n \n \n\n\n \n Son, T.; Baral, C.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001), pages 226-239, Vienna, Austria, September 17-19 2001. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\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{lpnmr01,\n  Title                    = {Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach},\n  Author                   = {Son, T.C. and Baral, C. and McIlraith, S.},\n  Booktitle                = {Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001)},\n  Year                     = {2001},\n\n  Address                  = {Vienna, Austria},\n  Month                    = {September 17-19},\n  Pages                    = {226-239},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {lpnmr01.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2000\n \n \n (27)\n \n \n
\n
\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 \"Partition-BasedPaper\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 Improving the Efficiency of Reasoning Through Structure-Based Reformulation.\n \n \n \n \n\n\n \n Amir, E.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Forth International Symposium on Abstraction, Reformulation and Approximation (SARA'2000), of Lecture Notes in Artificial Intelligence, pages 247-259, Horseshoe Bay, Texas, USA, July 26-29 2000. Springer-Verlag\n \n\n\n\n
\n\n\n\n \n \n \"ImprovingPaper\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{sara00,\n  Title                    = {Improving the Efficiency of Reasoning Through Structure-Based Reformulation},\n  Author                   = {Amir, E. and McIlraith, S.},\n  Booktitle                = {Proceedings of the Forth International Symposium on Abstraction, Reformulation and Approximation (SARA'2000)},\n  Year                     = {2000},\n\n  Address                  = {Horseshoe Bay, Texas, USA},\n  Month                    = {July 26-29},\n  Pages                    = {247-259},\n  Publisher                = {Springer-Verlag},\n  Series                   = {Lecture Notes in Artificial Intelligence},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {sara00.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Formulating Diagnostic Problem Solving Using an Action Language with Narratives and Sensing.\n \n \n \n \n\n\n \n Baral, C.; McIlraith, S.; and Son, T.\n\n\n \n\n\n\n In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR'2000), pages 311-322, Breckenridge, Colorado, USA, April 12-15 2000. \n \n\n\n\n
\n\n\n\n \n \n \"FormulatingPaper\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{kr00dx,\n  Title                    = {Formulating Diagnostic Problem Solving Using an Action Language with Narratives and Sensing},\n  Author                   = {Baral, C. and McIlraith, S. and Son, T. },\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                    = {311-322},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {kr00dx.pdf}\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 \"ApproximatelyPaper\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 \"StochasticPaper\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 \"Decision-Theoretic,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 \"Decision-Theoretic,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 \"ConGolog,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 \"OpenPaper\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 \"Non-MarkovianPaper\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 \"cc-Golog: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 \"TurningPaper\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 \"AnPaper\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 \"SolvingPaper\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 \"AbilityPaper\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 \"IntegratingPaper\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 \"LeGolog: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 \"DiagnosingPaper\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 \"ModelingPaper\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 Integrating Actions and State Constraints: A Closed-Form Solution to the Ramification Problem (Sometimes).\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n Artificial Intelligence, 116(1-2): 87-121. January 2000.\n \n\n\n\n
\n\n\n\n \n \n \"IntegratingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{ramification,\n  Title                    = {Integrating Actions and State Constraints: A Closed-Form \n Solution to the Ramification Problem (Sometimes)},\n  Author                   = {McIlraith, S.},\n  Journal                  = {Artificial Intelligence},\n  Year                     = {2000},\n\n  Month                    = {January},\n  Number                   = {1-2},\n  Pages                    = {87-121},\n  Volume                   = {116},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {aij2000.pdf}\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 \"HybridPaper\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 What Sensing Tells Us: Towards a Formal Theory of Testing for Dynamical Systems.\n \n \n \n \n\n\n \n McIlraith, S.; and Scherl, R.\n\n\n \n\n\n\n In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI'2000), pages 483-490, Austin, Texas, USA, July 30 - August 3 2000. \n \n\n\n\n
\n\n\n\n \n \n \"WhatPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{aaai00,\n  Title                    = {What Sensing Tells Us: Towards a Formal Theory of Testing for Dynamical Systems},\n  Author                   = {McIlraith, S. and Scherl, R.},\n  Booktitle                = {Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI'2000)},\n  Year                     = {2000},\n\n  Address                  = {Austin, Texas, USA},\n  Month                    = {July 30 - August 3},\n  Pages                    = {483-490},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {aaai00.pdf}\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 \"Value-DirectedPaper\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 \"NarrativesPaper\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 \"IteratedPaper\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 \"AnPaper\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 \"APRICODD: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
\n
\n\n
\n
\n  \n 1999\n \n \n (24)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Reasoning about Noisy Sensors and Effectors in the Situation Calculus.\n \n \n \n \n\n\n \n Bacchus, F.; Halpern, J. Y.; and Levesque, H. J.\n\n\n \n\n\n\n Artif. Intell., 111(1-2): 171-208. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"ReasoningLink\n  \n \n \n \"ReasoningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{DBLP:journals/ai/BacchusHL99,\n  Title                    = {Reasoning about Noisy Sensors and Effectors in the Situation Calculus},\n  Author                   = {Fahiem Bacchus and Joseph Y. Halpern and Hector J. Levesque},\n  Journal                  = {Artif. Intell.},\n  Year                     = {1999},\n  Number                   = {1-2},\n  Pages                    = {171-208},\n  Volume                   = {111},\n\n  Bibsource                = {DBLP http://dblp.uni-trier.de},\n  Ee                       = {http://dx.doi.org/10.1016/S0004-3702(99)00031-4},\n  Timestamp                = {2018.09.23},\n  Url                      = {BHLNoise.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Extending ConGolog to Allow Partial Ordering.\n \n \n \n \n\n\n \n Baral, C.; and Cao Son, T.\n\n\n \n\n\n\n In Proceedings of ATAL-99, pages 188–204, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"ExtendingPaper\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\n
\n
@InProceedings{Baral99,\n  Title                    = {Extending {C}on{G}olog to Allow Partial Ordering},\n  Author                   = {Baral, Chitta and Cao Son, Tran},\n  Booktitle                = {Proceedings of ATAL-99},\n  Year                     = {1999},\n  Pages                    = {188--204},\n\n  Key                      = {CogRobo2},\n  Keywords                 = {Golog},\n  Optnote                  = { \\\\ {\\sf Extends ConGolog with a new $htn$-construct\n to express plans with partial ordering. The idea is to\n incoporate the advantages of hierarchical task networks\n (HTN) into the ConGolog high-level language. }},\n  Timestamp                = {2018.09.23},\n  Url                      = {Baral99.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sequential Optimality and Coordination in Multiagent Systems.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In ijcai99, pages 478–485, Stockholm, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"SequentialPaper\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{Boutilier-coord:ijcai99,\n  Title                    = {Sequential Optimality and Coordination in Multiagent\n Systems},\n  Author                   = {Craig Boutilier},\n  Booktitle                = ijcai99,\n  Year                     = {1999},\n\n  Address                  = {Stockholm},\n  Pages                    = {478--485},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {seqCoord.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasoning with Conditional Ceteris Paribus Preference Statements.\n \n \n \n \n\n\n \n Boutilier, C.; Brafman, R. I.; Hoos, H. H.; and Poole, D.\n\n\n \n\n\n\n In uai99, pages 71–80, Stockholm, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\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{BBHP:uai99,\n  Title                    = {Reasoning with Conditional Ceteris Paribus Preference\n Statements},\n  Author                   = {Craig Boutilier and Ronen I. Brafman and\n Holger H. Hoos and David Poole},\n  Booktitle                = uai99,\n  Year                     = {1999},\n\n  Address                  = {Stockholm},\n  Pages                    = {71--80},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {CPnets.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decision Theoretic Planning: Structural Assumptions and Computational Leverage.\n \n \n \n \n\n\n \n Boutilier, C.; Dean, T.; and Hanks, S.\n\n\n \n\n\n\n Journal of Artificial Intelligence Research, 11: 1–94. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"DecisionPaper\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{MDPsurvey:JAIR99,\n  Title                    = {Decision Theoretic Planning:\n Structural Assumptions and Computational Leverage},\n  Author                   = {Craig Boutilier and Thomas Dean and Steve Hanks},\n  Journal                  = {Journal of Artificial Intelligence Research},\n  Year                     = {1999},\n  Pages                    = {1--94},\n  Volume                   = {11},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {mdp_survey-abs.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sequential Auctions for Allocation of Resources with Complementarities.\n \n \n \n \n\n\n \n Boutilier, C.; Goldszmidt, M.; and Sabata, B.\n\n\n \n\n\n\n In ijcai99, pages 527–534, Stockholm, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"SequentialPaper\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{BGS:ijcai99,\n  Title                    = {Sequential Auctions for Allocation of Resources with\n Complementarities},\n  Author                   = {Craig Boutilier and Mois\\'{e}s Goldszmidt and Bikash Sabata},\n  Booktitle                = ijcai99,\n  Year                     = {1999},\n\n  Address                  = {Stockholm},\n  Pages                    = {527--534},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {auctions.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Continuous Value Function Approximation for Sequential Bidding Policies.\n \n \n \n \n\n\n \n Boutilier, C.; Goldszmidt, M.; and Sabata, B.\n\n\n \n\n\n\n In uai99, pages 81–90, Stockholm, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"ContinuousPaper\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{BGS:uai99,\n  Title                    = {Continuous Value Function Approximation for Sequential\n Bidding Policies},\n  Author                   = {Craig Boutilier and Mois\\'{e}s Goldszmidt and Bikash Sabata},\n  Booktitle                = uai99,\n  Year                     = {1999},\n\n  Address                  = {Stockholm},\n  Pages                    = {81--90},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {contaucts.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Recursion.\n \n \n \n \n\n\n \n Brecht, T.; McIlraith, S.; and Pitassi, T.\n\n\n \n\n\n\n Volume 18 . Wiley Encyclopedia of Electrical and Electronics Engineering, pages 314-315. Webster, J. G., editor(s). Wiley Publishing, 1999.\n \n\n\n\n
\n\n\n\n \n \n \"WileyPaper\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
@InBook{recursion,\n  Title                    = {Wiley Encyclopedia of Electrical and Electronics Engineering},\n  Author                   = {Brecht, T. and McIlraith, S. and Pitassi, T.},\n  Chapter                  = {Recursion},\n  Editor                   = {John G. Webster},\n  Pages                    = {314-315},\n  Publisher                = {Wiley Publishing},\n  Year                     = {1999},\n  Volume                   = {18},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {recursion.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Projection using Regression and Sensors.\n \n \n \n \n\n\n \n De Giacomo, G.; and Levesque, H.\n\n\n \n\n\n\n In Proceedingsof the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pages 160–165, Stockholm, Sweden, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"ProjectionPaper\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{Giuseppe99-GAT,\n  Title                    = {Projection using Regression and Sensors},\n  Author                   = {De Giacomo, Giuseppe and Levesque, Hector},\n  Booktitle                = {Proceedingsof the Sixteenth International Joint\n Conference on Artificial Intelligence (IJCAI-99)},\n  Year                     = {1999},\n\n  Address                  = {Stockholm, Sweden},\n  Pages                    = {160--165},\n\n  File                     = {projection.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/projection.pdf:PDF;projection.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/projection.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/projection.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {projection.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Incremental Interpreter for High-Level Programs with Sensing.\n \n \n \n \n\n\n \n De Giacomo, G.; and Levesque, H.\n\n\n \n\n\n\n In Levesque, H. J.; and Pirri, F., editor(s), Logical foundation for cognitive agents: contributions in honor of Ray Reiter, pages 86–102. Springer, Berlin, 1999.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\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
@InCollection{Giuseppe99-IncremInt,\n  Title                    = {An Incremental Interpreter for High-Level Programs\n with Sensing},\n  Author                   = {De Giacomo, Giuseppe and Levesque, Hector},\n  Booktitle                = {Logical foundation for cognitive agents: contributions\n in honor of {R}ay {R}eiter},\n  Publisher                = {Springer},\n  Year                     = {1999},\n\n  Address                  = {Berlin},\n  Editor                   = {Hector J. Levesque and Fiora Pirri},\n  Pages                    = {86--102},\n\n  File                     = {DeLe99ray.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/DeLe99ray.pdf:PDF;DeLe99ray.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/DeLe99ray.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/DeLe99ray.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {DeLe99ray.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Representing Knowledge within the Situation Calculus using Interval-valued Epitemic Fluents.\n \n \n \n \n\n\n \n Funge, J.\n\n\n \n\n\n\n Journal of Reliable Computing, 5(1). 1999.\n \n\n\n\n
\n\n\n\n \n \n \"RepresentingPaper\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
@Article{Funge99,\n  Title                    = {Representing Knowledge within the Situation Calculus\n using Interval-valued Epitemic Fluents},\n  Author                   = {Funge, John},\n  Journal                  = {Journal of Reliable Computing},\n  Year                     = {1999},\n  Number                   = {1},\n  Volume                   = {5},\n\n  File                     = {reliable99.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/reliable99.pdf:PDF;reliable99.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/reliable99.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/reliable99.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {reliable99.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SPUDD: Stochastic Planning using Decision Diagrams.\n \n \n \n \n\n\n \n Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C.\n\n\n \n\n\n\n In uai99, pages 279–288, Stockholm, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"SPUDD: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{SPUDD:uai99,\n  Title                    = {{SPUDD}: Stochastic Planning using Decision Diagrams},\n  Author                   = {Jesse Hoey and Robert St-Aubin and Alan Hu and Craig Boutilier},\n  Booktitle                = uai99,\n  Year                     = {1999},\n\n  Address                  = {Stockholm},\n  Pages                    = {279--288},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {spudd.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Sensing and Off-Line Interpreting in Golog.\n \n \n \n \n\n\n \n Lakemeyer, G.\n\n\n \n\n\n\n In Levesque, H.; and Pirri, F., editor(s), Logical Foundations for Cognitive Agents, Contributions in Honor of Ray Reiter, pages 173–187. Springer, Berlin, 1999.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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\n
\n
@InCollection{Lakemeyer99-sGolog,\n  Title                    = {On Sensing and Off-Line Interpreting in {G}olog},\n  Author                   = {Lakemeyer, Gerhard},\n  Booktitle                = {Logical Foundations for Cognitive Agents,\n Contributions in Honor of Ray Reiter},\n  Publisher                = {Springer},\n  Year                     = {1999},\n\n  Address                  = {Berlin},\n  Editor                   = {Levesque, H. and Pirri, F.},\n  Pages                    = {173--187},\n\n  Key                      = {CogRobo},\n  Keywords                 = {Golog},\n  Timestamp                = {2018.09.23},\n  Url                      = {Lakemeyer99-sGolog.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Query evaluation and progression in AOL knowledge bases.\n \n \n \n \n\n\n \n Lakemeyer, G.; and Levesque, H.\n\n\n \n\n\n\n In Proc. IJCAI-99, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"QueryPaper\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{Lakemeyer99,\n  Title                    = {Query evaluation and progression in AOL knowledge\n bases},\n  Author                   = {Lakemeyer, G. and Levesque, H.},\n  Booktitle                = {Proc. IJCAI-99},\n  Year                     = {1999},\n\n  File                     = {query.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/query.pdf:PDF;query.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/query.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/query.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {query.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Modeling Dynamic Domains with ConGolog.\n \n \n \n \n\n\n \n Lespérance, Y.; Kelly, T. G.; Mylopoulos, J.; and Yu, E. S.\n\n\n \n\n\n\n In Proceedings of CAiSE-99, Heidelberg, Germany, June 1999. \n \n\n\n\n
\n\n\n\n \n \n \"ModelingPaper\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{Lesperance99b,\n  Title                    = {Modeling Dynamic Domains with {C}on{G}olog},\n  Author                   = {Lesp\\'erance, Yves and Kelly, Todd G. and Mylopoulos,\n John and Yu, Eric S.K.},\n  Booktitle                = {Proceedings of CAiSE-99},\n  Year                     = {1999},\n\n  Address                  = {Heidelberg, Germany},\n  Month                    = {June},\n\n  File                     = {bpr99.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/bpr99.pdf:PDF;bpr99.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/bpr99.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/bpr99.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {bpr99.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Situation Calculus Approach to Modeling and Programming Agents.\n \n \n \n \n\n\n \n Lespérance, Y.; Levesque, H. J.; and Reiter, R.\n\n\n \n\n\n\n In A., R.; and Wooldridge, M., editor(s), Foundations and Theories of Rational Agency. Kluwer, 1999.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\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
@InCollection{Lesperance99a,\n  Title                    = {A Situation Calculus Approach to Modeling and\n Programming Agents},\n  Author                   = {Lesp\\'erance, Y. and Levesque, H. J. and Reiter, R.},\n  Booktitle                = {Foundations and Theories of Rational Agency},\n  Publisher                = {Kluwer},\n  Year                     = {1999},\n  Editor                   = {Rao A. and Wooldridge, M.},\n\n  File                     = {FTRA.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/FTRA.pdf:PDF;FTRA.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/FTRA.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/FTRA.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {FTRA.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Model-Based Programming using Golog and the Situation Calculus.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Tenth International Workshop on Principles of Diagnosis (DX'99), pages 184-192, Loch Awe Hotel, Scotland, UK, June 8-11 1999. \n \n\n\n\n
\n\n\n\n \n \n \"Model-BasedPaper\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{golog-dx99,\n  Title                    = {Model-Based Programming using Golog and the Situation Calculus},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Tenth International Workshop on Principles of Diagnosis (DX'99)},\n  Year                     = {1999},\n\n  Address                  = {Loch Awe Hotel, Scotland, UK},\n  Month                    = {June 8-11},\n  Pages                    = {184-192},\n\n  Keywords                 = {Golog},\n  Timestamp                = {2018.09.23},\n  Url                      = {dx99MBP.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Explanatory Diagnosis: Conjecturing Actions to Explain Observations.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n Logical Foundations for Cognitive Agents: Papers in Honour of Ray Reiter, pages 155-172. Levesque, H.; and Pirri, F., editor(s). Springer-Verlag, 1999.\n \n\n\n\n
\n\n\n\n \n \n \"LogicalPaper\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
@InBook{Ray99,\n  Title                    = {Logical Foundations for Cognitive Agents: Papers in Honour of Ray Reiter},\n  Author                   = {McIlraith, S.},\n  Chapter                  = {Explanatory Diagnosis: Conjecturing Actions to Explain Observations},\n  Editor                   = {Levesque, H. and Pirri, F.},\n  Pages                    = {155-172},\n  Publisher                = {Springer-Verlag},\n  Year                     = {1999},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {Ray99.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards Diagnosing Hybrid Systems.\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 Hybrid Systems and AI: Modeling, Analysis and Control of Discrete + Continuous Systems, AAAI 1999 Spring Symposium on Hybrid Systems and AI, AAAI Technical Report SS-99-05, pages 128–135. Stanford, CA, USA, March 1999.\n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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
@InCollection{hybrid-aaaiss98,\n  Title                    = {Towards Diagnosing Hybrid Systems},\n  Author                   = {McIlraith, S. and Biswas, G. and Clancy, D. and Gupta, V.},\n  Booktitle                = {Hybrid Systems and AI: Modeling, Analysis and Control of Discrete + Continuous Systems, AAAI 1999 Spring Symposium on Hybrid Systems and AI, AAAI Technical Report SS-99-05},\n  Year                     = {1999},\n\n  Address                  = {Stanford, CA, USA},\n  Month                    = {March},\n  Pages                    = {128--135},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {hybrid-aaaiss99.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards Diagnosing Hybrid Systems.\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 Tenth International Workshop on Principles of Diagnosis (DX'99), pages 193-202, Loch Awe Hotel, Scotland, UK, June 8-11 1999. \n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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{hybrid-dx99,\n  Title                    = {Towards Diagnosing Hybrid Systems},\n  Author                   = {McIlraith, S. and Biswas, G. and Clancy, D. and Gupta, V.},\n  Booktitle                = {Proceedings of the Tenth International Workshop on Principles of Diagnosis (DX'99)},\n  Year                     = {1999},\n\n  Address                  = {Loch Awe Hotel, Scotland, UK},\n  Month                    = {June 8-11},\n  Pages                    = {193-202},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {dx99HS.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Some Contributions to the Metatheory of the Situation Calculus.\n \n \n \n \n\n\n \n Pirri, F.; and Reiter, R.\n\n\n \n\n\n\n Journal of the ACM, 46(3): 261–325. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"SomePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Pirri99-ContSitCalc,\n  Title                    = {Some Contributions to the Metatheory of the Situation\n Calculus},\n  Author                   = {Pirri, Fiora and Reiter, Ray},\n  Journal                  = {Journal of the ACM},\n  Year                     = {1999},\n  Number                   = {3},\n  Pages                    = {261--325},\n  Volume                   = {46},\n\n  File                     = {metatheory.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/metatheory.pdf:PDF;metatheory.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/metatheory.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/metatheory.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {metatheory.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computability.\n \n \n \n \n\n\n \n Pitassi, T.; McIlraith, S.; and Brecht, T.\n\n\n \n\n\n\n Volume 3 . Wiley Encyclopedia of Electrical and Electronics Engineering, pages 612-618. Webster, J. G., editor(s). Wiley Publishing, 1999.\n \n\n\n\n
\n\n\n\n \n \n \"WileyPaper\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
@InBook{computability,\n  Title                    = {Wiley Encyclopedia of Electrical and Electronics Engineering},\n  Author                   = {Pitassi, T. and McIlraith, S. and Brecht, T.},\n  Chapter                  = {Computability},\n  Editor                   = {John G. Webster},\n  Pages                    = {612-618},\n  Publisher                = {Wiley Publishing},\n  Year                     = {1999},\n  Volume                   = {3},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {computability.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Implicit Imitation in Reinforcement Learning.\n \n \n \n \n\n\n \n Price, B.; and Boutilier, C.\n\n\n \n\n\n\n In ml99, pages 325–334, Bled, Slovenia, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"ImplicitPaper\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{PriceBoutilier:icml99,\n  Title                    = {Implicit Imitation in Reinforcement Learning},\n  Author                   = {Bob Price and Craig Boutilier},\n  Booktitle                = ml99,\n  Year                     = {1999},\n\n  Address                  = {Bled, Slovenia},\n  Pages                    = {325--334},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {imitation.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automata heory for reasoning about action.\n \n \n \n \n\n\n \n Ternovskaia, E.\n\n\n \n\n\n\n In Proc. IJCAI-99, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"AutomataPaper\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{Ternovskaia99,\n  Title                    = {Automata heory for reasoning about action},\n  Author                   = {Ternovskaia, E.},\n  Booktitle                = {Proc. IJCAI-99},\n  Year                     = {1999},\n\n  File                     = {dec.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/dec.pdf:PDF;dec.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/dec.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/dec.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {dec.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1998\n \n \n (23)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Unified Model of Qualitative Belief Change: A Dynamical Systems Perspective.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n aij, 98(1–2): 281–316. 1998.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\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
@Article{Boutilier:AIJ98,\n  Title                    = {A Unified Model of Qualitative Belief Change: A Dynamical Systems\nPerspective},\n  Author                   = {Craig Boutilier},\n  Journal                  = aij,\n  Year                     = {1998},\n  Number                   = {1--2},\n  Pages                    = {281--316},\n  Volume                   = {98},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {belchange.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Structured Reachability Analysis for Markov Decision Processes.\n \n \n \n \n\n\n \n Boutilier, C.; Brafman, R. I.; and Geib, C.\n\n\n \n\n\n\n In uai98, pages 24–32, Madison, WI, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"StructuredPaper\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{BBG:uai98,\n  Title                    = {Structured Reachability Analysis for {Markov} Decision Processes},\n  Author                   = {Craig Boutilier and Ronen I. Brafman and Christopher Geib},\n  Booktitle                = uai98,\n  Year                     = {1998},\n\n  Address                  = {Madison, WI},\n  Pages                    = {24--32},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {reachability.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Belief Revision with Unreliable Observations.\n \n \n \n \n\n\n \n Boutilier, C.; Friedman, N.; and Halpern, J. Y.\n\n\n \n\n\n\n In aaai98, pages 127–134, Madison, WI, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"BeliefPaper\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{BFH:aaai98,\n  Title                    = {Belief Revision with Unreliable Observations},\n  Author                   = {Craig Boutilier and Nir Friedman and Joseph Y. Halpern},\n  Booktitle                = aaai98,\n  Year                     = {1998},\n\n  Address                  = {Madison, WI},\n  Pages                    = {127--134},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {noisy.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n LPSP: A Linear Plan-level Stochastic Planner.\n \n \n \n \n\n\n \n Brafman, R. I.; Hoos, H. H.; and Boutilier, C.\n\n\n \n\n\n\n In 17th Workshop of the UK Planning and Scheduling Special Interest Group, West York, UK, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"LPSP: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{lpsp:ukplan98,\n  Title                    = {{LPSP}: A Linear Plan-level Stochastic Planner},\n  Author                   = {Ronen I. Brafman and Holger H. Hoos and Craig Boutilier},\n  Booktitle                = {17th Workshop of the UK Planning and Scheduling Special \n Interest Group},\n  Year                     = {1998},\n\n  Address                  = {West York, UK},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {lpsp.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preliminary Thoughts on a Practical Theory of Reformulation for Reasoning about Physical Systems.\n \n \n \n \n\n\n \n Choueiry, B.; McIlraith, S.; Iwasaki, Y.; Loeser, T.; Neller, T.; Engelmore, B.; and Fikes., R.\n\n\n \n\n\n\n In Proceedings of the Twelfth International Workshop on Qualitative Reasoning (QR'98), pages 21-31, Cape Cod, Massachusetts, USA, May 26-29 1998. \n \n\n\n\n
\n\n\n\n \n \n \"PreliminaryPaper\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{qr98,\n  Title                    = {Preliminary Thoughts on a Practical Theory of Reformulation for Reasoning about Physical Systems},\n  Author                   = {Choueiry, B. and McIlraith, S. and Iwasaki, Y. and Loeser, T. and Neller, T. and Engelmore, B. and Fikes., R.},\n  Booktitle                = {Proceedings of the Twelfth International Workshop on Qualitative Reasoning (QR'98)},\n  Year                     = {1998},\n\n  Address                  = {Cape Cod, Massachusetts, USA},\n  Month                    = {May 26-29},\n  Pages                    = {21-31},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {qr98.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Thoughts on a Practical Theory of Reformulation for Reasoning about Physical Systems.\n \n \n \n \n\n\n \n Choueiry, B.; McIlraith, S.; Iwasaki, Y.; Loeser, T.; Neller, T.; Engelmore, B.; and Fikes., R.\n\n\n \n\n\n\n In Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA-98), pages 25-36, May 1998. \n \n\n\n\n
\n\n\n\n \n \n \"ThoughtsPaper\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{sara98,\n  Title                    = {Thoughts on a Practical Theory of Reformulation for Reasoning about Physical Systems},\n  Author                   = {Choueiry, B. and McIlraith, S. and Iwasaki, Y. and Loeser, T. and Neller, T. and Engelmore, B. and Fikes., R.},\n  Booktitle                = {Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA-98)},\n  Year                     = {1998},\n  Month                    = {May},\n  Pages                    = {25-36},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {sara98.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Dynamics of Reinforcement Learning in Cooperative Multiagent Systems.\n \n \n \n \n\n\n \n Claus, C.; and Boutilier, C.\n\n\n \n\n\n\n In aaai98, pages 746–752, Madison, WI, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{ClausBoutilier:aaai98,\n  Title                    = {The Dynamics of Reinforcement Learning in Cooperative Multiagent\n Systems},\n  Author                   = {Caroline Claus and Craig Boutilier},\n  Booktitle                = aaai98,\n  Year                     = {1998},\n\n  Address                  = {Madison, WI},\n  Pages                    = {746--752},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {multirl2.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An incremental interpreter for high-level programs with sensing.\n \n \n \n \n\n\n \n De Giacomo, G.; and Levesque, H. J.\n\n\n \n\n\n\n Technical Report Department of Computer Science, University of Toronto, Toronto, Canada, 1998.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\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
@TechReport{DeGiacomo98,\n  Title                    = {An incremental interpreter for high-level programs\n with sensing},\n  Author                   = {De Giacomo, G. and Levesque, H. J.},\n  Institution              = {Department of Computer Science, University of Toronto},\n  Year                     = {1998},\n\n  Address                  = {Toronto, Canada},\n\n  File                     = {incr-exe.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/incr-exe.pdf:PDF;incr-exe.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/incr-exe.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/incr-exe.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {incr-exe.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Execution Monitoring of High-Level Robot Programs.\n \n \n \n \n\n\n \n De Giacomo, G.; Reiter, R.; and Soutchanski, M.\n\n\n \n\n\n\n In Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 453–465, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"ExecutionPaper\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{Giuseppe98-Monitoring,\n  Title                    = {Execution Monitoring of High-Level Robot Programs},\n  Author                   = {De Giacomo, Giuseppe and Reiter, Ray and Soutchanski,\n Mikhail},\n  Booktitle                = {Proceedings of the 6th International Conference on\n Principles of Knowledge Representation and Reasoning\n (KR'98)},\n  Year                     = {1998},\n  Pages                    = {453--465},\n\n  File                     = {monitoring.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/monitoring.pdf:PDF;monitoring.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/monitoring.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/monitoring.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {monitoring.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Interval-valued Epistemic (IVE) Fluents.\n \n \n \n \n\n\n \n Funge, J.\n\n\n \n\n\n\n In AIII Fall Symposium on Cognitive Robotics, pages 44–51, Orlando, FL., October 1998. \n \n\n\n\n
\n\n\n\n \n \n \"Interval-valuedPaper\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{Funge98,\n  Title                    = {Interval-valued Epistemic ({IVE}) Fluents},\n  Author                   = {Funge, John},\n  Booktitle                = {AIII Fall Symposium on Cognitive Robotics},\n  Year                     = {1998},\n\n  Address                  = {Orlando, FL.},\n  Month                    = {October},\n  Pages                    = {44--51},\n\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {Funge98.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Making Them Behave: Cognitive Models for Computer Animation.\n \n \n \n \n\n\n \n Funge, J.\n\n\n \n\n\n\n Ph.D. Thesis, University of Toronto, Toronto, Canada, 1998.\n \n\n\n\n
\n\n\n\n \n \n \"MakingPaper\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
@PhdThesis{Funge98-Phd,\n  Title                    = {Making Them Behave: Cognitive Models for Computer\n Animation},\n  Author                   = {Funge, John},\n  School                   = {University of Toronto},\n  Year                     = {1998},\n\n  Address                  = {Toronto, Canada},\n\n  File                     = {fungeSc.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/fungeSc.pdf:PDF},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {fungeSc.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Hierarchical Solution of Markov Decision Processes using Macro-actions.\n \n \n \n \n\n\n \n Hauskrecht, M.; Meuleau, N.; Kaelbling, L. P.; Dean, T.; and Boutilier, C.\n\n\n \n\n\n\n In uai98, pages 220–229, Madison, WI, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"HierarchicalPaper\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{HMKDB:uai98,\n  Title                    = {Hierarchical Solution of {Markov} Decision Processes using\n Macro-actions},\n  Author                   = {Milos Hauskrecht and Nicolas Meuleau and Leslie Pack\n Kaelbling and Thomas Dean and Craig Boutilier},\n  Booktitle                = uai98,\n  Year                     = {1998},\n\n  Address                  = {Madison, WI},\n  Pages                    = {220--229},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {macros.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n AOL: A logic of acting, sensing, knowing, and only knowing.\n \n \n \n \n\n\n \n Lakemeyer, G.; and Levesque, H. J.\n\n\n \n\n\n\n In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR'98), pages 316–327, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"AOL: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{Lakemeyer98,\n  Title                    = {{AOL}: {A} logic of acting, sensing, knowing, and only\n knowing},\n  Author                   = {Lakemeyer, G. and Levesque, H. J.},\n  Booktitle                = {Principles of Knowledge Representation and Reasoning:\n Proceedings of the Sixth International Conference\n (KR'98)},\n  Year                     = {1998},\n  Pages                    = {316--327},\n\n  File                     = {aol-kr98.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/aol-kr98.pdf:PDF;aol-kr98.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/aol-kr98.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/aol-kr98.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {aol-kr98.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reactivity in a Logic-Based Robot Programming Framework.\n \n \n \n \n\n\n \n Lespérance, Y.; Tam, K.; and Jenkin, M.\n\n\n \n\n\n\n In Cognitive Robotics - Papers from the 1998 AAAI Fall Symposium, pages 98–105, Orlando, FL., October 1998. AAAII Press\n \n\n\n\n
\n\n\n\n \n \n \"ReactivityPaper\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{Lesperance98-Reactivity,\n  Title                    = {Reactivity in a Logic-Based Robot Programming\n Framework},\n  Author                   = {Lesp\\'erance, Y. and Tam, K. and Jenkin, M.},\n  Booktitle                = {Cognitive Robotics - Papers from the 1998 AAAI Fall\n Symposium},\n  Year                     = {1998},\n\n  Address                  = {Orlando, FL.},\n  Month                    = {October},\n  Pages                    = {98--105},\n  Publisher                = {AAAII Press},\n\n  File                     = {ATAL99.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/ATAL99.pdf:PDF},\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {ATAL99.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Foundations for a Calculus of Situations.\n \n \n \n \n\n\n \n Levesque, H.; Pirri, F.; and Reiter, R.\n\n\n \n\n\n\n Electronic Transactions of AI (ETAI), 2(3–4): 159–178. 1998.\n \n\n\n\n
\n\n\n\n \n \n \"FoundationsPaper\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
@Article{Levesque98,\n  Title                    = {Foundations for a Calculus of Situations},\n  Author                   = {Levesque, Hector and Pirri, Fiora and Reiter, Ray},\n  Journal                  = {Electronic Transactions of AI (ETAI)},\n  Year                     = {1998},\n  Number                   = {3--4},\n  Pages                    = {159--178},\n  Volume                   = {2},\n\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {Levesque98.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n High-level Robotic Control: Beyond Planning. A Position Paper.\n \n \n \n \n\n\n \n Levesque, H.; and Reiter, R.\n\n\n \n\n\n\n In AIII 1998 Spring Symposium: Integrating Robotics Research: Taking the Next Big Leap, March 1998. \n \n\n\n\n
\n\n\n\n \n \n \"High-levelPaper\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{Levesque98-HighLevel,\n  Title                    = {High-level Robotic Control: Beyond Planning. A\n Position Paper.},\n  Author                   = {Levesque, Hector and Reiter, Ray},\n  Booktitle                = {AIII 1998 Spring Symposium: Integrating Robotics\n Research: Taking the Next Big Leap},\n  Year                     = {1998},\n  Month                    = {March},\n\n  File                     = {aaaisymp98.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/aaaisymp98.pdf:PDF;aaaisymp98.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/aaaisymp98.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/aaaisymp98.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {aaaisymp98.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n What Robots Can Do: Robot Programs and Effective Achievability.\n \n \n \n \n\n\n \n Lin, F.; and Levesque, H. J.\n\n\n \n\n\n\n Artificial Intelligence, 101: 201–226. 1998.\n \n\n\n\n
\n\n\n\n \n \n \"WhatPaper\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
@Article{Lin98-WhatRobotsDo,\n  Title                    = {What Robots Can Do: {R}obot Programs and Effective\n Achievability},\n  Author                   = {Lin, Fangzhen and Levesque, Hector J.},\n  Journal                  = {Artificial Intelligence},\n  Year                     = {1998},\n  Pages                    = {201--226},\n  Volume                   = {101},\n\n  File                     = {aij-robots.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/aij-robots.pdf:PDF;aij-robots.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/aij-robots.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/aij-robots.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {aij-robots.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Logic-Based Abductive Inference.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n Technical Report KSL-98-19, Knowledge Systems Laboratory, July 1998.\n \n\n\n\n
\n\n\n\n \n \n \"Logic-BasedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{abduction,\n  Title                    = {Logic-Based Abductive Inference},\n  Author                   = {McIlraith, S. },\n  Institution              = {Knowledge Systems Laboratory},\n  Year                     = {1998},\n  Month                    = {July},\n  Number                   = {KSL-98-19},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {abduction.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards Exploiting Generic Procedures in Model-Based Reasoning [Poster].\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Ninth International Workshop on Principles of Diagnosis (DX'98), pages 217-224, Sea Crest Resort, Cape Cod, Massachusetts, USA, May 24-27 1998. \n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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{dx98,\n  Title                    = {Towards Exploiting Generic Procedures in Model-Based Reasoning [Poster]},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Ninth International Workshop on Principles of Diagnosis (DX'98)},\n  Year                     = {1998},\n\n  Address                  = {Sea Crest Resort, Cape Cod, Massachusetts, USA},\n  Month                    = {May 24-27},\n  Pages                    = {217-224},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {dx98.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Explanatory Diagnosis: Conjecturing Actions to Explain Observations.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 167-179, Trento, Italy, June 2-5 1998. \n \n\n\n\n
\n\n\n\n \n \n \"ExplanatoryPaper\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{KR98,\n  Title                    = {Explanatory Diagnosis: Conjecturing Actions to Explain Observations},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98)},\n  Year                     = {1998},\n\n  Address                  = {Trento, Italy},\n  Month                    = {June 2-5},\n  Pages                    = {167-179},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {KR98.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Solving Very Large Weakly Coupled Markov Decision Processes.\n \n \n \n \n\n\n \n Meuleau, N.; Hauskrecht, M.; Kim, K.; Peshkin, L.; Kaelbling, L. P.; Dean, T.; and Boutilier, C.\n\n\n \n\n\n\n In aaai98, pages 165–172, Madison, WI, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"SolvingPaper\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{MHKPKDB:aaai98,\n  Title                    = {Solving Very Large Weakly Coupled {Markov} Decision Processes},\n  Author                   = {Nicolas Meuleau and Milos Hauskrecht and Kee-Eung Kim and\n Leonid Peshkin and Leslie Pack Kaelbling and Thomas Dean\n and Craig Boutilier},\n  Booktitle                = aaai98,\n  Year                     = {1998},\n\n  Address                  = {Madison, WI},\n  Pages                    = {165--172},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {merging.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Occurrences and narratives as constraints in the branching structure of the situation calculus.\n \n \n \n \n\n\n \n Pinto, J.\n\n\n \n\n\n\n Journal of Logic and Computation, 8: 777–808. 1998.\n \n\n\n\n
\n\n\n\n \n \n \"OccurrencesPaper\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
@Article{Pinto98,\n  Title                    = {Occurrences and narratives as constraints in the\n branching structure of the situation calculus},\n  Author                   = {Pinto, Javier},\n  Journal                  = {Journal of Logic and Computation},\n  Year                     = {1998},\n  Pages                    = {777--808},\n  Volume                   = {8},\n\n  File                     = {occurrence.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/occurrence.pdf:PDF;occurrence.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/occurrence.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/occurrence.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {occurrence.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sequential, Temporal GOLOG.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR'98), pages 547–556, Trento, Italy, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"Sequential,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\n
\n
@InProceedings{Reiter98,\n  Title                    = {Sequential, Temporal GOLOG},\n  Author                   = {Reiter, Ray},\n  Booktitle                = {Principles of Knowledge Representation and Reasoning:\n Proceedings of the Sixth International Conference\n (KR'98)},\n  Year                     = {1998},\n\n  Address                  = {Trento, Italy},\n  Pages                    = {547--556},\n\n  File                     = {reiterkr98.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/reiterkr98.pdf:PDF;reiterkr98.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/reiterkr98.ps:PostScript},\n  Key                      = {CogRobo},\n  Keywords                 = {Golog},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/reiterkr98.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {reiterkr98.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1997\n \n \n (24)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Structured Solution Methods for Non-Markovian Decision Processes.\n \n \n \n \n\n\n \n Bacchus, F.; Boutilier, C.; and Grove, A.\n\n\n \n\n\n\n In aaai97, pages 112–117, Providence, RI, 1997. \n \n\n\n\n
\n\n\n\n \n \n \"StructuredPaper\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{BBG:aaai97,\n  Title                    = {Structured Solution Methods for Non-{Markovian} Decision\n Processes},\n  Author                   = {Fahiem Bacchus and Craig Boutilier and Adam Grove},\n  Booktitle                = aaai97,\n  Year                     = {1997},\n\n  Address                  = {Providence, RI},\n  Pages                    = {112--117},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {nmdps.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Correlated Action Effects in Decision Theoretic Regression.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In uai97, pages 30–37, Providence, RI, 1997. \n \n\n\n\n
\n\n\n\n \n \n \"CorrelatedPaper\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{Boutilier-corr:uai97,\n  Title                    = {Correlated Action Effects in Decision Theoretic Regression},\n  Author                   = {Craig Boutilier},\n  Booktitle                = uai97,\n  Year                     = {1997},\n\n  Address                  = {Providence, RI},\n  Pages                    = {30--37},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {uai97b.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Constraint-Based Approach to Preference Elicitation and Decision Making.\n \n \n \n \n\n\n \n Boutilier, C.; Brafman, R.; Geib, C.; and Poole, D.\n\n\n \n\n\n\n In AAAI Spring Symposium on Qualitative Decision Theory, Stanford, 1997. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{BBGP:spring97,\n  Title                    = {A Constraint-Based Approach to Preference Elicitation and Decision\n Making},\n  Author                   = {Craig Boutilier and Ronen Brafman and Chris Geib and David Poole},\n  Booktitle                = {AAAI Spring Symposium on Qualitative Decision Theory},\n  Year                     = {1997},\n\n  Address                  = {Stanford},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {preferences.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with Concurrent Interacting Actions.\n \n \n \n \n\n\n \n Boutilier, C.; and Brafman, R. I.\n\n\n \n\n\n\n In aaai97, pages 720–729, Providence, RI, 1997. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\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{BoutilierBrafman:aaai97,\n  Title                    = {Planning with Concurrent Interacting Actions},\n  Author                   = {Craig Boutilier and Ronen I. Brafman},\n  Booktitle                = aaai97,\n  Year                     = {1997},\n\n  Address                  = {Providence, RI},\n  Pages                    = {720--729},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {map.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Prioritized Goal Decomposition of Markov Decision Processes: Toward a Synthesis of Classical and Decision Theoretic Planning.\n \n \n \n \n\n\n \n Boutilier, C.; Brafman, R. I.; and Geib, C.\n\n\n \n\n\n\n In ijcai97, pages 1156–1162, Nagoya, 1997. \n \n\n\n\n
\n\n\n\n \n \n \"PrioritizedPaper\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{BBG:ijcai97,\n  Title                    = {Prioritized Goal Decomposition of {Markov} Decision Processes:\n Toward a Synthesis of Classical and Decision Theoretic Planning},\n  Author                   = {Craig Boutilier and Ronen I. Brafman and Christopher Geib},\n  Booktitle                = ijcai97,\n  Year                     = {1997},\n\n  Address                  = {Nagoya},\n  Pages                    = {1156--1162},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {decomposition.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Economic Principles of Multiagent Systems (Editorial).\n \n \n \n \n\n\n \n Boutilier, C.; Shoham, Y.; and Wellman, M. P.\n\n\n \n\n\n\n aij, 94(1): 1–6. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"EconomicPaper\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{MASeditorial:aij97,\n  Title                    = {Economic Principles of Multiagent Systems (Editorial)},\n  Author                   = {Craig Boutilier and Yoav Shoham and Michael P. Wellman},\n  Journal                  = aij,\n  Year                     = {1997},\n  Number                   = {1},\n  Pages                    = {1--6},\n  Volume                   = {94},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {editorial.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards Model-Based Adaptive Control of Systems with Smart Matter.\n \n \n \n \n\n\n \n Carlson, B.; Fromherz, M.; Gupta, V.; Hogg, T.; and McIlraith, S.\n\n\n \n\n\n\n In Working Notes of AAAI 1997 Fall Symposium on Model-Directed Autonomous Systems, pages 9-11, Massachsetts Institute of Technology, Cambridge, Massachusetts, USA, November 8-10 1997. \n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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{adaptivecontrol97,\n  Title                    = {Towards Model-Based Adaptive Control of Systems with Smart Matter},\n  Author                   = {Carlson, B. and Fromherz, M. and Gupta, V. and Hogg, T. and McIlraith, S.},\n  Booktitle                = {Working Notes of AAAI 1997 Fall Symposium on Model-Directed Autonomous Systems},\n  Year                     = {1997},\n\n  Address                  = {Massachsetts Institute of Technology, Cambridge, Massachusetts, USA},\n  Month                    = {November 8-10},\n  Pages                    = {9-11},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {adaptivecontrol97.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Structured Arc Reversal and Simulation of Dynamic Probabilistic Networks.\n \n \n \n \n\n\n \n Cheuk, A. Y. W.; and Boutilier, C.\n\n\n \n\n\n\n In uai97, pages 72–79, Providence, RI, 1997. \n \n\n\n\n
\n\n\n\n \n \n \"StructuredPaper\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{CheukBoutilier:uai97,\n  Title                    = {Structured Arc Reversal and Simulation of Dynamic Probabilistic\n Networks},\n  Author                   = {Adrian Y. W. Cheuk and Craig Boutilier},\n  Booktitle                = uai97,\n  Year                     = {1997},\n\n  Address                  = {Providence, RI},\n  Pages                    = {72--79},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {simulation.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasoning About Concurrent Execution, Prioritized Interrupts, and Exogenous Actions in 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 In Proceedings of the Fifteenth International Joint Conference on AI (IJCAI-97), pages 1221–1226, Nagoya, August 1997. \n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\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{Giuseppe97-ConGolog1,\n  Title                    = {Reasoning About Concurrent Execution, Prioritized\n Interrupts, and Exogenous Actions in the Situation\n Calculus},\n  Author                   = {De Giacomo, Giuseppe and Lesp\\'erance, Yves and\n Levesque, Hector},\n  Booktitle                = {Proceedings of the Fifteenth International Joint\n Conference on AI (IJCAI-97)},\n  Year                     = {1997},\n\n  Address                  = {Nagoya},\n  Month                    = {August},\n  Pages                    = {1221--1226},\n\n  File                     = {congologIJCAI97.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/congologIJCAI97.pdf:PDF;congologIJCAI97.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/congologIJCAI97.ps:PostScript},\n  Key                      = {CogRobo},\n  Keywords                 = {Golog},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/congologIJCAI97.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {congologIJCAI97.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Non-Terminating Processes in the Situation Calculus.\n \n \n \n \n\n\n \n De Giacomo, G.; Ternovskaia, E.; and Reiter, R.\n\n\n \n\n\n\n In Working Notes of Robots, Softbots, Immobots: Theories of Action, Planning and Control. AAAI-97 Workshop, July 28 1997. \n \n\n\n\n
\n\n\n\n \n \n \"Non-TerminatingPaper\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{Giuseppe97-NonTermProc,\n  Title                    = {Non-Terminating Processes in the Situation Calculus},\n  Author                   = {De Giacomo, Giuseppe and Ternovskaia, Eugenia and\n Reiter, Ray},\n  Booktitle                = {Working Notes of Robots, Softbots, Immobots: Theories\n of Action, Planning and Control. AAAI-97 Workshop},\n  Year                     = {1997},\n  Month                    = {July 28},\n\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {Giuseppe97-NonTermProc.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Abstraction and Approximate Decision Theoretic Planning.\n \n \n \n \n\n\n \n Dearden, R.; and Boutilier, C.\n\n\n \n\n\n\n aij, 89: 219–283. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"AbstractionPaper\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{DeardenBoutilier:AIJ96,\n  Title                    = {Abstraction and Approximate Decision Theoretic Planning},\n  Author                   = {Richard Dearden and Craig Boutilier},\n  Journal                  = aij,\n  Year                     = {1997},\n  Pages                    = {219--283},\n  Volume                   = {89},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {abstraction.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n How to Progress a Database.\n \n \n \n \n\n\n \n Fangzhen, L.; and Reiter, R.\n\n\n \n\n\n\n Artificial Intelligence, 92: 131–167. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"HowPaper\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{Lin97b,\n  Title                    = {How to Progress a Database},\n  Author                   = {Fangzhen, Lin and Reiter, Ray},\n  Journal                  = {Artificial Intelligence},\n  Year                     = {1997},\n  Pages                    = {131--167},\n  Volume                   = {92},\n\n  File                     = {progress.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/progress.pdf:PDF;progress.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/progress.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/progress.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {progress.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Experiment in Using Golog to Build a Personal Banking Assistant.\n \n \n \n \n\n\n \n Lespérance, Y.; Levesque, H. J.; and Ruman, S.\n\n\n \n\n\n\n In Rao, L.; and Wobcke, W., editor(s), Intelligent Agent Systems: Theoretical and Practical Issues, volume 1209, of Lectures Notes in Artificial Intelligence (LNAI), pages 27–43, 1997. Springer-Verlag\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\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{Lesperance97,\n  Title                    = {An Experiment in Using Golog to Build a Personal\n Banking Assistant},\n  Author                   = {Lesp\\'erance, Y. and Levesque, H. J. and Ruman, S.},\n  Booktitle                = {Intelligent Agent Systems: Theoretical and Practical\n Issues},\n  Year                     = {1997},\n  Editor                   = {Rao, L. and Wobcke, W.},\n  Pages                    = {27--43},\n  Publisher                = {Springer-Verlag},\n  Series                   = {Lectures Notes in Artificial Intelligence (LNAI)},\n  Volume                   = {1209},\n\n  File                     = {bankingAgt.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/bankingAgt.pdf:PDF;bankingAgt.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/bankingAgt.ps:PostScript},\n  Key                      = {CogRobo},\n  Keywords                 = {Golog},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/bankingAgt.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {bankingAgt.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n GOLOG: A Logic Programming Language for Dynamic Domains.\n \n \n \n \n\n\n \n Levesque, H.; Reiter, R.; Lespérance, Y.; Lin, F.; and Scherl, R.\n\n\n \n\n\n\n Journal of Logic Programming, 31: 59–84. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"GOLOG: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
@Article{Levesque97-Golog,\n  Title                    = {{GOLOG}: {A} Logic Programming Language for Dynamic\n Domains},\n  Author                   = {Levesque, H. and Reiter, R. and Lesp\\'erance, Y. and\n Lin, F. and Scherl, R.},\n  Journal                  = {Journal of Logic Programming},\n  Year                     = {1997},\n  Pages                    = {59--84},\n  Volume                   = {31},\n\n  File                     = {GOLOGlang.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/GOLOGlang.pdf:PDF;GOLOGlang.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/GOLOGlang.ps:PostScript},\n  Key                      = {CogRobo},\n  Keywords                 = {Golog},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/GOLOGlang.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {GOLOGlang.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Ordering on Subgoals for Planning.\n \n \n \n \n\n\n \n Lin, F.\n\n\n \n\n\n\n Annals of Mathematics and Artificial Intelligence. Special Issue in Honor of Professor Michael Gelfond, 21: 321–342. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\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
@Article{Lin97c,\n  Title                    = {An Ordering on Subgoals for Planning},\n  Author                   = {Lin, F.},\n  Journal                  = {Annals of Mathematics and Artificial Intelligence.\n Special Issue in Honor of Professor Michael Gelfond},\n  Year                     = {1997},\n  Pages                    = {321--342},\n  Volume                   = {21},\n\n  File                     = {ordergelfond.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/ordergelfond.pdf:PDF;ordergelfond.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/ordergelfond.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/ordergelfond.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {ordergelfond.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Applications of the situation calculus to formalizing control and strategic information: The Prolog cut operator.\n \n \n \n \n\n\n \n Lin, F.\n\n\n \n\n\n\n In In Proceedings of IJCAI-97, pages 1412–1418, 1997. \n (IJCAI-97 Distinguished Paper Award)\n\n\n\n
\n\n\n\n \n \n \"ApplicationsPaper\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{Lin97d,\n  Title                    = {Applications of the situation calculus to formalizing\n control and strategic information: {T}he {P}rolog cut\n operator},\n  Author                   = {Lin, Fangzhen},\n  Booktitle                = {In Proceedings of IJCAI-97},\n  Year                     = {1997},\n  Note                     = {(IJCAI-97 Distinguished Paper Award)},\n  Pages                    = {1412--1418},\n\n  File                     = {lin-ijcai97.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/lin-ijcai97.pdf:PDF;lin-ijcai97.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/lin-ijcai97.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/lin-ijcai97.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {lin-ijcai97.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Rules as actions: A situation calculus semantics for logic programs.\n \n \n \n \n\n\n \n Lin, F.; and Reiter, R.\n\n\n \n\n\n\n Journal of Logic Programming, Special issue on Reasoning about Action and Change, 31: 299–330. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"RulesPaper\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
@Article{Lin97a,\n  Title                    = {Rules as actions: {A} situation calculus semantics for\n logic programs},\n  Author                   = {F. Lin and R. Reiter},\n  Journal                  = {Journal of Logic Programming, Special issue on\n Reasoning about Action and Change},\n  Year                     = {1997},\n  Pages                    = {299--330},\n  Volume                   = {31},\n\n  File                     = {lp.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/lp.pdf:PDF;lp.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/lp.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/lp.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {lp.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Representing Actions and State Constraints in Model-Based Diagnosis.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings Fourteenth National Conference on Artificial Intelligence (AAAI'97), pages 43-49, Providence, Rhode Island, USA, July 27-31 1997. \n \n\n\n\n
\n\n\n\n \n \n \"RepresentingPaper\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{aaai97,\n  Title                    = {Representing Actions and State Constraints in Model-Based Diagnosis},\n  Author                   = {McIlraith, S. },\n  Booktitle                = {Proceedings Fourteenth National Conference on Artificial Intelligence (AAAI'97)},\n  Year                     = {1997},\n\n  Address                  = {Providence, Rhode Island, USA},\n  Month                    = {July 27-31},\n  Pages                    = {43-49},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {aaai97.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Explanatory Diagnosis: Conjecturing Actions to Explain Observations.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Eighth International Workshop on Principles of Diagnosis (DX'97), pages 69-78, September 1997. \n \n\n\n\n
\n\n\n\n \n \n \"ExplanatoryPaper\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{dx97,\n  Title                    = {Explanatory Diagnosis: Conjecturing Actions to Explain Observations},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Eighth International Workshop on Principles of Diagnosis (DX'97)},\n  Year                     = {1997},\n  Month                    = {September},\n  Pages                    = {69-78},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {dx97.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Closed-Form Solution to the Ramification Problem (Sometimes).\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the IJCAI'97 Workshop on Nonmonotonic Reasoning Action and Change, pages 103–126, Nagoya, Aichi, Japan, August 24–25 1997. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\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{ijcai97,\n  Title                    = {A Closed-Form Solution to the Ramification Problem (Sometimes)},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the IJCAI'97 Workshop on Nonmonotonic Reasoning Action and Change},\n  Year                     = {1997},\n\n  Address                  = {Nagoya, Aichi, Japan},\n  Month                    = {August 24--25},\n  Pages                    = {103--126},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {sheila-ijcai97.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Representing Actions and State Constraints in Model-Based Diagnosis.\n \n \n \n \n\n\n \n McIlraith, S. A.\n\n\n \n\n\n\n In In Proceedings of the National Conference on Artificial Intelligence (AAAI-97), pages 43–49, 1997. \n \n\n\n\n
\n\n\n\n \n \n \"RepresentingPaper\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{McIlraith97b,\n  Title                    = {Representing Actions and State Constraints in\n Model-Based Diagnosis},\n  Author                   = {McIlraith, Sheila A.},\n  Booktitle                = {In Proceedings of the National Conference on\n Artificial Intelligence (AAAI-97)},\n  Year                     = {1997},\n  Pages                    = {43--49},\n\n  File                     = {sheila-aaai97.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/sheila-aaai97.pdf:PDF;sheila-aaai97.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/sheila-aaai97.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/sheila-aaai97.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {sheila-aaai97.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Explanatory Diagnosis: Conjecturing actions to explain obsevations.\n \n \n \n \n\n\n \n McIlraith, S. A.\n\n\n \n\n\n\n In In Proceedings of the Eighth International Workshop on Principles of Diagnosis (DX'97), pages 69–78, 1997. \n \n\n\n\n
\n\n\n\n \n \n \"ExplanatoryPaper\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{McIlraith97c,\n  Title                    = {Explanatory Diagnosis: {C}onjecturing actions to\n explain obsevations},\n  Author                   = {McIlraith, Sheila A.},\n  Booktitle                = {In Proceedings of the Eighth International Workshop on\n Principles of Diagnosis (DX'97)},\n  Year                     = {1997},\n  Pages                    = {69--78},\n\n  File                     = {sheila-dx97.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/sheila-dx97.pdf:PDF;sheila-dx97.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/sheila-dx97.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/sheila-dx97.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {sheila-dx97.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards a Formal Account of Diagnostic Problem Solving.\n \n \n \n \n\n\n \n McIlraith, S. A.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Computer Science, University of Toronto, Toronto, Canada, 1997.\n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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
@PhdThesis{McIlraith97-Phd,\n  Title                    = {Towards a Formal Account of Diagnostic Problem Solving},\n  Author                   = {McIlraith, Sheila A.},\n  School                   = {Department of Computer Science, University of Toronto},\n  Year                     = {1997},\n\n  Address                  = {Toronto, Canada},\n\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {McIlraith97-Phd.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Specifying Communicative Multi-Agent Systems with ConGolog.\n \n \n \n \n\n\n \n Shapiro, S.; Lespérance, Y.; and Levesque, H. J.\n\n\n \n\n\n\n In In Working Notes of the AAAI Fall 1997 Symposium on Communicative Action in Humans and Machines, pages 72–82, Cambridge, MA, Novemeber 1997. AAAI Press\n \n\n\n\n
\n\n\n\n \n \n \"SpecifyingPaper\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{Shapiro97,\n  Title                    = {Specifying Communicative Multi-Agent Systems with ConGolog},\n  Author                   = {Shapiro, S. and Lesp\\'erance, Y. and Levesque, H. J.},\n  Booktitle                = {In Working Notes of the AAAI Fall 1997 Symposium on Communicative Action in Humans and Machines},\n  Year                     = {1997},\n\n  Address                  = {Cambridge, MA},\n  Month                    = {Novemeber},\n  Pages                    = {72--82},\n  Publisher                = {AAAI Press},\n\n  File                     = {AAAIfall97.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/AAAIfall97.pdf:PDF;AAAIfall97.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/AAAIfall97.ps:PostScript},\n  Key                      = {CogRobo},\n  Keywords                 = {Golog},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/AAAIfall97.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {AAAIfall97.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1996\n \n \n (18)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Rewarding Behaviors.\n \n \n \n \n\n\n \n Bacchus, F.; Boutilier, C.; and Grove, A.\n\n\n \n\n\n\n In aaai96, pages 1160–1167, Portland, OR, 1996. \n \n\n\n\n
\n\n\n\n \n \n \"RewardingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{BBG:aaai96,\n  Title                    = {Rewarding Behaviors},\n  Author                   = {Fahiem Bacchus and Craig Boutilier and Adam Grove},\n  Booktitle                = aaai96,\n  Year                     = {1996},\n\n  Address                  = {Portland, OR},\n  Pages                    = {1160--1167},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {behaviors.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Iterated Revision and Minimal Revision of Conditional Beliefs.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n jpl, 25(3): 262–305. 1996.\n \n\n\n\n
\n\n\n\n \n \n \"IteratedPaper\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
@Article{boutilier:JPL96,\n  Title                    = {Iterated Revision and Minimal Revision of Conditional Beliefs},\n  Author                   = {Craig Boutilier},\n  Journal                  = jpl,\n  Year                     = {1996},\n  Number                   = {3},\n  Pages                    = {262--305},\n  Volume                   = {25},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {jpl95.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning, Learning and Coordination in Multiagent Decision Processes.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge, pages 195–210, Amsterdam, 1996. \n \n\n\n\n
\n\n\n\n \n \n \"Planning,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{Boutilier:tark96,\n  Title                    = {Planning, Learning and Coordination in Multiagent Decision Processes},\n  Author                   = {Craig Boutilier},\n  Booktitle                = {Proceedings of the Sixth Conference on\n Theoretical Aspects of Rationality and Knowledge},\n  Year                     = {1996},\n\n  Address                  = {Amsterdam},\n  Pages                    = {195--210},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {tark96.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Learning Conventions in Multiagent Stochastic Domains Using Likelihood Estimates.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In uai96, pages 106–114, Portland, OR, 1996. \n \n\n\n\n
\n\n\n\n \n \n \"LearningPaper\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-conventions:uai96,\n  Title                    = {Learning Conventions in Multiagent Stochastic Domains\n Using Likelihood Estimates},\n  Author                   = {Craig Boutilier},\n  Booktitle                = uai96,\n  Year                     = {1996},\n\n  Address                  = {Portland, OR},\n  Pages                    = {106--114},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {uai96coord.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Abduction to Plausible Causes: An Event-Based Model of Belief Update.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n aij, 83(1): 143–166. 1996.\n \n\n\n\n
\n\n\n\n \n \n \"AbductionPaper\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
@Article{boutilier-update:AIJ96,\n  Title                    = {Abduction to Plausible Causes: An Event-Based Model of Belief Update},\n  Author                   = {Craig Boutilier},\n  Journal                  = aij,\n  Year                     = {1996},\n  Number                   = {1},\n  Pages                    = {143--166},\n  Volume                   = {83},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {aij95update.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Approximating Value Trees in Structured Dynamic Programming.\n \n \n \n \n\n\n \n Boutilier, C.; and Dearden, R.\n\n\n \n\n\n\n In ml96, pages 54–62, Bari, Italy, 1996. \n \n\n\n\n
\n\n\n\n \n \n \"ApproximatingPaper\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{BoutilierDearden:icml96,\n  Title                    = {Approximating Value Trees in Structured Dynamic Programming},\n  Author                   = {Craig Boutilier and Richard Dearden},\n  Booktitle                = ml96,\n  Year                     = {1996},\n\n  Address                  = {Bari, Italy},\n  Pages                    = {54--62},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {pruning.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Context-Specific Independence in Bayesian Networks.\n \n \n \n \n\n\n \n Boutilier, C.; Friedman, N.; Goldszmidt, M.; and Koller, D.\n\n\n \n\n\n\n In uai96, pages 115–123, Portland, OR, 1996. \n \n\n\n\n
\n\n\n\n \n \n \"Context-SpecificPaper\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{BFGK:uai96,\n  Title                    = {Context-Specific Independence in {Bayesian} Networks},\n  Author                   = {Craig Boutilier and Nir Friedman and Mois\\'{e}s Goldszmidt\n and Daphne Koller},\n  Booktitle                = uai96,\n  Year                     = {1996},\n\n  Address                  = {Portland, OR},\n  Pages                    = {115--123},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {context-ind.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Frame Problem and Bayesian Network Action Representations.\n \n \n \n \n\n\n \n Boutilier, C.; and Goldszmidt, M.\n\n\n \n\n\n\n In Proceedings of the Eleventh Biennial Canadian Conference on Artificial Intelligence, pages 69–83, Toronto, 1996. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{BoutilierGoldszmidt:CdnAI96,\n  Title                    = {The Frame Problem and {Bayesian} Network Action Representations},\n  Author                   = {Craig Boutilier and Mois\\'{e}s Goldszmidt},\n  Booktitle                = {Proceedings of the Eleventh Biennial Canadian Conference\n on Artificial Intelligence},\n  Year                     = {1996},\n\n  Address                  = {Toronto},\n  Pages                    = {69--83},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {BN-frame.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computing Optimal Policies for Partially Observable Decision Processes using Compact Representations.\n \n \n \n \n\n\n \n Boutilier, C.; and Poole, D.\n\n\n \n\n\n\n In aaai96, pages 1168–1175, Portland, OR, 1996. \n \n\n\n\n
\n\n\n\n \n \n \"ComputingPaper\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{BoutilierPoole:aaai95,\n  Title                    = {Computing Optimal Policies for Partially Observable\n Decision Processes using Compact Representations},\n  Author                   = {Craig Boutilier and David Poole},\n  Booktitle                = aaai96,\n  Year                     = {1996},\n\n  Address                  = {Portland, OR},\n  Pages                    = {1168--1175},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {pomdp.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasoning about physical systems with the situation calculus.\n \n \n \n \n\n\n \n Kelley, T.\n\n\n \n\n\n\n In Proc. of the Third Symposium on Logical Formalizations of Commonsense Reasoning, Stanford, CA, Jan 1996. \n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\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{Kelley96a,\n  Title                    = {Reasoning about physical systems with the situation\n calculus},\n  Author                   = {Kelley, T.},\n  Booktitle                = {Proc. of the Third Symposium on Logical Formalizations\n of Commonsense Reasoning},\n  Year                     = {1996},\n\n  Address                  = {Stanford, CA},\n  Month                    = {Jan},\n\n  File                     = {toilet.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/toilet.pdf:PDF;toilet.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/toilet.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/toilet.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {toilet.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Modeling complex systems in the situation calculus: A case study using the Dagstuhl steam boiler problem.\n \n \n \n \n\n\n \n Kelley, T.\n\n\n \n\n\n\n In In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR'96), Cambridge, Massachusetts, U.S.A, November 1996. \n \n\n\n\n
\n\n\n\n \n \n \"ModelingPaper\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{Kelley96b,\n  Title                    = {Modeling complex systems in the situation calculus:\n {A} case study using the Dagstuhl steam boiler problem},\n  Author                   = {Kelley, T.},\n  Booktitle                = {In Principles of Knowledge Representation and\n Reasoning: Proceedings of the Fifth International\n Conference (KR'96)},\n  Year                     = {1996},\n\n  Address                  = {Cambridge, Massachusetts, U.S.A},\n  Month                    = {November},\n\n  File                     = {dagstuhl.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/dagstuhl.pdf:PDF;dagstuhl.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/dagstuhl.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/dagstuhl.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {dagstuhl.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n What is Planning in the Presence of Sensing?.\n \n \n \n \n\n\n \n Levesque, H.\n\n\n \n\n\n\n In The Proceedings of the Thirteenth National Conference on Artificial Intelligence, AAAI-96, pages 1139–1146, Portland, Oregon, 1996. American Association for Artificial Intelligence\n \n\n\n\n
\n\n\n\n \n \n \"WhatPaper\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{Levesque96-WhatPlanning,\n  Title                    = {What is Planning in the Presence of Sensing?},\n  Author                   = {Levesque, Hector},\n  Booktitle                = {The Proceedings of the Thirteenth National Conference\n on Artificial Intelligence, AAAI-96},\n  Year                     = {1996},\n\n  Address                  = {Portland, Oregon},\n  Pages                    = {1139--1146},\n  Publisher                = {American Association for Artificial Intelligence},\n\n  File                     = {sensing.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/sensing.pdf:PDF;sensing.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/sensing.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/sensing.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {sensing.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Embracing causality in specifying the indeterminate effects of actions.\n \n \n \n \n\n\n \n Lin, F.\n\n\n \n\n\n\n In Proc. at AAAI-96, 1996. AAAI Press\n \n\n\n\n
\n\n\n\n \n \n \"EmbracingPaper\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{Lin96a,\n  Title                    = {Embracing causality in specifying the indeterminate\n effects of actions},\n  Author                   = {Lin, F.},\n  Booktitle                = {Proc. at AAAI-96},\n  Year                     = {1996},\n  Publisher                = {AAAI Press},\n\n  File                     = {indtm.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/indtm.pdf:PDF;indtm.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/indtm.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/indtm.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {indtm.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On non-forgetting and minimal learning.\n \n \n \n \n\n\n \n Lin, F.; and Shoham, Y.\n\n\n \n\n\n\n In Asher, N.; Korta, K.; and Ezquerro, J., editor(s), Proc. of the 1993 International Coll. on Cognitive Science, 1996. Kluwer Academic Publishers\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{Lin96b,\n  Title                    = {On non-forgetting and minimal learning},\n  Author                   = {Lin, F. and Shoham, Y.},\n  Booktitle                = {Proc. of the 1993 International Coll. on Cognitive\n Science},\n  Year                     = {1996},\n  Editor                   = {Asher, N. and Korta, K. and Ezquerro, J.},\n  Publisher                = {Kluwer Academic Publishers},\n\n  File                     = {persist.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/persist.pdf:PDF;persist.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/persist.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/persist.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {persist.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SD + Actions: New Representation Problems for Model-Based Diagnosis.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Seventh International Workshop on Principles of Diagnosis, pages 157-166, Val Morin, Canada, October 1996. \n \n\n\n\n
\n\n\n\n \n \n \"SDPaper\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{dx96,\n  Title                    = {SD + Actions: New Representation Problems for Model-Based Diagnosis},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Seventh International Workshop on Principles of Diagnosis},\n  Year                     = {1996},\n\n  Address                  = {Val Morin, Canada},\n  Month                    = {October},\n  Pages                    = {157-166},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {dx96.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Natural actions, concurrency and continuous time in the situation calculus.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n In In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR'96), pages 2–13, Cambridge, Massachusetts, U.S.A., November 1996. \n \n\n\n\n
\n\n\n\n \n \n \"NaturalPaper\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{Reiter96a,\n  Title                    = {Natural actions, concurrency and continuous time in\n the situation calculus},\n  Author                   = {Reiter, R.},\n  Booktitle                = {In Principles of Knowledge Representation and\n Reasoning: Proceedings of the Fifth International\n Conference (KR'96)},\n  Year                     = {1996},\n\n  Address                  = {Cambridge, Massachusetts, U.S.A.},\n  Month                    = {November},\n  Pages                    = {2--13},\n\n  File                     = {natural.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/natural.pdf:PDF;natural.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/natural.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/natural.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {natural.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scheduling in the situation calculus: A case study.\n \n \n \n \n\n\n \n Reiter, R.; and Zheng, Y.\n\n\n \n\n\n\n Annals of Mathematics and Artificial Intelligence. Special issue on logic programming, nonmonotonic reasoning and action. 1996.\n \n\n\n\n
\n\n\n\n \n \n \"SchedulingPaper\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
@Article{Reiter96b,\n  Title                    = {Scheduling in the situation calculus: {A} case study},\n  Author                   = {Reiter, R. and Zheng, Y.},\n  Journal                  = {Annals of Mathematics and Artificial Intelligence.\n Special issue on logic programming, nonmonotonic\n reasoning and action},\n  Year                     = {1996},\n\n  File                     = {schedule.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/schedule.pdf:PDF;schedule.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/schedule.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/schedule.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {schedule.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n AI Models for Business Process Reengineering.\n \n \n \n \n\n\n \n Yu, E. S. K.; Mylopoulos, J.; and Lespérance, Y.\n\n\n \n\n\n\n IEEE Expert, 11: 16–23. 1996.\n \n\n\n\n
\n\n\n\n \n \n \"AIPaper\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{Yu96,\n  Title                    = {AI Models for Business Process Reengineering},\n  Author                   = {Yu, E. S. K. and Mylopoulos, J. and Lesp{\\'e}rance, Y.},\n  Journal                  = {IEEE Expert},\n  Year                     = {1996},\n  Pages                    = {16--23},\n  Volume                   = {11},\n\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {Yu96.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1995\n \n \n (20)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Reasoning about Noisy Sensors in the Situation Calculus.\n \n \n \n \n\n\n \n Bacchus, F.; Halpern, J. Y.; and Levesque, H. J.\n\n\n \n\n\n\n In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-95), pages 1933–1940, 1995. \n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\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{Bacchus95,\n  Title                    = {Reasoning about Noisy Sensors in the Situation\n Calculus},\n  Author                   = {Bacchus, Fahiem and Halpern, Joseph Y. and Levesque,\n Hector J.},\n  Booktitle                = {Proceedings of the International Joint Conference on\n Artificial Intelligence (IJCAI-95)},\n  Year                     = {1995},\n  Pages                    = {1933--1940},\n\n  File                     = {noise.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/noise.pdf:PDF;noise.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/noise.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/noise.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {noise.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Frame Problem in Procedure Specifications.\n \n \n \n \n\n\n \n Borgida, A.; Mylopoulos, J.; and Reiter, R.\n\n\n \n\n\n\n IEEE Transactions on Software Engineering, 21(10): 785–798. October 1995.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Borgida95,\n  Title                    = {On the Frame Problem in Procedure Specifications},\n  Author                   = {Borgida, A. and Mylopoulos, J. and Reiter, R.},\n  Journal                  = {IEEE Transactions on Software Engineering},\n  Year                     = {1995},\n\n  Month                    = {October},\n  Number                   = {10},\n  Pages                    = {785--798},\n  Volume                   = {21},\n\n  File                     = {ieee-tse.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/ieee-tse.pdf:PDF;ieee-tse.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/ieee-tse.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/ieee-tse.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {ieee-tse.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Revision of Probabilistic Belief States.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n Notre Dame Journal of Formal Logic, 36(1): 158–183. 1995.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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
@Article{boutilier:ndjfl95,\n  Title                    = {On the Revision of Probabilistic Belief States},\n  Author                   = {Craig Boutilier},\n  Journal                  = {Notre Dame Journal of Formal Logic},\n  Year                     = {1995},\n  Number                   = {1},\n  Pages                    = {158--183},\n  Volume                   = {36},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ndjfl95.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Generalized Update: Belief Change in Dynamic Settings.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In ijcai95, pages 1550–1556, Montreal, 1995. \n \n\n\n\n
\n\n\n\n \n \n \"GeneralizedPaper\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-update:ijcai95,\n  Title                    = {Generalized Update: Belief Change in Dynamic Settings},\n  Author                   = {Craig Boutilier},\n  Booktitle                = ijcai95,\n  Year                     = {1995},\n\n  Address                  = {Montreal},\n  Pages                    = {1550--1556},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {gen-update.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Abduction as Belief Revision.\n \n \n \n \n\n\n \n Boutilier, C.; and Becher, V.\n\n\n \n\n\n\n aij, 77(1): 43–94. 1995.\n \n\n\n\n
\n\n\n\n \n \n \"AbductionPaper\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
@Article{BoutilierBecher:AIJ95,\n  Title                    = {Abduction as Belief Revision},\n  Author                   = {Craig Boutilier and Veronica Becher},\n  Journal                  = aij,\n  Year                     = {1995},\n  Number                   = {1},\n  Pages                    = {43--94},\n  Volume                   = {77},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {aij95abduct.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning Under Uncertainty: Structural Assumptions and Computational Leverage.\n \n \n \n \n\n\n \n Boutilier, C.; Dean, T.; and Hanks, S.\n\n\n \n\n\n\n In Proceedings of the Third European Workshop on Planning, Assisi, Italy, 1995. \n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\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-etal:europlan95,\n  Title                    = {Planning Under Uncertainty:\n Structural Assumptions and Computational Leverage},\n  Author                   = {Craig Boutilier and Thomas Dean and Steve Hanks},\n  Booktitle                = {Proceedings of the Third European Workshop on Planning},\n  Year                     = {1995},\n\n  Address                  = {Assisi, Italy},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {planning.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting Structure in Policy Construction.\n \n \n \n \n\n\n \n Boutilier, C.; Dearden, R.; and Goldszmidt, M.\n\n\n \n\n\n\n In ijcai95, pages 1104–1111, Montreal, 1995. \n \n\n\n\n
\n\n\n\n \n \n \"ExploitingPaper\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{BDG:ijcai95,\n  Title                    = {Exploiting Structure in Policy Construction},\n  Author                   = {Craig Boutilier and Richard Dearden and Mois\\'{e}s Goldszmidt},\n  Booktitle                = ijcai95,\n  Year                     = {1995},\n\n  Address                  = {Montreal},\n  Pages                    = {1104--1111},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {spi.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Nondeterministic Actions and the Frame Problem.\n \n \n \n \n\n\n \n Boutilier, C.; and Friedman, N.\n\n\n \n\n\n\n In AAAI Spring Symposium on Extending Theories of Action: Formal Theory and Practical Applications, pages 39–44, Stanford, 1995. \n \n\n\n\n
\n\n\n\n \n \n \"NondeterministicPaper\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{BoutilierFriedman:AAAIspring95,\n  Title                    = {Nondeterministic Actions and the Frame Problem},\n  Author                   = {Craig Boutilier and Nir Friedman},\n  Booktitle                = {AAAI Spring Symposium on Extending Theories of Action:\n Formal Theory and Practical Applications},\n  Year                     = {1995},\n\n  Address                  = {Stanford},\n  Pages                    = {39--44},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {frame.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Process-Oriented Planning and Average-Reward Optimality.\n \n \n \n \n\n\n \n Boutilier, C.; and Puterman, M. L.\n\n\n \n\n\n\n In ijcai95, pages 1096–1103, Montreal, 1995. \n \n\n\n\n
\n\n\n\n \n \n \"Process-OrientedPaper\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{BoutilierPuterman:ijcai95,\n  Title                    = {Process-Oriented Planning and Average-Reward Optimality},\n  Author                   = {Craig Boutilier and Martin L. Puterman},\n  Booktitle                = ijcai95,\n  Year                     = {1995},\n\n  Address                  = {Montreal},\n  Pages                    = {1096--1103},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {avg-reward.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Indexical Knowledge and Robot Action – A Logical Account.\n \n \n \n \n\n\n \n Lespérance, Y.; and Levesque, H. J.\n\n\n \n\n\n\n Artificial Intelligence, 73: 69–115. 1995.\n \n\n\n\n
\n\n\n\n \n \n \"IndexicalPaper\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{Lesperance95b,\n  Title                    = {Indexical Knowledge and Robot Action -- A Logical\n Account},\n  Author                   = {Lesp\\'erance, Y. and Levesque, H. J.},\n  Journal                  = {Artificial Intelligence},\n  Year                     = {1995},\n  Pages                    = {69--115},\n  Volume                   = {73},\n\n  File                     = {indexmodal.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/indexmodal.pdf:PDF;indexmodal.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/indexmodal.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/indexmodal.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {indexmodal.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Foundations of a Logical Approach to Agent Programming.\n \n \n \n \n\n\n \n Lespérance, Y.; Levesque, H. J.; Lin, F.; Marcu, D.; Reiter, R.; and Scherl, R. B.\n\n\n \n\n\n\n In Woolridge, M; Muller, J.; and Tambe, M., editor(s), Intelligent Agents II. Proceedings of the 1995 Workshop on Agent Theories, Architectures, and Languages (ATAL-95), pages 331-346. Springer-Verlag, 1995.\n \n\n\n\n
\n\n\n\n \n \n \"FoundationsPaper\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
@InCollection{Lesperance95a,\n  Title                    = {Foundations of a Logical Approach to Agent Programming},\n  Author                   = {Lesp{\\'e}rance, Yves and Levesque, Hector J. and Lin,\n Fangzhen and Marcu, Daniel and Reiter, Raymond and\n Scherl, Richard B.},\n  Booktitle                = {Intelligent Agents II. Proceedings of the 1995\n Workshop on Agent Theories, Architectures, and\n Languages (ATAL-95)},\n  Publisher                = {Springer-Verlag},\n  Year                     = {1995},\n  Editor                   = {Woolridge, M and Muller, J. and Tambe, M.},\n  Pages                    = {331-346},\n\n  File                     = {agentprog.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/agentprog.pdf:PDF;agentprog.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/agentprog.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/agentprog.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {agentprog.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Embracing causality in specifying the indirect effects of actions.\n \n \n \n \n\n\n \n Lin, F.\n\n\n \n\n\n\n In In Proc. IJCAI-95, 1995. \n \n\n\n\n
\n\n\n\n \n \n \"EmbracingPaper\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{Lin95a,\n  Title                    = {Embracing causality in specifying the indirect effects\n of actions},\n  Author                   = {Lin, F.},\n  Booktitle                = {In Proc. IJCAI-95},\n  Year                     = {1995},\n\n  File                     = {causality.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/causality.pdf:PDF;causality.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/causality.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/causality.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {causality.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n How to progress a database II: The STRIPS connection.\n \n \n \n \n\n\n \n Lin, F.; and Reiter, R.\n\n\n \n\n\n\n In In Proc. IJCAI-95, 1995. \n \n\n\n\n
\n\n\n\n \n \n \"HowPaper\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{Lin95b,\n  Title                    = {How to progress a database II: The STRIPS connection},\n  Author                   = {Lin, F. and Reiter, R.},\n  Booktitle                = {In Proc. IJCAI-95},\n  Year                     = {1995},\n\n  File                     = {progress2.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/progress2.pdf:PDF;progress2.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/progress2.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/progress2.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {progress2.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Provably correct theories of action.\n \n \n \n \n\n\n \n Lin, F.; and Shoham, Y.\n\n\n \n\n\n\n Journal of ACM, 42(2): 293-320. 1995.\n \n\n\n\n
\n\n\n\n \n \n \"ProvablyPaper\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
@Article{Lin95c,\n  Title                    = {Provably correct theories of action},\n  Author                   = {Lin, F. and Shoham, Y.},\n  Journal                  = {Journal of ACM},\n  Year                     = {1995},\n  Number                   = {2},\n  Pages                    = {293-320},\n  Volume                   = {42},\n\n  File                     = {pcta.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/pcta.pdf:PDF;pcta.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/pcta.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/pcta.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {pcta.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Distributed Software Agents and Communication in the Situation Calculus.\n \n \n \n \n\n\n \n Marcu, M.; Lespérance, Y; Levesque, H. J.; Lin, F.; Reiter, R.; and Scherl, R.\n\n\n \n\n\n\n In In Proc. Intelligent Computer Communication (ICC'95), Cluj-Napoca, Romania, June 1995. \n \n\n\n\n
\n\n\n\n \n \n \"DistributedPaper\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{Marcu95,\n  Title                    = {Distributed Software Agents and Communication in the\n Situation Calculus},\n  Author                   = {Marcu, M. and Lesp\\'erance, Y and Levesque, H. J. and\n Lin, F. and Reiter, R. and Scherl, R.},\n  Booktitle                = {In Proc. Intelligent Computer Communication (ICC'95)},\n  Year                     = {1995},\n\n  Address                  = {Cluj-Napoca, Romania},\n  Month                    = {June},\n\n  File                     = {distribagents.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/distribagents.pdf:PDF;distribagents.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/distribagents.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/distribagents.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {distribagents.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Incorporating Action into Diagnostic Problem Solving (An abridged report).\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Working Notes of the 1995 AAAI Spring Symposium on Extending Theories of Action: Formal Theory and Practical Applications, pages 139-144, Stanford University, CA, USA, March 27-29 1995. \n \n\n\n\n
\n\n\n\n \n \n \"IncorporatingPaper\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{ss95,\n  Title                    = {Incorporating Action into Diagnostic Problem Solving (An abridged report)},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Working Notes of the 1995 AAAI Spring Symposium on Extending Theories of Action: Formal Theory and Practical Applications},\n  Year                     = {1995},\n\n  Address                  = {Stanford University, CA, USA},\n  Month                    = {March 27-29},\n  Pages                    = {139-144},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ss95.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasoning about time in the situation calculus.\n \n \n \n \n\n\n \n Pinto, J.; and Reiter, R.\n\n\n \n\n\n\n Annals of Mathematics and Artificial Intelligence, 14: 2510–268. September 1995.\n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\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
@Article{Pinto95,\n  Title                    = {Reasoning about time in the situation calculus},\n  Author                   = {Pinto, J. and Reiter, R.},\n  Journal                  = {Annals of Mathematics and Artificial Intelligence},\n  Year                     = {1995},\n\n  Month                    = {September},\n  Pages                    = {2510--268},\n  Volume                   = {14},\n\n  File                     = {minker.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/minker.pdf:PDF;minker.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/minker.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/minker.ps.gz},\n  Timestamp                = {2018.09.23},\n  Tnumber                  = {2-4},\n  Url                      = {minker.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On specifying database updates.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n Journal of Logic Programming, 25(1): 53–91. October 1995.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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{Reiter95,\n  Title                    = {On specifying database updates},\n  Author                   = {Reiter, R.},\n  Journal                  = {Journal of Logic Programming},\n  Year                     = {1995},\n\n  Month                    = {October},\n  Number                   = {1},\n  Pages                    = {53--91},\n  Volume                   = {25},\n\n  File                     = {updates.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/updates.pdf:PDF;updates.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/updates.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/updates.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {updates.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Situation Calculus with Sensing and Indexical Knowledge.\n \n \n \n \n\n\n \n Scherl, R.; Levesque, H. J.; and Lespérance, Y.\n\n\n \n\n\n\n In Koppel, M.; and Shamir, E., editor(s), Proceedings of BISFAI'95: The Fourth Bar-Ilan Symposium on Foundations of Artificial Intelligence, pages 86-95, Ramat Gan and Jerusalem, Israel, June 1995. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{Scherl95,\n  Title                    = {The Situation Calculus with Sensing and Indexical\n Knowledge},\n  Author                   = {Scherl, R. and Levesque, H. J. and Lesp\\'erance, Y.},\n  Booktitle                = {Proceedings of BISFAI'95: The Fourth Bar-Ilan\n Symposium on Foundations of Artificial Intelligence},\n  Year                     = {1995},\n\n  Address                  = {Ramat Gan and Jerusalem, Israel},\n  Editor                   = {Moshe Koppel and Eli Shamir},\n  Month                    = {June},\n  Pages                    = {86-95},\n\n  File                     = {indexicals.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/indexicals.pdf:PDF;indexicals.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/indexicals.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/indexicals.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {indexicals.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Goals and Rational Action in the Situation Calculus - A Preliminary Report.\n \n \n \n \n\n\n \n Shapiro, S.; Lespérance, Y.; and Levesque, H.\n\n\n \n\n\n\n In Working Notes of the AAAI Fall Symposium on Rational Agency: Concepts, Theories, Models, and Applications, pages 117–122, Cambridge, MA, November 1995. \n \n\n\n\n
\n\n\n\n \n \n \"GoalsPaper\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{Shapiro95,\n  Title                    = {Goals and Rational Action in the Situation Calculus - {A} Preliminary Report},\n  Author                   = {Shapiro, Steven and Lesp\\'erance, Yves and Levesque, Hector},\n  Booktitle                = {Working Notes of the AAAI Fall Symposium on Rational Agency: {C}oncepts, Theories, Models, and Applications},\n  Year                     = {1995},\n\n  Address                  = {Cambridge, MA},\n  Month                    = {November},\n  Pages                    = {117--122},\n\n  File                     = {AAAIfall95.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/AAAIfall95.pdf:PDF;AAAIfall95.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/AAAIfall95.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/AAAIfall95.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {AAAIfall95.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1994\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Toward a Logic for Qualitative Decision Theory.\n \n \n \n \n\n\n \n Boutilier, C.\n\n\n \n\n\n\n In kr94, pages 75–86, Bonn, 1994. \n \n\n\n\n
\n\n\n\n \n \n \"TowardPaper\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{boutilier:kr94,\n  Title                    = {Toward a Logic for Qualitative Decision Theory},\n  Author                   = {Craig Boutilier},\n  Booktitle                = kr94,\n  Year                     = {1994},\n\n  Address                  = {Bonn},\n  Pages                    = {75--86},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {craig_kr94.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Argument for Indexical Representations in Temporal Reasoning.\n \n \n \n \n\n\n \n Lespérance, Y.; and Levesque, H. J.\n\n\n \n\n\n\n In Elio, R., editor(s), Proceedings of the Tenth Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pages 271–277, Banff, Canada, May 1994. \n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\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{Lesperance94b,\n  Title                    = {An Argument for Indexical Representations in Temporal\n Reasoning},\n  Author                   = {Lesp\\'erance, Y. and Levesque, H. J.},\n  Booktitle                = {Proceedings of the Tenth Biennial Conference of the\n Canadian Society for Computational Studies of\n Intelligence},\n  Year                     = {1994},\n\n  Address                  = {Banff, Canada},\n  Editor                   = {Renee Elio},\n  Month                    = {May},\n  Pages                    = {271--277},\n\n  File                     = {indextempo.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/indextempo.pdf:PDF;indextempo.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/indextempo.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/indextempo.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {indextempo.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Logical Approach to High-Level Robot Programming. A Progress Report.\n \n \n \n \n\n\n \n Lespérance, Y.; Levesque, H. J.; Lin, F.; Marcu, D.; Reiter, R.; and Scherl, R. B.\n\n\n \n\n\n\n In Control of the Physical World by Intelligent Systems, Papers from the 1994 AAAI Fall Symposium. Benjamin Kuipers, New Orlands, L.A., November 1994.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\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
@InCollection{Lesperance94a,\n  Title                    = {A Logical Approach to High-Level Robot Programming. A\n Progress Report},\n  Author                   = {Lesp{\\'e}rance, Yves and Levesque, Hector J. and Lin,\n Fangzhen and Marcu, Daniel and Reiter, Raymond and\n Scherl, Richard B.},\n  Booktitle                = {Control of the Physical World by Intelligent Systems,\n Papers from the 1994 AAAI Fall Symposium},\n  Publisher                = {Benjamin Kuipers},\n  Year                     = {1994},\n\n  Address                  = {New Orlands, L.A.},\n  Month                    = {November},\n\n  File                     = {robotprog.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/robotprog.pdf:PDF;robotprog.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/robotprog.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/robotprog.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {robotprog.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Forget It!.\n \n \n \n \n\n\n \n Lin, F.; and Reiter, R.\n\n\n \n\n\n\n In Proc. of AAAI Fall Symposium on Relevance, New Orleans, USA, Novemeber 1994. \n \n\n\n\n
\n\n\n\n \n \n \"ForgetPaper\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{Lin94a,\n  Title                    = {Forget It!},\n  Author                   = {F. Lin and R. Reiter},\n  Booktitle                = {Proc. of AAAI Fall Symposium on Relevance},\n  Year                     = {1994},\n\n  Address                  = {New Orleans, USA},\n  Month                    = {Novemeber},\n\n  File                     = {forgetting.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/forgetting.pdf:PDF;forgetting.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/forgetting.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/forgetting.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {forgetting.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n How to progress a database (and why) I: Formal foundations.\n \n \n \n \n\n\n \n Lin, F.; and Reiter, R.\n\n\n \n\n\n\n In In Proc. Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94), 1994. \n \n\n\n\n
\n\n\n\n \n \n \"HowPaper\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{Lin94b,\n  Title                    = {How to progress a database (and why) {I}: {F}ormal\n foundations},\n  Author                   = {F. Lin and R. Reiter},\n  Booktitle                = {In Proc. Fourth International Conference on Principles\n of Knowledge Representation and Reasoning (KR-94)},\n  Year                     = {1994},\n\n  File                     = {progress1.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/progress1.pdf:PDF;progress1.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/progress1.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/progress1.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {progress1.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n State Constraints Revisited.\n \n \n \n \n\n\n \n Lin, F.; and Reiter, R.\n\n\n \n\n\n\n Journal of Logic and Computation, 4(5): 655–678. 1994.\n \n\n\n\n
\n\n\n\n \n \n \"StatePaper\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{Lin94-StateConstraints,\n  Title                    = {State Constraints Revisited},\n  Author                   = {Lin, Fangzhen and Reiter, Ray},\n  Journal                  = {Journal of Logic and Computation},\n  Year                     = {1994},\n  Number                   = {5},\n  Pages                    = {655--678},\n  Volume                   = {4},\n\n  File                     = {constraint.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/constraint.pdf:PDF;constraint.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/constraint.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/constraint.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {constraint.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Further Contributions to Characterizing Diagnosis.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n Annals of Mathematics and Artificial Intelligence, 11(1-4): 137-167. 1994.\n \n\n\n\n
\n\n\n\n \n \n \"FurtherPaper\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
@Article{diagnosis-amai94,\n  Title                    = {Further Contributions to Characterizing Diagnosis},\n  Author                   = {McIlraith, S.},\n  Journal                  = {Annals of Mathematics and Artificial Intelligence},\n  Year                     = {1994},\n  Number                   = {1-4},\n  Pages                    = {137-167},\n  Volume                   = {11},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {diagnosis-amai94.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards a Theory of Diagnosis, Testing and Repair.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Fifth International Workshop on Principles of Diagnosis, pages 185-192, New Paltz, NY, USA, October 1994. \n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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{dx94,\n  Title                    = {Towards a Theory of Diagnosis, Testing and Repair},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Fifth International Workshop on Principles of Diagnosis},\n  Year                     = {1994},\n\n  Address                  = {New Paltz, NY, USA},\n  Month                    = {October},\n  Pages                    = {185-192},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {dx94.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Generating Tests using Abduction.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR'94), pages 449-460, Bonn, Germany, May 24-27 1994. \n \n\n\n\n
\n\n\n\n \n \n \"GeneratingPaper\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{kr94,\n  Title                    = {Generating Tests using Abduction},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR'94)},\n  Year                     = {1994},\n\n  Address                  = {Bonn, Germany},\n  Month                    = {May 24-27},\n  Pages                    = {449-460},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {kr94.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Temporal Reasoning in the Situation Calculus.\n \n \n \n \n\n\n \n Pinto, J.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Computer Science, University of Toronto, Toronto, Canada, January 1994.\n \n\n\n\n
\n\n\n\n \n \n \"TemporalPaper\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
@PhdThesis{Pinto94-Phd,\n  Title                    = {Temporal Reasoning in the Situation Calculus},\n  Author                   = {Pinto, Javier},\n  School                   = {Department of Computer Science, University of Toronto},\n  Year                     = {1994},\n\n  Address                  = {Toronto, Canada},\n  Month                    = {January},\n\n  File                     = {jpThesis.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/jpThesis.pdf:PDF;jpThesis.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/jpThesis.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/jpThesis.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {jpThesis.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1993\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An Approach to Modeling Indexicality in Action and Communication.\n \n \n \n \n\n\n \n Lespérance, Y.\n\n\n \n\n\n\n In In Reasoning about Mental States: Formal Theories and Applications, Papers from the 1993 AAAI Spring Symposium, pages 79–85, Stanford, CA, March 1993. AAAI Press\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\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{Lesperance93,\n  Title                    = {An Approach to Modeling Indexicality in Action and\n Communication},\n  Author                   = {Lesp\\'erance, Y.},\n  Booktitle                = {In Reasoning about Mental States: {F}ormal Theories\n and Applications, Papers from the 1993 AAAI Spring\n Symposium},\n  Year                     = {1993},\n\n  Address                  = {Stanford, CA},\n  Month                    = {March},\n  Pages                    = {79--85},\n  Publisher                = {AAAI Press},\n\n  File                     = {indexcomm.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/indexcomm.pdf:PDF;indexcomm.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/indexcomm.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/indexcomm.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {indexcomm.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Generating Tests using Abduction.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Fourth International Workshop on Principles of Diagnosis (DX'93), pages 223-235, Aberystwyth, Wales, UK, September 1993. \n \n\n\n\n
\n\n\n\n \n \n \"GeneratingPaper\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{dx93,\n  Title                    = {Generating Tests using Abduction},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Fourth International Workshop on Principles of Diagnosis (DX'93)},\n  Year                     = {1993},\n\n  Address                  = {Aberystwyth, Wales, UK},\n  Month                    = {September},\n  Pages                    = {223-235},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {dx93.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Temporal Reasoning in Logic Programming: A Case for the Situation Calculus.\n \n \n \n \n\n\n \n Pinto, J.; and Reiter, R.\n\n\n \n\n\n\n In Proc. of the 10th International Conference on Logic Programming, Budapest, Hungary, June 1993. \n \n\n\n\n
\n\n\n\n \n \n \"TemporalPaper\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{Pint93,\n  Title                    = {Temporal Reasoning in Logic Programming: {A} Case for\n the Situation Calculus},\n  Author                   = {Pinto, J. and Reiter, R.},\n  Booktitle                = {Proc. of the 10th International Conference on Logic\n Programming},\n  Year                     = {1993},\n\n  Address                  = {Budapest, Hungary},\n  Month                    = {June},\n\n  File                     = {temporal.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/temporal.pdf:PDF;temporal.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/temporal.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/temporal.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {temporal.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proving Properties of States in the Situation Calculus.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n Artificial Intelligence, 64: 337–351. 1993.\n \n\n\n\n
\n\n\n\n \n \n \"ProvingPaper\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{Reiter93,\n  Title                    = {Proving Properties of States in the Situation Calculus},\n  Author                   = {Reiter, Ray},\n  Journal                  = {Artificial Intelligence},\n  Year                     = {1993},\n  Pages                    = {337--351},\n  Volume                   = {64},\n\n  File                     = {induction.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/induction.pdf:PDF;induction.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/induction.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/induction.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {induction.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Frame Problem and Knowledge-Producing Actions.\n \n \n \n \n\n\n \n Scherl, R.; and Levesque, H.\n\n\n \n\n\n\n In Proceedings of AAAI-93, pages 689–695, Washington, DC, July 1993. AAAI Press/The MIT Press\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{Scherl93-KnowProdAct,\n  Title                    = {The Frame Problem and Knowledge-Producing Actions},\n  Author                   = {Scherl, R. and Levesque, Hector},\n  Booktitle                = {Proceedings of AAAI-93},\n  Year                     = {1993},\n\n  Address                  = {Washington, DC},\n  Month                    = {July},\n  Pages                    = {689--695},\n  Publisher                = {AAAI Press/The MIT Press},\n\n  Key                      = {CogRobo},\n  Timestamp                = {2018.09.23},\n  Url                      = {Scherl93-KnowProdAct.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1992\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Diagnosis as Refutation.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Third International Workshop on Principles of Diagnosis, pages 232-244, San Juan Islands, WA, USA, October 1992. \n \n\n\n\n
\n\n\n\n \n \n \"DiagnosisPaper\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{dx92,\n  Title                    = {Diagnosis as Refutation},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Third International Workshop on Principles of Diagnosis},\n  Year                     = {1992},\n\n  Address                  = {San Juan Islands, WA, USA},\n  Month                    = {October},\n  Pages                    = {232-244},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {dx92.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Tests for Hypothetical Reasoning.\n \n \n \n \n\n\n \n McIlraith, S.; and Reiter, R.\n\n\n \n\n\n\n Readings in Model-Based Diagnosis, pages 89-95. Hamschers, W.; de Kleer, J.; and Console, L., editor(s). Morgan Kaufmann, 1992.\n \n\n\n\n
\n\n\n\n \n \n \"ReadingsPaper\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
@InBook{readings,\n  Title                    = {Readings in Model-Based Diagnosis},\n  Author                   = {McIlraith, S. and Reiter, R.},\n  Chapter                  = {On Tests for Hypothetical Reasoning},\n  Editor                   = {Hamschers, W. and de Kleer, J. and Console, L.},\n  Pages                    = {89-95},\n  Publisher                = {Morgan Kaufmann},\n  Year                     = {1992},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {readings.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Projection Problem in the Situation Calculus: A Soundness and Completeness Result, with and Application to Database Updates.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n In Proceedings of the First International Conference on AI Planning Systems, pages 198–203, College Park, Maryland, June 15-17 1992. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{Reiter92a,\n  Title                    = {The Projection Problem in the Situation Calculus: A\n Soundness and Completeness Result, with and Application\n to Database Updates},\n  Author                   = {Reiter, Raymond},\n  Booktitle                = {Proceedings of the First International Conference on\n AI Planning Systems},\n  Year                     = {1992},\n\n  Address                  = {College Park, Maryland},\n  Month                    = {June 15-17},\n  Pages                    = {198--203},\n\n  File                     = {planconf.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/planconf.pdf:PDF;planconf.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/planconf.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/planconf.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {planconf.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Formalizing database evolution in the situation calculus.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n In Proc. of the International Conference on Fifth Generation Computer Systems, pages 600–609, Tokyo, Japan, June 1992. \n Invited paper\n\n\n\n
\n\n\n\n \n \n \"FormalizingPaper\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{Reiter92b,\n  Title                    = {Formalizing database evolution in the situation\n calculus},\n  Author                   = {Reiter, R.},\n  Booktitle                = {Proc. of the International Conference on Fifth\n Generation Computer Systems},\n  Year                     = {1992},\n\n  Address                  = {Tokyo, Japan},\n  Month                    = {June},\n  Note                     = {Invited paper},\n  Pages                    = {600--609},\n\n  File                     = {fgcs.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/fgcs.pdf:PDF;fgcs.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/fgcs.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/fgcs.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {fgcs.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n In formalizing database updates: preliminary report.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n In Proc. of the 3rd International Conference on Extending Database Technology, pages 10–20, Vienna, Austria, March 1992. \n Invited paper\n\n\n\n
\n\n\n\n \n \n \"InPaper\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{Reiter93c,\n  Title                    = {In formalizing database updates: preliminary report},\n  Author                   = {Reiter, R.},\n  Booktitle                = {Proc. of the 3rd International Conference on Extending\n Database Technology},\n  Year                     = {1992},\n\n  Address                  = {Vienna, Austria},\n  Month                    = {March},\n  Note                     = {Invited paper},\n  Pages                    = {10--20},\n\n  File                     = {edbt.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/edbt.pdf:PDF;edbt.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/edbt.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/edbt.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {edbt.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1991\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On Experiments for Hypothetical Reasoning.\n \n \n \n \n\n\n \n McIlraith, S.; and Reiter, R.\n\n\n \n\n\n\n In Proceedings of the Second International Workshop on Principles of Diagnosis (DX'91), pages 143-152, Milan, Italy, October 1991. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 11 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{dx91,\n  Title                    = {On Experiments for Hypothetical Reasoning},\n  Author                   = {McIlraith, S. and Reiter, R.},\n  Booktitle                = {Proceedings of the Second International Workshop on Principles of Diagnosis (DX'91)},\n  Year                     = {1991},\n\n  Address                  = {Milan, Italy},\n  Month                    = {October},\n  Pages                    = {143-152},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {dx91.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Frame Problem in the Situation Calculus: A Simple Solution (sometimes) and a Completeness Result for Goal Regression.\n \n \n \n \n\n\n \n Reiter, R.\n\n\n \n\n\n\n In Lifschitz, V., editor(s), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pages 359–380. Academic Press, San Diego, CA, 1991.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InCollection{Reiter91-SolFP,\n  Title                    = {The Frame Problem in the Situation Calculus: A Simple\n Solution (sometimes) and a Completeness Result for Goal\n Regression},\n  Author                   = {Reiter, Ray},\n  Booktitle                = {Artificial Intelligence and Mathematical Theory of\n Computation: Papers in Honor of John McCarthy},\n  Publisher                = {Academic Press},\n  Year                     = {1991},\n\n  Address                  = {San Diego, CA},\n  Editor                   = {Vladimir Lifschitz},\n  Pages                    = {359--380},\n\n  File                     = {simple.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/simple.pdf:PDF;simple.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/simple.ps:PostScript},\n  Key                      = {CogRobo},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/simple.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {simple.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1990\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Monotonic Solution of The Frame Problem in The Situation Calculus: An Efficient Method for Worlds with Fully Specified Actions.\n \n \n \n \n\n\n \n Schubert, L.\n\n\n \n\n\n\n In H. E. Kyburg, R. L.; and Carlson, G., editor(s), Knowledge Representation and Defeasible Reasoning, pages 23–67. Kluwer Academic Press, London, 1990.\n \n\n\n\n
\n\n\n\n \n \n \"MonotonicPaper\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
@InCollection{Schubert90,\n  Title                    = {Monotonic Solution of The Frame Problem in The\n Situation Calculus: An Efficient Method for Worlds with\n Fully Specified Actions},\n  Author                   = {Schubert, Lenhart},\n  Booktitle                = {Knowledge Representation and Defeasible Reasoning},\n  Publisher                = {Kluwer Academic Press},\n  Year                     = {1990},\n\n  Address                  = {London},\n  Editor                   = {H. E. Kyburg, R.P. Loui and G.N. Carlson},\n  Pages                    = {23--67},\n\n  Key                      = {CogRobo2},\n  Optnote                  = {\\\\ {\\sf Provides a solution to the frame problem by\n appealing to explanation closure axioms for worlds with\n fully specified actions. The inference of change and\n nonchange is monotonic and it is argue that explanation\n axioms are preferable to frame axioms.} },\n  Timestamp                = {2018.09.23},\n  Url                      = {Schubert90.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1989\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Qualitative Data Modeling: Application of a Mechanism for Interpreting Graphical Data.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n Computational Intelligence, 5(2): 111-120. May 1989.\n \n\n\n\n
\n\n\n\n \n \n \"QualitativePaper\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{data-model-ci89,\n  Title                    = {Qualitative Data Modeling: Application of a Mechanism \n for Interpreting Graphical Data},\n  Author                   = {McIlraith, S.},\n  Journal                  = {Computational Intelligence},\n  Year                     = {1989},\n\n  Month                    = {May},\n  Number                   = {2},\n  Pages                    = {111-120},\n  Volume                   = {5},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {data-model-ci89.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1988\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Qualitative Data Modeling: Application of a Mechanism for Interpreting Graphical Data.\n \n \n \n \n\n\n \n McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Canadian Artificial Intelligence Conference (CSCSI'88), June 1988. \n \n\n\n\n
\n\n\n\n \n \n \"QualitativePaper\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{cscsi88,\n  Title                    = {Qualitative Data Modeling: Application of a Mechanism for Interpreting Graphical Data},\n  Author                   = {McIlraith, S.},\n  Booktitle                = {Proceedings of the Canadian Artificial Intelligence Conference (CSCSI'88)},\n  Year                     = {1988},\n  Month                    = {June},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {cscsi88.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1987\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n The Process Planner PI: an Application of AI to Manufacturing.\n \n \n \n \n\n\n \n Chang, E.; Gamble, K.; Masrani, R.; and McIlraith, S.\n\n\n \n\n\n\n In IEEE Montech '87 Conference, October 1987. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{ieee87,\n  Title                    = {The Process Planner PI: an Application of AI to Manufacturing},\n  Author                   = {Chang, E.J.G. and Gamble, K. and Masrani, R. and McIlraith, S.},\n  Booktitle                = {IEEE Montech '87 Conference},\n  Year                     = {1987},\n  Month                    = {October},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {ieee87.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n ISIM: Towards an Integration of Artificial Intelligence and Simulation.\n \n \n \n \n\n\n \n Masrani, R.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Second AAAI Workshop on AI and Simulation, 1987. \n \n\n\n\n
\n\n\n\n \n \n \"ISIM: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{isim-87,\n  Title                    = {ISIM: Towards an Integration of Artificial Intelligence and Simulation},\n  Author                   = {Masrani, R. and McIlraith, S.},\n  Booktitle                = {Proceedings of the Second AAAI Workshop on AI and Simulation},\n  Year                     = {1987},\n\n  Timestamp                = {2018.09.23},\n  Url                      = {isim-87.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1985\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Formal Theory of Knowledge and Action.\n \n \n \n \n\n\n \n Moore, R.\n\n\n \n\n\n\n In Hobbs, J.; and Moore, R., editor(s), Formal Theories of the Commonsense World, pages 319–358. Ablex, Norwood, NJ., 1985.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\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
@InCollection{Moore85,\n  Title                    = {A Formal Theory of Knowledge and Action},\n  Author                   = {Moore, R.C.},\n  Booktitle                = {Formal Theories of the Commonsense World},\n  Publisher                = {Ablex},\n  Year                     = {1985},\n\n  Address                  = {Norwood, NJ.},\n  Editor                   = {Hobbs, J.R. and Moore, R.C.},\n  Pages                    = {319--358},\n\n  Key                      = {CogRobo2},\n  Optnote                  = {\\\\ {\\sf Describes a formal theory of knowledge and\n action based on a possible-world analysis of the\n former.} },\n  Timestamp                = {2018.09.23},\n  Url                      = {Moore85.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n \n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A semantics for cut in the situation calculus.\n \n \n \n \n\n\n \n Lin, F.\n\n\n \n\n\n\n .\n Draft\n\n\n\n
\n\n\n\n \n \n \"APaper\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
@Unpublished{Lin-Un1,\n  Title                    = {A semantics for cut in the situation calculus},\n  Author                   = {Lin, F.},\n  Note                     = {Draft},\n  Year                     = { },\n\n  File                     = {cut.pdf:http\\://www.cs.toronto.edu/cogrobo/Papers/cut.pdf:PDF;cut.ps:http\\://www.cs.toronto.edu/cogrobo/Papers/cut.ps:PostScript},\n  Key                      = {CogRobo-UN},\n  Opturl                   = {http://www.cs.toronto.edu/cogrobo/Papers/cut.ps.gz},\n  Timestamp                = {2018.09.23},\n  Url                      = {cut.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 \n \n \n\n
\n"}; document.write(bibbase_data.data);