default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st IJCAI 2009: Pasadena, California, USA
- Craig Boutilier:
IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009. 2009 - Preface.
- IJCAI-09 Conference Organization.
- IJCAI-09 Sponsorship.
- IJCAI-09 Awards and Distinguished Papers.
- IJCAI-09 Keynote and Invited Speakers.
- Events Colocated with IJCAI-09.
- IJCAI Organization.
- AAAI Organization.
- Past IJCAI Conferences.
Invited Talks
- Cristina Conati:
Intelligent Tutoring Systems: New Challenges and Directions. 2-7 - Thomas G. Dietterich:
Machine Learning in Ecosystem Informatics and Sustainability. 8-13 - Luc Steels, Michael Spranger:
How Experience of the Body Shapes Language about Space. 14-19 - Qiang Yang:
Activity Recognition: Linking Low-level Sensors to High-level Intelligence. 20-25
Agent-based and Multiagent Systems
- Alon Altman, Ariel D. Procaccia, Moshe Tennenholtz:
Nonmanipulable Selections from a Tournament. 27-32 - Dimitrios Antos, Avi Pfeffer:
Using Reasoning Patterns to Help Humans Solve Complex Games. 33-39 - Radha-Krishna Balla, Alan Fern:
UCT for Tactical Assault Planning in Real-Time Strategy Games. 40-45 - Michael Benisch, Norman M. Sadeh, Tuomas Sandholm:
Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions. 46-52 - Nadja Betzler, Susanne Hemmann, Rolf Niedermeier:
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. 53-58 - Richard B. Borie, Craig A. Tovey, Sven Koenig:
Algorithms and Complexity Results for Pursuit-Evasion Problems. 59-66 - Sylvain Bouveret, Ulle Endriss, Jérôme Lang:
Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods. 67-72 - Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz:
Planning Games. 73-78 - Simina Brânzei, Kate Larson:
Coalitional Affinity Games and the Stability Gap. 79-84 - Georgios Chalkiadakis, Edith Elkind, Nicholas R. Jennings:
Simple Coalitional Games with Beliefs. 85-90 - Federico Chesani, Paola Mello, Marco Montali, Paolo Torroni:
Commitment Tracking via the Reactive Event Calculus. 91-96 - Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Guillaume Ravilly-Abadie:
Compiling the Votes of a Subelectorate. 97-102 - Vincent Conitzer, Jérôme Lang, Lirong Xia:
How Hard Is It to Control Sequential Elections via the Agenda? 103-108 - Vincent Conitzer, Matthew Rognlie, Lirong Xia:
Preference Functions that Score Rankings and Maximum Likelihood Estimation. 109-115 - Quang Duong, Yevgeniy Vorobeychik, Satinder Singh, Michael P. Wellman:
Learning Graphical Game Models. 116-121 - Ulle Endriss, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness. 122-127 - Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Multimode Control Attacks on Elections. 128-133 - Valeria Fionda, Gianluigi Greco:
Charting the Tractability Frontier of Mixed Multi-Unit Combinatorial Auctions. 134-139 - Sam Ganzfried, Tuomas Sandholm:
Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information. 140-146 - Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the Complexity of Compact Coalitional Games. 147-152 - Joseph Y. Halpern, Rafael Pass:
Iterated Regret Minimization: A New Solution Concept. 153-158 - Erik Halvorson, Vincent Conitzer, Ronald Parr:
Multi-Step Multi-Sensor Hider-Seeker Games. 159-166 - Noam Hazon, Yonatan Aumann, Sarit Kraus:
Collaborative Multi Agent Physical Search with Probabilistic Knowledge. 167-174 - Laura M. Hiatt, Terry L. Zimmerman, Stephen F. Smith, Reid G. Simmons:
Strengthening Schedules through Uncertainty Analysis Agents. 175-180 - Manish Jain, Matthew E. Taylor, Milind Tambe, Makoto Yokoo:
DCOPs Meet the Real World: Exploring Unknown Reward Matrices with Applications to Mobile Sensor Networks. 181-186 - Ece Kamar, Eric Horvitz:
Collaboration and Shared Plans in the Open World: Studies of Ridesharing. 187 - Georgia Kastidou, Kate Larson, Robin Cohen:
Exchanging Reputation Information between Communities: A Payment-Function Approach. 195-200 - Akshat Kumar, Shlomo Zilberstein:
Event-Detecting Multi-Agent MDPs: Complexity and Constant-Factor Approximations. 201-207 - Sébastien Lahaie:
A Kernel Method for Market Clearing. 208-213 - Ivan Marsá-Maestre, Miguel A. López-Carmona, Juan R. Velasco, Takayuki Ito, Mark Klein, Katsuhide Fujita:
Balancing Utility and Deal Probability for Auction-Based Negotiations in Highly Nonlinear Utility Spaces. 214-219 - Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosenschein:
Strategyproof Classification with Shared Inputs. 220-225 - Kenichi Okuno, Kazuko Takahashi:
Argumentation System with Changes of an Agent's Knowledge Base. 226-232 - Abraham Othman, Tuomas Sandholm:
How Pervasive Is the Myerson-Satterthwaite Impossibility? 233-238 - Ariel D. Procaccia:
Thou Shalt Covet Thy Neighbor's Cake. 239-244 - Zinovi Rabinovich, Enrico H. Gerding, Maria Polukarov, Nicholas R. Jennings:
Generalised Fictitious Play for a Continuum of Anonymous Players. 245-250 - Iyad Rahwan, Kate Larson, Fernando A. Tohmé:
A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics. 251-256 - Talal Rahwan, Tomasz P. Michalak, Nicholas R. Jennings, Michael J. Wooldridge, Peter McBurney:
Coalition Structure Generation in Multi-Agent Systems with Positive and Negative Externalities. 257-263 - Avi Rosenfeld, Sarit Kraus:
Modeling Agents through Bounded Rationality Theories. 264-271 - Amirali Salehi-Abari, Tony White:
Towards Con-Resistant Trust Models for Distributed Agent Systems. 272-277 - David Schnizlein, Michael H. Bowling, Duane Szafron:
Probabilistic State Translation in Extensive Games with Large Action Sets. 278-284 - Dafna Shahaf, Eric Horvitz:
Investigations of Continual Computation. 285-291 - Sebastian Stein, Enrico H. Gerding, Alex Rogers, Kate Larson, Nicholas R. Jennings:
Flexible Procurement of Services with Uncertain Durations using Redundancy. 292-298 - Ruben Stranders, Alessandro Farinelli, Alex Rogers, Nicholas R. Jennings:
Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm. 299-304 - Evan Sultanik, Robert N. Lass, William C. Regli:
Dynamic Configuration of Agent Organizations. 305-311 - Pingzhong Tang, Fangzhen Lin:
Discovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs. 312-317 - Glenn Taylor, Michael Quist, Allen Hicken:
Acquiring Agent-Based Models of Conflict from Event Data. 318-323 - Toby Walsh:
Where Are the Really Hard Manipulation Problems? The Phase Transition in Manipulating the Veto Rule. 324-329 - Jens Witkowski:
Eliciting Honest Reputation Feedback in a Markov Setting. 330-335 - Lirong Xia, Vincent Conitzer:
Finite Local Consistency Characterizes Generalized Scoring Rules. 336-341 - Lirong Xia, Jérôme Lang:
A Dichotomy Theorem on the Existence of Efficient or Neutral Sequential Voting Correspondences. 342-347 - Lirong Xia, Michael Zuckerman, Ariel D. Procaccia, Vincent Conitzer, Jeffrey S. Rosenschein:
Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules. 348-353 - William Yeoh, Xiaoxun Sun, Sven Koenig:
Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. 354-360 - Chongjie Zhang, Victor R. Lesser, Prashant J. Shenoy:
A Multi-Agent Learning Approach to Online Distributed Resource Allocation. 361-366 - Dongmo Zhang:
Axiomatic Characterization of Task Oriented Negotiation. 367-372 - Xiaoming Zheng, Sven Koenig:
K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems. 373-379
Constraints, Satisfiability, and Search
- Spyros Angelopoulos, Alejandro López-Ortiz:
Interruptible Algorithms for Multi-Problem Solving. 380-386 - Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
Towards Industrial-Like Random SAT Instances. 387-392 - Josep Argelich, Inês Lynce, João Marques-Silva:
On Solving Boolean Multilevel Optimization Problemse. 393-398 - Gilles Audemard, Laurent Simon:
Predicting Learnt Clauses Quality in Modern SAT Solvers. 399-404 - Pranjal Awasthi, Tuomas Sandholm:
Online Stochastic Optimization in the Large: Application to Kidney Exchange. 405-411 - Christian Bessiere, George Katsirelos, Nina Narodytska, Toby Walsh:
Circuit Complexity and Decompositions of Global Constraints. 412-418 - Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:
Decompositions of All Different, Global Cardinality and Related Constraints. 419-424 - Christian Bessiere, Thierry Petit, Bruno Zanuttini:
Making Bound Consistency as Effective as Arc Consistency. 425-430 - Yngvi Björnsson, Vadim Bulitko, Nathan R. Sturtevant:
TBA*: Time-Bounded A*. 431-436 - Zahy Bnaya, Ariel Felner, Solomon Eyal Shimony:
Canadian Traveler Problem with Remote Sensing. 437-442 - Lucas Bordeaux, Youssef Hamadi, Horst Samulowitz:
Experiments with Massively Parallel Constraint Solving. 443-448 - Ethan Burns, Seth Lemons, Rong Zhou, Wheeler Ruml:
Best-First Heuristic Search for Multi-Core Machines. 449-455 - Tristan Cazenave:
Nested Monte-Carlo Search. 456-461 - Khalil Challita:
Reasoning with Lines in the Euclidean Space. 462-467 - Raphaël Chenouard, Alexandre Goldsztejn, Christophe Jermann:
Search Strategies for an Anytime Usage of the Branch and Prune Algorithm. 468-473 - Paolo Ciancarini, Gian Piero Favini:
Monte Carlo Tree Search Techniques in the Game of Kriegspiel. 474-479 - P. Alex Dow, Richard E. Korf:
Duplicate Avoidance in Depth-First Search with Applications to Treewidth. 480-485 - Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Local Search: Is Brute-Force Avoidable? 486-491 - Timothy Furtak, Michael Buro:
Minimum Proof Graphs and Fastest-Cut-First Search Heuristics. 492-498 - Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Control-Based Clause Sharing in Parallel SAT Solving. 499-504 - Philip Henderson, Broderick Arneson, Ryan B. Hayward:
Solving 8x8 Hex. 505-510 - Eric Huang, Richard E. Korf:
New Improvements in Optimal Rectangle Packing. 511-516 - Ashiqur R. KhudaBukhsh
, Lin Xu, Holger H. Hoos, Kevin Leyton-Brown:
SATenstein: Automatically Building Local Search SAT Solvers from Components. 517-524 - Matthew Kitching, Fahiem Bacchus:
Exploiting Decomposition on Constraint Problems with High Tree-Width. 525-531 - Matthew Kitching, Fahiem Bacchus:
Set Branching in Constraint Optimization. 532-537 - Richard E. Korf:
Multi-Way Number Partitioning. 538-543 - Lukas Kroc, Ashish Sabharwal, Carla P. Gomes, Bart Selman:
Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT. 544-551 - Yat Chiu Law, Jimmy Ho-Man Lee, May H. C. Woo:
Variety Reasoning for Multiset Constraint Propagation. 552-558 - Jimmy Ho-Man Lee, Ka Lun Leung:
Towards Efficient Consistency Enforcement for Global Constraints in Weighted Constraint Satisfaction. 559-565 - David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
A Soft Global Precedence Constraint. 566-571 - Jason Jingshi Li, Jinbo Huang, Jochen Renz:
A Divide-and-Conquer Approach for Solving Interval Algebra Networks. 572-577 - Michael J. Maher:
Open Contractible Global Constraints. 578-583 - Carsten Moldenhauer, Nathan R. Sturtevant:
Evaluating Strategies for Running from the Cops. 584-589 - Knot Pipatsrisawat, Adnan Darwiche:
A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT. 590-595 - Luca Pulina, Armando Tacchella:
A Structural Approach to Reasoning with Quantified Boolean Formulas. 596-602 - Martí Sánchez-Fibla, David Allouche, Simon de Givry, Thomas Schiex:
Russian Doll Search with Tree Decomposition. 603-608 - Nathan R. Sturtevant, Ariel Felner, Max Barer, Jonathan Schaeffer, Neil Burch:
Memory-Based Heuristics for Explicit State Spaces. 609-614 - Xiaoxun Sun, William Yeoh, Sven Koenig:
Efficient Incremental Search for Moving Target Search. 615-620 - Richard J. Wallace, Diarmuid Grimes, Eugene C. Freuder:
Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features. 621-627 - Matthias Westphal, Stefan Wölfl:
Qualitative CSP, Finite CSP, and SAT: Comparing Methods for Qualitative Constraint-based Reasoning. 628-633 - Zhifu Zhang, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer, Ariel Felner:
A* Search with Inconsistent Heuristics. 634-639 - Rong Zhou, Eric A. Hansen:
Combining Breadth-First and Depth-First Strategies in Searching for Treewidth. 640-645 - Inon Zuckerman, Ariel Felner, Sarit Kraus:
Mixing Search Strategies for Multi-Player Games. 646-652
Knowledge Representation, Reasoning, and Logic
- Rui Abreu, Peter Zoeteweij, Arjan J. C. van Gemund:
A New Bayesian Approach to Multiple Intermittent Fault Diagnosis. 653-658 - Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib:
A Logic for Coalitions with Bounded Resources. 659-664 - Leila Amgoud, Srdjan Vesic:
Repairing Preference-Based Argumentation Frameworks. 665-670 - Carlos Areces, Diego Figueira:
Which Semantics for Neighbourhood Semantics? 671-676 - Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat:
Extending Decidable Cases for Rules with Existential Variables. 677-682 - Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin:
Computational Properties of Resolution-based Grounded Semantics. 683-689 - Michelle L. Blom, Adrian R. Pearce:
An Argumentation-Based Interpreter for Golog Programs. 690-695 - Piero A. Bonatti, Marco Faella, Luigi Sauro:
Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes. 696-701 - Richard Booth, Thomas Andreas Meyer, Ivan José Varzinczak:
Next Steps in Propositional Horn Contraction. 702-707 - Stefano Borgo:
Euclidean and Mereological Qualitative Spaces: A Study of SCC and DCC. 708-713 - Diego Calvanese, Thomas Eiter, Magdalena Ortiz:
Regular Path Queries in Expressive Description Logics with Nominals. 714-720 - Mika Cohen, Mads Dam, Alessio Lomuscio, Hongyang Qu:
A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic. 721-726 - Bernardo Cuenca Grau, Boris Motik, Yevgeny Kazakov:
Import-by-Query: Ontology Reasoning under Access Limitations. 727-732 - Johan de Kleer:
Diagnosing Multiple Persistent and Intermittent Faults. 733-738 - Francesco M. Donini, Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio:
A Tableaux-Based Method for Computing Least Common Subsumers for Expressive Description Logics. 739-745 - Phan Minh Dung, Phan Minh Thang:
A Unified Framework for Representation and Development of Dialectical Proof Procedures in Argumentation. 746-751 - Thomas Eiter, Michael Fink, Thomas Krennwallner:
Decomposition of Declarative Knowledge Bases with External Functions. 752-758 - Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Mantas Simkus:
Query Answering in Description Logics with Transitive Roles. 759-764 - Thomas Eiter, Mantas Simkus:
Bidirectional Answer Set Programs with Function Symbols. 765-771 - Hélène Fargier, Pierre Marquis:
Knowledge Compilation Properties of Trees-of-BDDs, Revisited. 772-777 - Alexander Feldman, Gregory M. Provan, Arjan J. C. van Gemund:
FRACTAL: Efficient Fault Isolation Using Active Testing. 778-784 - Alexander Feldman, Gregory M. Provan, Arjan J. C. van Gemund:
Solving Strong-Fault Diagnostic Models by Model Relaxation. 785-790 - Alexander Felfernig, Gerhard Friedrich, Monika Schubert, Monika Mandl, Markus Mairitsch, Erich Teppan:
Plausible Repairs for Inconsistent Requirements. 791-796 - Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, Ravi Palla:
Symmetric Splitting in the General Theory of Stable Models. 797-803 - Mauro Javier Gómez Lucero, Carlos Iván Chesñevar, Guillermo Ricardo Simari:
On the Accrual of Arguments in Defeasible Logic Programming. 804-809 - Katsumi Inoue, Taisuke Sato, Masakazu Ishihata, Yoshitaka Kameya, Hidetomo Nabeshima:
Evaluating Abductive Hypotheses using an EM Algorithm on BDDs. 810-815 - Michael Jakl, Reinhard Pichler, Stefan Woltran:
Answer-Set Programming with Bounded Treewidth. 816-822 - Tae-Won Kim, Joohyung Lee, Ravi Palla:
Circumscriptive Event Calculus as Answer Set Programming. 823-829