var bibbase_data = {"data":"\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 Excellent! Next, you can embed this page using\n one of several \n options.\n
\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.
  4. \n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2013\n \n \n (7)\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 Klebanov, V.; Manthey, N.; and Muise, C.\n \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 bibtex \n \n \n \n\n \n\n \n  \n \n 55 downloads\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  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 \n Flexible Execution of Partial Order Plans With Temporal Constraints.\n \n\n\n \n Muise, C.; Beck, J. C.; and Mcilraith, S. A.\n \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 bibtex \n \n \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
@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  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 \n \n Reasoning about Continuous Uncertainty in the Situation Calculus.\n \n\n\n \n Belle, V.; and Levesque, H. J.\n \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 bibtex \n \n \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
@inproceedings{bellelev13,\n\tAuthor = {V. Belle and H. J. Levesque},\n\tBooktitle = {Proc. IJCAI},\n\tDate-Added = {2013-05-09 18:21:09 -0400},\n\tDate-Modified = {2013-06-10 15:31:43 -0400},\n\tTitle = {Reasoning about Continuous Uncertainty in the Situation Calculus},\n\tUrl = {https://dl.dropboxusercontent.com/u/1282419/Papers/ijcai13.pdf},\n\tYear = {2013},\n\tBdsk-Url-1 = {http://d.pr/f/dcy6}}\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 Belle, V.; and Levesque, H. J.\n \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 bibtex \n \n \n \n\n \n\n \n  \n \n 17 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{bellevmotionkinematics,\n\tAuthor = {V. Belle and H. J. Levesque},\n\tBooktitle = {Workshop on Nonmonotonic Reasoning, Action and Change},\n\tDate-Added = {2013-05-23 10:48:57 -0400},\n\tDate-Modified = {2013-06-10 15:35:32 -0400},\n\tTitle = {Reasoning about Motion Kinematics with Continuous Uncertainty in the Situation Calculus},\n\tUrl = {https://dl.dropboxusercontent.com/u/1282419/Papers/nrac13.pdf},\n\tYear = {2013},\n\tBdsk-Url-1 = {http://d.pr/f/A7Uy}}\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 Belle, V.; and Levesque, H. J.\n \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 bibtex \n \n \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
@inproceedings{BelleLevreg,\n\tAuthor = {V. Belle and H. J. Levesque},\n\tBooktitle = {Proc. Uncertainty in Artificial Intelligence (UAI)},\n\tDate-Added = {2013-05-09 18:21:09 -0400},\n\tDate-Modified = {2013-06-10 15:33:56 -0400},\n\tTitle = {Reasoning about Probabilities in Dynamic Systems using Goal Regression},\n\tUrl = {https://dl.dropboxusercontent.com/u/1282419/Papers/uai13.pdf},\n\tYear = {2013},\n\tBdsk-Url-1 = {http://d.pr/f/z2Jd}}\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 Belle, V.; and Levesque, H. J.\n \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 bibtex \n \n \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
@inproceedings{bellelevcs,\n\tAuthor = {V. Belle and H. J. Levesque},\n\tBooktitle = {Symposium on Logical Formalizations of Commonsense Reasoning},\n\tDate-Added = {2013-05-09 18:21:09 -0400},\n\tDate-Modified = {2013-06-10 15:34:21 -0400},\n\tTitle = {Robot Location Estimation in the Situation Calculus},\n\tUrl = {https://dl.dropboxusercontent.com/u/1282419/Papers/commonsense13.pdf},\n\tYear = {2013},\n\tBdsk-Url-1 = {http://d.pr/f/z2Jd}}\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 Drummond, J.; and Boutilier, C.\n \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 bibtex \n \n \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
@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  pages={97--105},\n  year={2013},\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 2012\n \n \n (33)\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 Chalkiadakis, G.; and Boutilier, C.\n \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 bibtex \n \n \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
@article{DBLP:journals/aamas/ChalkiadakisB12,\n  author    = {Georgios Chalkiadakis and\n               Craig Boutilier},\n  title     = {Sequentially optimal repeated coalition formation under\n               uncertainty},\n  journal   = {Autonomous Agents and Multi-Agent Systems},\n  volume    = {24},\n  number    = {3},\n  year      = {2012},\n  pages     = {441-484},\n  ee        = {http://dx.doi.org/10.1007/s10458-010-9157-y},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Hoey, J.; Boutilier, C.; Poupart, P.; Olivier, P.; Monk, A.; and Mihailidis, A.\n \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 bibtex \n \n \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
@article{DBLP:journals/tiis/HoeyBPOMM12,\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  title     = {People, sensors, decisions: Customizable and adaptive technologies\n               for assistance in healthcare},\n  journal   = {TiiS},\n  volume    = {2},\n  number    = {4},\n  year      = {2012},\n  pages     = {20},\n  ee        = {http://doi.acm.org/10.1145/2395123.2395125},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.; and Procaccia, A. D.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/aaai/BoutilierP12,\n  author    = {Craig Boutilier and\n               Ariel D. Procaccia},\n  title     = {A Dynamic Rationalization of Distance Rationalizability},\n  booktitle = {Proceedings of the Twenty-Sixth AAAI Conference on Artificial\n               Intelligence, July 22-26, 2012, Toronto, Ontario, Canada},\n  year      = {2012},\n  ee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4930},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.\n \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 \"ElicitingLink\n  \n \n\n \n\n bibtex \n \n \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
@inproceedings{DBLP:conf/aamas/Boutilier12,\n  author    = {Craig Boutilier},\n  title     = {Eliciting forecasts from self-interested experts: scoring\n               rules for decision makers},\n  booktitle = {International Conference on Autonomous Agents and Multiagent\n               Systems, AAMAS 2012, Valencia, Spain, June 4-8, 2012 (3\n               Volumes)},\n  year      = {2012},\n  pages     = {737-744},\n  ee        = {http://dl.acm.org/citation.cfm?id=2343802},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.; Caragiannis, I.; Haber, S.; Lu, T.; Procaccia, A. D.; and Sheffet, O.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/sigecom/BoutilierCHLPS12,\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  title     = {Optimal social choice functions: a utilitarian view},\n  booktitle = {ACM Conference on Electronic Commerce, EC '12, Valencia,\n               Spain, June 4-8, 2012},\n  year      = {2012},\n  pages     = {197-214},\n  ee        = {http://doi.acm.org/10.1145/2229012.2229030},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Lu, T.; and Boutilier, C.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/sigecom/LuB12,\n  author    = {Tyler Lu and\n               Craig Boutilier},\n  title     = {Matching models for preference-sensitive group purchasing},\n  booktitle = {ACM Conference on Electronic Commerce, EC '12, Valencia,\n               Spain, June 4-8, 2012},\n  year      = {2012},\n  pages     = {723-740},\n  ee        = {http://doi.acm.org/10.1145/2229012.2229068},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Lu, T.; Tang, P.; Procaccia, A. D.; and Boutilier, C.\n \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 \"BayesianLink\n  \n \n\n \n\n bibtex \n \n \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
@inproceedings{DBLP:conf/uai/LuTPB12,\n  author    = {Tyler Lu and\n               Pingzhong Tang and\n               Ariel D. Procaccia and\n               Craig Boutilier},\n  title     = {Bayesian Vote Manipulation: Optimal Strategies and Impact\n               on Welfare},\n  booktitle = {Proceedings of the Twenty-Eighth Conference on Uncertainty\n               in Artificial Intelligence, Catalina Island, CA, USA, August\n               14-18, 2012},\n  year      = {2012},\n  pages     = {543-553},\n  ee        = {http://uai.sis.pitt.edu/displayArticleDetails.jsp?mmnu=1{\\&}smnu=2{\\&}article_id=2314{\\&}proceeding_id=28},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Charlin, L.; Zemel, R. S.; and Boutilier, C.\n \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 bibtex \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-1202-3706,\n  author    = {Laurent Charlin and\n               Richard S. Zemel and\n               Craig Boutilier},\n  title     = {A Framework for Optimizing Paper Matching},\n  journal   = {CoRR},\n  volume    = {abs/1202.3706},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1202.3706},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Regan, K.; and Boutilier, C.\n \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 bibtex \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  author    = {Kevin Regan and\n               Craig Boutilier},\n  title     = {Regret-based Reward Elicitation for Markov Decision Processes},\n  journal   = {CoRR},\n  volume    = {abs/1205.2619},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1205.2619},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Hui, B.; and Boutilier, C.\n \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 bibtex \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  author    = {Bowen Hui and\n               Craig Boutilier},\n  title     = {Toward Experiential Utility Elicitation for Interface Customization},\n  journal   = {CoRR},\n  volume    = {abs/1206.3258},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1206.3258},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Charlin, L.; Zemel, R. S.; and Boutilier, C.\n \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 bibtex \n \n \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
@article{DBLP:journals/corr/abs-1206-4647,\n  author    = {Laurent Charlin and\n               Richard S. Zemel and\n               Craig Boutilier},\n  title     = {Active Learning for Matching Problems},\n  journal   = {CoRR},\n  volume    = {abs/1206.4647},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1206.4647},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Braziunas, D.; and Boutilier, C.\n \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 bibtex \n \n \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
@article{DBLP:journals/corr/abs-1206-5255,\n  author    = {Darius Braziunas and\n               Craig Boutilier},\n  title     = {Minimax regret based elicitation of generalized additive\n               utilities},\n  journal   = {CoRR},\n  volume    = {abs/1206.5255},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1206.5255},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Braziunas, D.; and Boutilier, C.\n \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 bibtex \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  author    = {Darius Braziunas and\n               Craig Boutilier},\n  title     = {Local Utility Elicitation in GAI Models},\n  journal   = {CoRR},\n  volume    = {abs/1207.1361},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1207.1361},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Sanner, S.; and Boutilier, C.\n \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 bibtex \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  author    = {Scott Sanner and\n               Craig Boutilier},\n  title     = {Approximate Linear Programming for First-order MDPs},\n  journal   = {CoRR},\n  volume    = {abs/1207.1415},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1207.1415},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Hyafil, N.; and Boutilier, C.\n \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 bibtex \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  author    = {Nathanael Hyafil and\n               Craig Boutilier},\n  title     = {Regret Minimizing Equilibria and Mechanisms for Games with\n               Strict Type Uncertainty},\n  journal   = {CoRR},\n  volume    = {abs/1207.4147},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1207.4147},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Lu, T.; Tang, P.; Procaccia, A. D.; and Boutilier, C.\n \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 bibtex \n \n \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
@article{DBLP:journals/corr/abs-1210-4895,\n  author    = {Tyler Lu and\n               Pingzhong Tang and\n               Ariel D. Procaccia and\n               Craig Boutilier},\n  title     = {Bayesian Vote Manipulation: Optimal Strategies and Impact\n               on Welfare},\n  journal   = {CoRR},\n  volume    = {abs/1210.4895},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1210.4895},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.; Zemel, R. S.; and Marlin, B. M.\n \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 bibtex \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  author    = {Craig Boutilier and\n               Richard S. Zemel and\n               Benjamin M. Marlin},\n  title     = {Active Collaborative Filtering},\n  journal   = {CoRR},\n  volume    = {abs/1212.2442},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1212.2442},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.; Das, R.; Kephart, J. O.; Tesauro, G.; and Walsh, W. E.\n \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 bibtex \n \n \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
@article{DBLP:journals/corr/abs-1212-2443,\n  author    = {Craig Boutilier and\n               Rajarshi Das and\n               Jeffrey O. Kephart and\n               Gerald Tesauro and\n               William E. Walsh},\n  title     = {Cooperative Negotiation in Autonomic Systems using Incremental\n               Utility Elicitation},\n  journal   = {CoRR},\n  volume    = {abs/1212.2443},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1212.2443},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Zhang, L.; and Bacchus, F.\n \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 bibtex \n \n \n \n\n \n\n \n  \n \n 83 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/aaai/ZhangB12,\n  author    = {Lei Zhang and\n               Fahiem Bacchus},\n  title     = {MAXSAT Heuristics for Cost Optimal Planning},\n  booktitle = {Proceedings of the Twenty-Sixth AAAI Conference on Artificial\n               Intelligence, July 22-26, 2012, Toronto, Ontario, Canada},\n  year      = {2012},\n  ee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/5190},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Goultiaeva, A.; and Bacchus, F.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/sat/GoultiaevaB12,\n  author    = {Alexandra Goultiaeva and\n               Fahiem Bacchus},\n  title     = {Off the Trail: Re-examining the CDCL Algorithm},\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  ee        = {http://dx.doi.org/10.1007/978-3-642-31612-8_4},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Bacchus, F.; and Jaakkola, T.\n \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 bibtex \n \n \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
@article{DBLP:journals/corr/abs-1208-5159,\n  author    = {Fahiem Bacchus and\n               Tommi Jaakkola},\n  title     = {Proceedings of the Twenty-First Conference on Uncertainty\n               in Artificial Intelligence (2005)},\n  journal   = {CoRR},\n  volume    = {abs/1208.5159},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1208.5159},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\n
\n
\n\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 Bacchus, F.; Dalmao, S.; and Pitassi, T.\n \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 bibtex \n \n \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
@article{DBLP:journals/corr/abs-1212-2452,\n  author    = {Fahiem Bacchus and\n               Shannon Dalmao and\n               Toniann Pitassi},\n  title     = {Value Elimination: Bayesian Inference via Backtracking Search},\n  journal   = {CoRR},\n  volume    = {abs/1212.2452},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1212.2452},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Levesque, H. J.; and Lakemeyer, G.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/birthday/LevesqueL12,\n  author    = {Hector J. Levesque and\n               Gerhard Lakemeyer},\n  title     = {The Truth about Defaults},\n  booktitle = {Correct Reasoning},\n  year      = {2012},\n  pages     = {422-435},\n  ee        = {http://dx.doi.org/10.1007/978-3-642-30743-0_29},\n  crossref  = {DBLP:conf/birthday/2012lifschitz},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Delgrande, J. P.; and Levesque, H. J.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/kr/DelgrandeL12,\n  author    = {James P. Delgrande and\n               Hector J. Levesque},\n  title     = {Belief Revision with Sensing and Fallible Actions},\n  booktitle = {KR},\n  year      = {2012},\n  ee        = {http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4528},\n  crossref  = {DBLP:conf/kr/2012},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Lakemeyer, G.; and Levesque, H. J.\n \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 bibtex \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  author    = {Gerhard Lakemeyer and\n               Hector J. Levesque},\n  title     = {Only-Knowing Meets Nonmonotonic Modal Logic},\n  booktitle = {KR},\n  year      = {2012},\n  ee        = {http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4507},\n  crossref  = {DBLP:conf/kr/2012},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Levesque, H. J.; Davis, E.; and Morgenstern, L.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/kr/LevesqueDM12,\n  author    = {Hector J. Levesque and\n               Ernest Davis and\n               Leora Morgenstern},\n  title     = {The Winograd Schema Challenge},\n  booktitle = {KR},\n  year      = {2012},\n  ee        = {http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4492},\n  crossref  = {DBLP:conf/kr/2012},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Juma, F.; Hsu, E. I.; and McIlraith, S. A.\n \n\n\n \n\n\n\n In Canadian Conference on AI, pages 109-120, 2012. \n \n\n\n\n
\n\n\n \n \n \n \"Preference-BasedLink\n  \n \n\n \n\n bibtex \n \n \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
@inproceedings{DBLP:conf/ai/JumaHM12,\n  author    = {Farah Juma and\n               Eric I. Hsu and\n               Sheila A. McIlraith},\n  title     = {Preference-Based Planning via MaxSAT},\n  booktitle = {Canadian Conference on AI},\n  year      = {2012},\n  pages     = {109-120},\n  ee        = {http://dx.doi.org/10.1007/978-3-642-30353-1_10},\n  crossref  = {DBLP:conf/ai/2012},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\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 Brewka, G.; Eiter, T.; and McIlraith, S. A.\n , editor\n s.\n \n\n\n \n\n\n\n 2012.AAAI Press.\n \n\n\n\n
\n\n\n \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/kr/2012,\n  editor    = {Gerhard Brewka and\n               Thomas Eiter and\n               Sheila A. McIlraith},\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  booktitle = {KR},\n  publisher = {AAAI Press},\n  year      = {2012},\n  isbn      = {978-1-57735-560-1},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Fritz, C.; and McIlraith, S. A.\n \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 bibtex \n \n \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
@article{DBLP:journals/corr/abs-1205-2647,\n  author    = {Christian Fritz and\n               Sheila A. McIlraith},\n  title     = {Generating Optimal Plans in Highly-Dynamic Domains},\n  journal   = {CoRR},\n  volume    = {abs/1205.2647},\n  year      = {2012},\n  ee        = {http://arxiv.org/abs/1205.2647},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Muise, C.; McIlraith, S. A.; and Beck, J. C.\n \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 bibtex \n \n \n \n  \n \n abstract \n \n\n \n\n \n  \n \n 47 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{muise-icaps12-long,\nabstract = {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.},\nauthor = {Muise, Christian and McIlraith, Sheila A. and Beck, J. Christopher},\nbooktitle = {The 22nd International Conference on Automated Planning and Scheduling},\nfile = {: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},\nkeywords = {personal},\nmendeley-tags = {personal},\nseries = {The 22nd International Conference on Automated Planning and Scheduling},\ntitle = {{Improved Non-deterministic Planning by Exploiting State Relevance}},\ntype = {Conference Proceedings},\nyear = {2012},\nurl = {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 \n Optimally Relaxing Partial-order Plans With MaxSAT.\n \n\n\n \n Muise, C.; McIlratih, S. A.; and Beck, J. C.\n \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 bibtex \n \n \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
@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  url={http://tidel.mie.utoronto.ca/pubs/muise_MaxSATICAPS2012.pdf},\n  year={2012}\n}\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 Muise, C.; Mcilraith, S. A.; Beck, J. C.; and Hsu, E.\n \n\n\n \n\n\n\n In Canadian Conference on Artificial Intelligence, 2012. \n \n\n\n\n
\n\n\n \n \n \n \"DSHARP:Paper\n  \n \n\n \n\n bibtex \n \n \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
@inproceedings{Muise2012,\nauthor = {Muise, Christian and Mcilraith, Sheila A. and Beck, J. Christopher and Hsu, Eric},\nbooktitle = {Canadian Conference on Artificial Intelligence},\nfile = {:home/cjmuise/Documents/Mendeley Desktop/Canadian Conference on Artificial Intelligence/2012/DSHARP Fast d-DNNF Compilation with sharpSAT.pdf:pdf},\ntitle = {{DSHARP: Fast d-DNNF Compilation with sharpSAT}},\nurl = {http://tidel.mie.utoronto.ca/pubs/MuiseDSHARP_AI2012.pdf},\nyear = {2012}\n}\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 De Giacomo, G.; Lespérance, Y.; and Muise, C.\n \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 bibtex \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  pages={1031--1038},\n  year={2012},\n  organization={International Foundation for Autonomous Agents and Multiagent Systems},\n  url={http://www.cse.yorku.ca/~lesperan/papers/AAMAS12.pdf},\n  keywords={golog}\n}\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 A Semantical Account of Progression in the Presence of Uncertainty.\n \n\n\n \n Belle, V.; and Lakemeyer, G.\n \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 bibtex \n \n \n \n  \n \n abstract \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
@inproceedings{KBSG_220,\n\tAbstract = {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\turl = {http://kbsg.rwth-aachen.de/fileskbsg/prog-noisy.pdf},\n\tAuthor = {Belle, Vaishak and Lakemeyer, Gerhard},\n\tBooktitle = {Proc. AAAI},\n\tDate-Added = {2011-05-16 13:15:50 +0200},\n\tDate-Modified = {2012-02-22 14:53:45 +0000},\n\tPages = {165-170},\n\tTitle = {A Semantical Account of Progression in the Presence of Uncertainty},\n\tYear = {2011}}\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 \n Multi-Agent Only-Knowing.\n \n\n\n \n Belle, V.; and Lakemeyer, G.\n \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 bibtex \n \n \n \n\n  \n\n \n buy\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
@incollection{bellelakbook,\n\tAuthor = {Vaishak Belle and Gerhard Lakemeyer},\n\tBooktitle = {Knowing, Reasoning, and Acting: Essays in Honour of Hector J. Levesque},\n\tDate-Added = {2011-11-20 10:23:08 +0000},\n\tDate-Modified = {2012-02-27 12:00:41 +0100},\n\tEditor = {Gerhard Lakemeyer and Sheila A. McIlraith},\n\tPages = {67-86},\n\tPublisher = {College Publications},\n\tTitle = {Multi-Agent Only-Knowing},\n\tYear = {2011}}\n\n
\n
\n\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 Belle, V.; and Lakemeyer, G.\n \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 bibtex \n \n \n \n  \n \n abstract \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
@inproceedings{KBSG_219,\n\tAbstract = {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\turl = {http://kbsg.rwth-aachen.de/fileskbsg/ijcai11.pdf},\n\tAuthor = {Belle, Vaishak and Lakemeyer, Gerhard},\n\tBooktitle = {Proc. IJCAI},\n\tDate-Added = {2011-05-16 13:15:30 +0200},\n\tDate-Modified = {2012-02-22 14:52:49 +0000},\n\tPages = {255-260},\n\tTitle = {On Progression and Query Evaluation in First-Order Knowledge Bases with Function Symbols},\n\tYear = {2011}}\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 \n \n Efficiency and Privacy Tradeoffs in Mechanism Design.\n \n\n\n \n Sui, X.; and Boutilier, C.\n \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 bibtex \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  author    = {Xin Sui and\n               Craig Boutilier},\n  title     = {Efficiency and Privacy Tradeoffs in Mechanism Design},\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  ee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3527},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Viappiani, P.; and Boutilier, C.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/aaai/ViappianiB11,\n  author    = {Paolo Viappiani and\n               Craig Boutilier},\n  title     = {Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation\n               Tradeoff!},\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  ee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3592},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Viappiani, P.; Zilles, S.; Hamilton, H. J.; and Boutilier, C.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/aaai/ViappianiZHB11,\n  author    = {Paolo Viappiani and\n               Sandra Zilles and\n               Howard J. Hamilton and\n               Craig Boutilier},\n  title     = {A Bayesian Concept Learning Approach to Crowdsourcing},\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  ee        = {http://www.aaai.org/ocs/index.php/WS/AAAIW11/paper/view/3807},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Lu, T.; and Boutilier, C.\n \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 bibtex \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  author    = {Tyler Lu and\n               Craig Boutilier},\n  title     = {Vote Elicitation with Probabilistic Preference Models: Empirical\n               Estimation and Cost Tradeoffs},\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  ee        = {http://dx.doi.org/10.1007/978-3-642-24873-3_11},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Viappiani, P.; Zilles, S.; Hamilton, H. J.; and Boutilier, C.\n \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 bibtex \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  author    = {Paolo Viappiani and\n               Sandra Zilles and\n               Howard J. Hamilton and\n               Craig Boutilier},\n  title     = {Learning Complex Concepts Using Crowdsourcing: A Bayesian\n               Approach},\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  ee        = {http://dx.doi.org/10.1007/978-3-642-24873-3_21},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.\n \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 bibtex \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  author    = {Craig Boutilier},\n  title     = {Preference Elicitation and Preference Learning in Social\n               Choice},\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  ee        = {http://dx.doi.org/10.1007/978-3-642-21311-3_1},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\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 Lu, T.; and Boutilier, C.\n \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 bibtex \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  author    = {Tyler Lu and\n               Craig Boutilier},\n  title     = {Learning Mallows Models with Pairwise Preferences},\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  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Lu, T.; and Boutilier, C.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/ijcai/LuB11,\n  author    = {Tyler Lu and\n               Craig Boutilier},\n  title     = {Budgeted Social Choice: From Consensus to Personalized Decision\n               Making},\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  ee        = {http://ijcai.org/papers11/Papers/IJCAI11-057.pdf},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Lu, T.; and Boutilier, C.\n \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 bibtex \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  author    = {Tyler Lu and\n               Craig Boutilier},\n  title     = {Robust Approximation and Incremental Elicitation in Voting\n               Protocols},\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  ee        = {http://ijcai.org/papers11/Papers/IJCAI11-058.pdf},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Regan, K.; and Boutilier, C.\n \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 bibtex \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  author    = {Kevin Regan and\n               Craig Boutilier},\n  title     = {Eliciting Additive Reward Functions for Markov Decision\n               Processes},\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  ee        = {http://ijcai.org/papers11/Papers/IJCAI11-360.pdf},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Regan, K.; and Boutilier, C.\n \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 bibtex \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  author    = {Kevin Regan and\n               Craig Boutilier},\n  title     = {Robust Online Optimization of Reward-Uncertain MDPs},\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  ee        = {http://ijcai.org/papers11/Papers/IJCAI11-361.pdf},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Charlin, L.; Zemel, R. S.; and Boutilier, C.\n \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 bibtex \n \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  author    = {Laurent Charlin and\n               Richard S. Zemel and\n               Craig Boutilier},\n  title     = {A Framework for Optimizing Paper Matching},\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  ee        = {http://uai.sis.pitt.edu/displayArticleDetails.jsp?mmnu=1{\\&}smnu=2{\\&}article_id=2195{\\&}proceeding_id=27},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.; Dean, T.; and Hanks, S.\n \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 bibtex \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  author    = {Craig Boutilier and\n               Thomas Dean and\n               Steve Hanks},\n  title     = {Decision-Theoretic Planning: Structural Assumptions and\n               Computational Leverage},\n  journal   = {CoRR},\n  volume    = {abs/1105.5460},\n  year      = {2011},\n  ee        = {http://arxiv.org/abs/1105.5460},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.; and Brafman, R. I.\n \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 bibtex \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  author    = {Craig Boutilier and\n               Ronen I. Brafman},\n  title     = {Partial-Order Planning with Concurrent Interacting Actions},\n  journal   = {CoRR},\n  volume    = {abs/1106.0249},\n  year      = {2011},\n  ee        = {http://arxiv.org/abs/1106.0249},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.; and Price, B.\n \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 bibtex \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  author    = {Craig Boutilier and\n               Bob Price},\n  title     = {Accelerating Reinforcement Learning through Implicit Imitation},\n  journal   = {CoRR},\n  volume    = {abs/1106.0681},\n  year      = {2011},\n  ee        = {http://arxiv.org/abs/1106.0681},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.\n \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 bibtex \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  author    = {Craig Boutilier},\n  title     = {Eliciting Forecasts from Self-interested Experts: Scoring\n               Rules for Decision Makers},\n  journal   = {CoRR},\n  volume    = {abs/1106.2489},\n  year      = {2011},\n  ee        = {http://arxiv.org/abs/1106.2489},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.; Brafman, R. I.; Domshlak, C.; Hoos, H. H.; and Poole, D.\n \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 bibtex \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  author    = {Craig Boutilier and\n               Ronen I. Brafman and\n               Carmel Domshlak and\n               Holger H. Hoos and\n               David Poole},\n  title     = {CP-nets: A Tool for Representing and Reasoning withConditional\n               Ceteris Paribus Preference Statements},\n  journal   = {CoRR},\n  volume    = {abs/1107.0023},\n  year      = {2011},\n  ee        = {http://arxiv.org/abs/1107.0023},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Davies, J.; and Bacchus, F.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/cp/DaviesB11,\n  author    = {Jessica Davies and\n               Fahiem Bacchus},\n  title     = {Solving MAXSAT by Solving a Sequence of Simpler SAT Instances},\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  ee        = {http://dx.doi.org/10.1007/978-3-642-23786-7_19},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Goultiaeva, A.; Gelder, A. V.; and Bacchus, F.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/ijcai/GoultiaevaGB11,\n  author    = {Alexandra Goultiaeva and\n               Allen Van Gelder and\n               Fahiem Bacchus},\n  title     = {A Uniform Approach for Generating Proofs and Strategies\n               for Both True and False QBF Formulas},\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  ee        = {http://ijcai.org/papers11/Papers/IJCAI11-099.pdf},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\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 Bacchus, F.; Domshlak, C.; Edelkamp, S.; and Helmert, M.\n , editor\n s.\n \n\n\n \n\n\n\n 2011.AAAI.\n \n\n\n\n
\n\n\n \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\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
@proceedings{DBLP:conf/aips/2011,\n  editor    = {Fahiem Bacchus and\n               Carmel Domshlak and\n               Stefan Edelkamp and\n               Malte Helmert},\n  title     = {Proceedings of the 21st International Conference on Automated\n               Planning and Scheduling, ICAPS 2011, Freiburg, Germany June\n               11-16, 2011},\n  booktitle = {ICAPS},\n  publisher = {AAAI},\n  year      = {2011},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Poole, D.; Bacchus, F.; and Kisynski, J.\n \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 bibtex \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  author    = {David Poole and\n               Fahiem Bacchus and\n               Jacek Kisynski},\n  title     = {Towards Completely Lifted Search-based Probabilistic Inference},\n  journal   = {CoRR},\n  volume    = {abs/1107.4035},\n  year      = {2011},\n  ee        = {http://arxiv.org/abs/1107.4035},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\n
\n
\n\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 Bacchus, F.\n \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 bibtex \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  author    = {Fahiem Bacchus},\n  title     = {The Power of Modeling - a Response to PDDL2.1},\n  journal   = {CoRR},\n  volume    = {abs/1110.2729},\n  year      = {2011},\n  ee        = {http://arxiv.org/abs/1110.2729},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Lakemeyer, G.; and Levesque, H. J.\n \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 bibtex \n \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  author    = {Gerhard Lakemeyer and\n               Hector J. Levesque},\n  title     = {A semantic characterization of a useful fragment of the\n               situation calculus with knowledge},\n  journal   = {Artif. Intell.},\n  volume    = {175},\n  number    = {1},\n  year      = {2011},\n  pages     = {142-164},\n  ee        = {http://dx.doi.org/10.1016/j.artint.2010.04.005},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Shapiro, S.; Pagnucco, M.; Lespérance, Y.; and Levesque, H. J.\n \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 bibtex \n \n \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
@article{DBLP:journals/ai/ShapiroPLL11,\n  author    = {Steven Shapiro and\n               Maurice Pagnucco and\n               Yves Lesp{\\'e}rance and\n               Hector J. Levesque},\n  title     = {Iterated belief change in the situation calculus},\n  journal   = {Artif. Intell.},\n  volume    = {175},\n  number    = {1},\n  year      = {2011},\n  pages     = {165-192},\n  ee        = {http://dx.doi.org/10.1016/j.artint.2010.04.003},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Levesque, H. J.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/aaaiss/Levesque11,\n  author    = {Hector J. Levesque},\n  title     = {The Winograd Schema Challenge},\n  booktitle = {AAAI Spring Symposium: Logical Formalizations of Commonsense\n               Reasoning},\n  year      = {2011},\n  ee        = {http://www.aaai.org/ocs/index.php/SSS/SSS11/paper/view/2502},\n  crossref  = {DBLP:conf/aaaiss/2011-6},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n
\n
\n\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 Giacomo, G. D.; Lespérance, Y.; and Levesque, H. J.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/ijcai/GiacomoLL11,\n  author    = {Giuseppe De Giacomo and\n               Yves Lesp{\\'e}rance and\n               Hector J. Levesque},\n  title     = {Efficient Reasoning in Proper Knowledge Bases with Unknown\n               Individuals},\n  booktitle = {IJCAI},\n  year      = {2011},\n  pages     = {827-832},\n  ee        = {http://ijcai.org/papers11/Papers/IJCAI11-144.pdf},\n  crossref  = {DBLP:conf/ijcai/2011},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Hu, Y.; and Levesque, H. J.\n \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 bibtex \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  author    = {Yuxiao Hu and\n               Hector J. Levesque},\n  title     = {A Correctness Result for Reasoning about One-Dimensional\n               Planning Problems},\n  booktitle = {IJCAI},\n  year      = {2011},\n  pages     = {2638-2643},\n  ee        = {http://ijcai.org/papers11/Papers/IJCAI11-439.pdf},\n  crossref  = {DBLP:conf/ijcai/2011},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Morgenstern, L.; and McIlraith, S. A.\n \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 bibtex \n \n \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
@article{DBLP:journals/ai/MorgensternM11,\n  author    = {Leora Morgenstern and\n               Sheila A. McIlraith},\n  title     = {John McCarthy's legacy},\n  journal   = {Artif. Intell.},\n  volume    = {175},\n  number    = {1},\n  year      = {2011},\n  pages     = {1-24},\n  ee        = {http://dx.doi.org/10.1016/j.artint.2010.11.003},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Bienvenu, M.; Fritz, C.; and McIlraith, S. A.\n \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 bibtex \n \n \n \n\n \n\n \n  \n \n 23 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/ai/BienvenuFM11,\n  author    = {Meghyn Bienvenu and\n               Christian Fritz and\n               Sheila A. McIlraith},\n  title     = {Specifying and computing preferred plans},\n  journal   = {Artif. Intell.},\n  volume    = {175},\n  number    = {7-8},\n  year      = {2011},\n  pages     = {1308-1345},\n  ee        = {http://dx.doi.org/10.1016/j.artint.2010.11.021},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Liaskos, S.; McIlraith, S. A.; Sohrabi, S.; and Mylopoulos, J.\n \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 bibtex \n \n \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
@article{DBLP:journals/re/LiaskosMSM11,\n  author    = {Sotirios Liaskos and\n               Sheila A. McIlraith and\n               Shirin Sohrabi and\n               John Mylopoulos},\n  title     = {Representing and reasoning about preferences in requirements\n               engineering},\n  journal   = {Requir. Eng.},\n  volume    = {16},\n  number    = {3},\n  year      = {2011},\n  pages     = {227-249},\n  ee        = {http://dx.doi.org/10.1007/s00766-011-0129-9},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Sohrabi, S.; Baier, J. A.; and McIlraith, S. A.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/aaai/SohrabiBM11,\n  author    = {Shirin Sohrabi and\n               Jorge A. Baier and\n               Sheila A. McIlraith},\n  title     = {Preferred Explanations: Theory and Generation via Planning},\n  booktitle = {AAAI},\n  year      = {2011},\n  ee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3568},\n  crossref  = {DBLP:conf/aaai/2011},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Muise, C.; McIlraith, S. A.; and Beck, J. C.\n \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 bibtex \n \n \n \n  \n \n abstract \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
@inproceedings{muise-ijcai11,\nabstract = {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.},\nauthor = {Muise, Christian and McIlraith, Sheila A. and Beck, J. Christopher},\nbooktitle = {International Joint Conference On Artificial Intelligence},\nfile = {:home/cjmuise/Documents/Mendeley Desktop/International Joint Conference On Artificial Intelligence/2011/Monitoring the Execution of Partial-Order Plans via Regression.pdf:pdf},\nkeywords = {personal},\nmendeley-tags = {personal},\nseries = {International Joint Conference On Artificial Intelligence},\ntitle = {{Monitoring the Execution of Partial-Order Plans via Regression}},\ntype = {Conference Proceedings},\nyear = {2011},\nurl = {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 \n Optimization of Partial-Order Plans via MaxSAT.\n \n\n\n \n Muise, C.; McIlratih, S. A.; and Beck, J. C.\n \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 bibtex \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  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 \n Agent Supervision in Situation-Determined ConGolog.\n \n\n\n \n De Giacomo, G.; Lesperance, Y.; and Muise, C.\n \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 bibtex \n \n \n \n  \n \n abstract \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
@inproceedings{DeGiacomo2011,\nabstract = {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.},\nauthor = {{De Giacomo}, Giuseppe and Lesperance, Yves and Muise, Christian},\nbooktitle = {Nonmonotonic Reasoning, Action and Change},\nfile = {:home/cjmuise/Documents/Mendeley Desktop/Nonmonotonic Reasoning, Action and Change/2011/Agent Supervision in Situation-Determined ConGolog.pdf:pdf},\ntitle = {{Agent Supervision in Situation-Determined ConGolog}},\nurl = {http://ijcai-11.iiia.csic.es/files/proceedings/W4- NRAC11-Proceedings.pdf\\#page=27},\nyear = {2011},\n  keywords={golog}\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  \n 2010\n \n \n (22)\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 Sohrabi, S.; Baier, J. A.; and McIlraith, S. A.\n \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 bibtex \n \n \n \n\n \n\n \n  \n \n 44 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{ sohBiaMcIKR10,\n  title = {Diagnosis as Planning Revisited},\n  booktitle = {Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR-10)},\n  author = {Shirin Sohrabi and Jorge A. Baier and Sheila A. McIlraith},\n  month = {May},\n  year = {2010},\n  pages = {26-36},\n  address = {Toronto, Canada},\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 \n \n Integrating Preferences into Goal Models for Requirements Engineering.\n \n\n\n \n Liaskos, S.; McIlraith, S. A.; Sohrabi, S.; and Mylopoulos, J.\n \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 bibtex \n \n \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
@inproceedings{LiMM.10,\n  author    = {Sotirios Liaskos and\n               Sheila A. McIlraith and\n               Shirin Sohrabi and\n               John Mylopoulos},\n  title     = {Integrating Preferences into Goal Models for Requirements Engineering},\n  booktitle = {Proceedings of the 10th International Requirements Engineering Conference \n(RE'10)},\n  year      = {2010},\n  address = {Sydney, Australia},\n\turl = {1284489411_PrefsRE10.pdf}\n}\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 Sohrabi, S.; and McIlraith, S. A.\n \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 bibtex \n \n \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
@inproceedings{ soh-mci-iswc10,\n  title = {Preference-based Web Service Composition: A Middle Ground Between Execution and \nSearch},\n  booktitle = {Proceedings of the 9th International Semantic Web \nConference (ISWC10)},\n  author = {Shirin Sohrabi and Sheila A. McIlraith},\n  month = {November},\n  year = {2010},\n  address = {Shanghai, China},\n\turl = {1284490294_}\n}\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 Sohrabi, S.\n \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 bibtex \n \n \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
@inproceedings{ soh-mci-iswc-dc-10,\n  title = { Customizing the Composition of Actions, Programs, and  Web Services with User \nPreferences.},\n  booktitle = {ISWC10  Doctoral Consortium},\n  author = {Shirin Sohrabi},\n  month = {November},\n  year = {2010},\n  address = {Shanghai, China},\n\turl = {1284490303_}\n}\n%% This BibTeX bibliography file was created using BibDesk.\n%% http://bibdesk.sourceforge.net/\n\n\n%% Created for Vaishak Belle at 2013-01-07 12:53:19 -0500 \n\n\n%% Saved with string encoding Unicode (UTF-8) \n\n\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 Belle, V.; and Lakemeyer, G.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/kr/BelleL10,\n\tAuthor = {Vaishak Belle and Gerhard Lakemeyer},\n\tBibsource = {DBLP, http://dblp.uni-trier.de},\n\tBooktitle = {Proc. KR},\n\tDate-Modified = {2012-02-22 14:50:35 +0000},\n\tEe = {http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1361},\n\tPages = {49--60},\n\tTitle = {Multi-Agent Only-Knowing Revisited},\n\tYear = {2010}}\n\n
\n
\n\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 Belle, V.; and Lakemeyer, G.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/aaai/BelleL10,\n\tAuthor = {Vaishak Belle and Gerhard Lakemeyer},\n\tBibsource = {DBLP, http://dblp.uni-trier.de},\n\tBooktitle = {Proc. AAAI},\n\tDate-Modified = {2012-02-22 14:51:15 +0000},\n\tEe = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1803},\n\tPages = {255--261},\n\tTitle = {Reasoning about Imperfect Information Games in the Epistemic Situation Calculus},\n\tYear = {2010}}\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 Hoey, J.; Poupart, P.; von Bertoldi, A.; Craig, T.; Boutilier, C.; and Mihailidis, A.\n \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 bibtex \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  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  title     = {Automated handwashing assistance for persons with dementia\n               using video and a partially observable Markov decision process},\n  journal   = {Computer Vision and Image Understanding},\n  volume    = {114},\n  number    = {5},\n  year      = {2010},\n  pages     = {503-519},\n  ee        = {http://dx.doi.org/10.1016/j.cviu.2009.06.008},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Boutilier, C.; Regan, K.; and Viappiani, P.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/aaai/BoutilierRV10,\n  author    = {Craig Boutilier and\n               Kevin Regan and\n               Paolo Viappiani},\n  title     = {Simultaneous Elicitation of Preference Features and Utility},\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  ee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1665},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Regan, K.; and Boutilier, C.\n \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 bibtex \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  author    = {Kevin Regan and\n               Craig Boutilier},\n  title     = {Robust Policy Computation in Reward-Uncertain MDPs Using\n               Nondominated Policies},\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  ee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1610},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Walsh, W. E.; Boutilier, C.; Sandholm, T.; Shields, R.; Nemhauser, G. L.; and Parkes, D. C.\n \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 bibtex \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  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  title     = {Automated Channel Abstraction for Advertising Auctions},\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  ee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1905},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Viappiani, P.; and Boutilier, C.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/nips/ViappianiB10,\n  author    = {Paolo Viappiani and\n               Craig Boutilier},\n  title     = {Optimal Bayesian Recommendation Sets and Myopically Optimal\n               Choice Query Sets},\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  ee        = {http://books.nips.cc/papers/files/nips23/NIPS2010_0444.pdf},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Braziunas, D.; and Boutilier, C.\n \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 bibtex \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  author    = {Darius Braziunas and\n               Craig Boutilier},\n  title     = {Assessing regret-based preference elicitation with the UTPREF\n               recommendation system},\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  ee        = {http://doi.acm.org/10.1145/1807342.1807377},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Lu, T.; and Boutilier, C.\n \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 bibtex \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  author    = {Tyler Lu and\n               Craig Boutilier},\n  title     = {The unavailable candidate model: a decision-theoretic view\n               of social choice},\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  ee        = {http://doi.acm.org/10.1145/1807342.1807385},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Goultiaeva, A.; and Bacchus, F.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/aaai/GoultiaevaB10,\n  author    = {Alexandra Goultiaeva and\n               Fahiem Bacchus},\n  title     = {Exploiting QBF Duality on a Circuit Representation},\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  ee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1791},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Davies, J.; Cho, J.; and Bacchus, F.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/cp/DaviesCB10,\n  author    = {Jessica Davies and\n               Jeremy Cho and\n               Fahiem Bacchus},\n  title     = {Using Learnt Clauses in maxsat},\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  ee        = {http://dx.doi.org/10.1007/978-3-642-15396-9_17},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Mangassarian, H.; Le, B.; Goultiaeva, A.; Veneris, A. G.; and Bacchus, F.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/date/MangassarianLGVB10,\n  author    = {Hratch Mangassarian and\n               Bao Le and\n               Alexandra Goultiaeva and\n               Andreas G. Veneris and\n               Fahiem Bacchus},\n  title     = {Leveraging dominators for preprocessing QBF},\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  ee        = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5457088},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Goultiaeva, A.; and Bacchus, F.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/sat/GoultiaevaB10,\n  author    = {Alexandra Goultiaeva and\n               Fahiem Bacchus},\n  title     = {Exploiting Circuit Representations in QBF Solving},\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  ee        = {http://dx.doi.org/10.1007/978-3-642-14186-7_29},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\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 Hu, Y.; and Levesque, H. J.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/kr/HuL10,\n  author    = {Yuxiao Hu and\n               Hector J. Levesque},\n  title     = {A Correctness Result for Reasoning about One-Dimensional\n               Planning Problems},\n  booktitle = {KR},\n  year      = {2010},\n  ee        = {http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1270},\n  crossref  = {DBLP:conf/kr/2010},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Chaudhri, V. K.; Bredeweg, B.; Fikes, R.; McIlraith, S. A.; and Wellman, M. P.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/fois/ChaudhriBFMW10,\n  author    = {Vinay K. Chaudhri and\n               Bert Bredeweg and\n               Richard Fikes and\n               Sheila A. McIlraith and\n               Michael P. Wellman},\n  title     = {A Categorization of KR{\\&}R Methods for Requirement Analysis\n               of a Query Answering Knowledge Base},\n  booktitle = {FOIS},\n  year      = {2010},\n  pages     = {158-171},\n  ee        = {http://dx.doi.org/10.3233/978-1-60750-535-8-158},\n  crossref  = {DBLP:conf/fois/2010},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Sohrabi, S.; and McIlraith, S. A.\n \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 bibtex \n \n \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
@inproceedings{DBLP:conf/semweb/SohrabiM10,\n  author    = {Shirin Sohrabi and\n               Sheila A. McIlraith},\n  title     = {Preference-Based Web Service Composition: A Middle Ground\n               between Execution and Search},\n  booktitle = {International Semantic Web Conference (1)},\n  year      = {2010},\n  pages     = {713-729},\n  ee        = {http://dx.doi.org/10.1007/978-3-642-17746-0_45},\n  crossref  = {DBLP:conf/semweb/2010-1},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Hsu, E. I.; and McIlraith, S. A.\n \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 bibtex \n \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  author    = {Eric I. Hsu and\n               Sheila A. McIlraith},\n  title     = {Computing Equivalent Transformations for Combinatorial Optimization\n               by Branch-and-Bound Search},\n  booktitle = {SOCS},\n  year      = {2010},\n  ee        = {http://aaai.org/ocs/index.php/SOCS/SOCS10/paper/view/2097},\n  crossref  = {DBLP:conf/socs/2010},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\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 Muise, C.; McIlraith, S. A.; and Beck, J. C.\n \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 bibtex \n \n \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
@inproceedings{mui-etal-wara10,\naddress = {Atlanta, GA, USA},\nauthor = {Muise, Christian and McIlraith, Sheila A. and Beck, J. Christopher},\nbooktitle = {Workshop on Abstraction, Reformulation, and Approximation (AAAI-10)},\nfile = {:home/cjmuise/Documents/Mendeley Desktop/Workshop on Abstraction, Reformulation, and Approximation (AAAI-10)/2010/Fast d-DNNF Compilation with sharpSAT.pdf:pdf},\ntitle = {{Fast d-DNNF Compilation with sharpSAT}},\nurl = {http://www.haz.ca/docs/papers/wara-muise-10.pdf},\nyear = {2010}\n}\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 Computing Robust Plans in Continuous Domains.\n \n\n\n \n Fritz, C.; and McIlraith, S.\n \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 bibtex \n \n \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
@inproceedings{ fri-mci-icaps09,\n  keyword = {Planning},\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  title = {Computing Robust Plans in Continuous Domains},\n  year = {2009},\n  pages = {346--349},\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 \n Generating Optimal Plans in Highly-Dynamic Domains.\n \n\n\n \n Fritz, C.; and McIlraith, S. A.\n \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 bibtex \n \n \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
@inproceedings{ fri-mci-uai09,\n  keyword = {Planning},\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  title = {Generating Optimal Plans in Highly-Dynamic Domains},\n  year = {2009},\n  urlpaper = {fri-mci-uai09.pdf}\n}\n\n\n
\n
\n\n\n\n
\n\n
\n\n