20. IJCAI 2007: Hyderabad, India

• Contents.
  
• Preface.
  
• IJCAI-07 Conference Organization.
  
• IJCAI-07 Awards and Distinguished Papers.
  
• IJCAI-07 Keynote and Invited Speakers.
  
• IJCAI Organization.
  
• Past IJCAI Conferences.
  
• IJCAI-07 Reviewers.
  

Research Excellence Award

• Alan Bundy:
  Cooperating Reasoning Processes: More than Just the Sum of Their Parts. 2-11
  

Computers and Thought Award

• Peter Stone:
  Learning and Multiagent Reasoning for Autonomous Agents. 12-30
  

Constraint Satisfaction

• Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
  The Logic Behind Weighted CSP. 32-37
  
• Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
  QCSP Made Practical by Virtue of Restricted Quantification. 38-43
  
• Christian Bessière, Remi Coletta, Thierry Petit:
  Learning Implied Global Constraints. 44-49
  
• Christian Bessière, Remi Coletta, Barry O'Sullivan, Mathias Paulin:
  Query-Driven Constraint Acquisition. 50-55
  
• Julien Bidot, Thierry Vidal, Philippe Laborie, J. Christopher Beck:
  A General Framework for Scheduling in a Stochastic Environment. 56-61
  
• Sylvain Bouveret, Michel Lemaître:
  New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks. 62-67
  
• Martin C. Cooper, Simon de Givry, Thomas Schiex:
  Optimal Soft Arc Consistency. 68-73
  
• Alex Ferguson, Barry O'Sullivan:
  Quantified Constraint Satisfaction Problems: From Relaxations to Explanations. 74-79
  
• Alan M. Frisch, Matthew Grum, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel:
  The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems. 80-87
  
• Georg Gottlob, Gianluigi Greco, Toni Mancini:
  Conditional Constraint Satisfaction: Logical Foundations and Complexity. 88-93
  
• Carlos Grandón, Gilles Chabert, Bertrand Neveu:
  Generalized Interval Projection: A New Technique for Consistent Domain Extension. 94-99
  
• Tarik Hadzic, Andrzej Wasowski, Henrik Reif Andersen:
  Techniques for Efficient Interactive Configuration of Distribution Networks. 100-105
  
• Emmanuel Hebrard, Barry O'Sullivan, Toby Walsh:
  Distance Constraints in Constraint Satisfaction. 106-111
  
• Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
  Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. 112-117
  
• Matthew Kitching, Fahiem Bacchus:
  Symmetric Component Caching. 118-124
  
• Christophe Lecoutre, Fred Hemery:
  A Study of Residual Supports in Arc Consistency. 125-130
  
• Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
  Nogood Recording from Restarts. 131-136
  
• Chavalit Likitvivatanavong, Yuanlin Zhang, Scott Shannon, James Bowen, Eugene C. Freuder:
  Arc Consistency during Search. 137-142
  
• Deepak Mehta, Marc R. C. van Dongen:
  Probabilistic Consistency Boosts MAC and SAC. 143-148
  
• Nina Narodytska, Toby Walsh:
  Constraint and Variable Ordering Heuristics for Compiling Configuration Problems. 149-154
  
• Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat Rao:
  A Theoretical Framework for Learning Bayesian Networks with Parameter Inequality Constraints. 155-160
  
• Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta:
  Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. 161-166
  
• Adrian Petcu, Boi Faltings, Roger Mailler:
  PC-DPOP: A New Partial Centralization Algorithm for Distributed Optimization. 167-172
  
• Tian Sang, Paul Beame, Henry A. Kautz:
  A Dynamic Approach for MPE and Weighted MAX-SAT. 173-179
  
• Sathiamoorthy Subbarayan, Henrik Reif Andersen:
  Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs. 180-185
  
• Xu Yang, John Bigham:
  A Call Admission Control Scheme Using NeuroEvolution Algorithm in Cellular Networks. 186-191
  
• Yuanlin Zhang:
  Fast Algorithm for Connected Row Convex Constraints. 192-197
  
• Roie Zivan, Amnon Meisels:
  Conflict Directed Backjumping for Max-CSPs. 198-204
  

Knowledge Representation and Reasoning

• Marco Aiello, Brammert Ottens:
  The Mathematical Morpho-Logical View on Reasoning about Space. 205-211
  
• Ricardo M. Araujo, Luís C. Lamb:
  An Information-Theoretic Analysis of Memory Bounds in a Distributed Resource Allocation Mechanism. 212-217
  
• Alessandro Artale, Carsten Lutz, David Toman:
  A Description Logic of Change. 218-223
  
• Jamal Atif, Céline Hudelot, Geoffroy Fouquier, Isabelle Bloch, Elsa D. Angelini:
  From Generic Knowledge to Specific Reasoning for Medical Image Interpretation Using Graph based Representations. 224-229
  
• Franz Baader, Bernhard Ganter, Baris Sertkaya, Ulrike Sattler:
  Completing Description Logic Knowledge Bases Using Formal Concept Analysis. 230-235
  
• Chitta Baral, Jicheng Zhao:
  Non-monotonic Temporal Logics for Goal Specification. 236-242
  
• Chitta Baral, Matt Hunsaker:
  Using the Probabilistic Logic Programming Language P-log for Causal and Counterfactual Reasoning and Non-Naive Conditioning. 243-249
  
• Marc G. Bellemare, Doina Precup:
  Context-Driven Predictions. 250-255
  
• David Billington:
  Entailment Semantics for Rules with Priorities. 256-261
  
• Tibor Bosse, Jan Treur:
  Higher-Order Potentialities and their Reducers: A Philosophical Foundation Unifying Dynamic Modeling Methods. 262-267
  
• Gerhard Brewka, Floris Roelofsen, Luciano Serafini:
  Contextual Default Reasoning. 268-273
  
• Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati:
  EQL-Lite: Effective First-Order Query Processing in Description Logics. 274-279
  
• Carlos Iván Chesñevar, Guillermo Ricardo Simari:
  A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks. 280-285
  
• Luca Console, Claudia Picardi, Daniele Theseider Dupré:
  A Framework for Decentralized Qualitative Model-Based Diagnosis. 286-291
  
• Marie-Odile Cordier, Alban Grastien:
  Exploiting Independence in a Decentralised and Incremental Approach of Diagnosis. 292-297
  
• Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov, Ulrike Sattler:
  A Logical Framework for Modularity of Ontologies. 298-303
  
• Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits:
  Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination. 304-309
  
• Johan de Kleer:
  Modeling When Connections Are the Problem. 310-317
  
• Clare Dixon, Michael Fisher, Boris Konev:
  Tractable Temporal Reasoning. 318-323
  
• Christophe Dousson, Pierre Le Maigat:
  Chronicle Recognition Improvement Using Temporal Focusing and Hierarchization. 324-329
  
• Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
  Complexity Results for Checking Equivalence of Stratified Logic Programs. 330-335
  
• Thomas Eiter, Esra Erdem, Wolfgang Faber:
  On Reversing Actions: Algorithms and Complexity. 336-341
  
• Michael Esser, Peter Struss:
  Fault-Model-Based Test Generation for Embedded Software. 342-347
  
• Jérôme Euzenat:
  Semantic Precision and Recall for Ontology Alignment Evaluation. 348-353
  
• Zhao-Fu Fan, Yunfei Jiang:
  Operator Component Matrix Model for IMP Program Diagnosis. 354-359
  
• Hélène Fargier, Pierre Marquis:
  On Valued Negation Normal Form Formulas. 360-365
  
• Paolo Ferraris:
  A Logic Program Characterization of Causal Theories. 366-371
  
• Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz:
  A New Perspective on Stable Models. 372-379
  
• Ildikó Flesch, Peter J. F. Lucas, Theo P. van der Weide:
  Conflict-Based Diagnosis: Adding Uncertainty to Model-based Diagnosis. 380-
  
• Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub:
  Conflict-Driven Answer Set Solving. 386-
  
• Romain Gérard, Souhila Kaci, Henri Prade:
  Ranking Alternatives on the Basis of Generic Constraints and Examples - A Possibilistic Approach. 393-398
  
• Birte Glimm, Ian Horrocks, Carsten Lutz, Ulrike Sattler:
  Conjunctive Query Answering for the Description Logic SHIQ. 399-404
  
• Ashish Gupta, David C. Noelle:
  A Dual-Pathway Neural Network Model of Control Relinquishment in Motor Skill Learning. 405-410
  
• Daniel T. Halstead, Kenneth D. Forbus:
  Some Effects of a Reduced Relational Vocabulary on the Whodunit Problem. 411-416
  
• Miki Hermann, Reinhard Pichler:
  Counting Complexity of Propositional Abduction. 417-422
  
• Jizhou Huang, Ming Zhou, Dan Yang:
  Extracting Chatbot Knowledge from Online Discussion Forums. 423-428
  
• Pallika H. Kanani, Andrew McCallum, Chris Pal:
  Improving Author Coreference by Resource-Bounded Information Gathering from the Web. 429-434
  
• Sanjiang Li:
  Combining Topological and Directional Information for Spatial Reasoning. 435-440
  
• Fangzhen Lin, Yi Zhou:
  From Answer Set Logic Programming to Circumscription via Logic of GK. 441-446
  
• Andrew M. Lovett, Morteza Dehghani, Kenneth D. Forbus:
  Incremental Learning of Perceptual Categories for Open-Domain Sketch Recognition. 447-452
  
• Carsten Lutz, Dirk Walther, Frank Wolter:
  Conservative Extensions in Expressive Description Logics. 453-458
  
• Søren Tjagvad Madsen, Gerhard Widmer:
  Towards a Computational Model of Melody Identification in Polyphonic Music. 459-464
  
• Diego C. Martínez, Alejandro Javier García, Guillermo Ricardo Simari:
  Modelling Well-Structured Argumentation Lines. 465-470
  
• Wolfgang Mayer, Markus Stumptner:
  Abstract Interpretation of Programs for Model-Based Debugging. 471-476
  
• Boris Motik, Riccardo Rosati:
  A Faithful Integration of Description Logics with Logic Programming. 477-482
  
• Kasia Muldner, Cristina Conati:
  Evaluating a Decision-Theoretic Approach to Tailored Example Selection. 483-488
  
• Alice M. Mulvehill, Brett Benyo, Michael T. Cox, Renu Kurien Bostwick:
  Expectation Failure as a Basis for Agent-Based Model Diagnosis and Mixed Initiative Model Adaptation during Anomalous Plan Execution. 489-494
  
• Isabel Navarrete, Antonio Morales, Guido Sciavicco:
  Consistency Checking of Basic Cardinal Constraints over Connected Regions. 495-500
  
• Austin Parker, Fusun Yaman, Dana S. Nau, V. S. Subrahmanian:
  Probabilistic Go Theories. 501-506
  
• Michele Piunti, Cristiano Castelfranchi, Rino Falcone:
  Surprise as Shortcut for Anticipation: Clustering Mental States in Reasoning. 507-512
  
• Gregory M. Provan, Jun Wang:
  Automated Benchmark Model Generators for Model-Based Diagnostic Inference. 513-518
  
• Maleeha Qazi, Glenn Fung, Sriram Krishnan, Rómer Rosales, Harald Steck, R. Bharat Rao, Don Poldermans, Dhanalakshmi Chandrasekaran:
  Automated Heart Wall Motion Abnormality Detection from Ultrasound Images Using Bayesian Networks. 519-525
  
• Jochen Renz:
  Qualitative Spatial and Temporal Reasoning: Efficient Algorithms for Everyone. 526-531
  
• Jussi Rintanen, Alban Grastien:
  Diagnosability Testing with Satisfiability Algorithms. 532-537
  
• Jussi Rintanen:
  Diagnosers and Diagnosability of Succinct Transition Systems. 538-544
  
• Virginia Savova, Leonid Peshkin:
  Is the Turing Test Good Enough? The Fallacy of Resource-Unbounded Intelligence. 545-550
  
• Vincent Schickel-Zuber, Boi Faltings:
  OSS: A Semantic Similarity Function based on Hierarchical Ontologies. 551-556
  
• Stefan Schlobach, Michel C. A. Klein, Linda Peelen:
  Description Logics with Approximate Definitions - Precise Modeling of Vague Concepts. 557-562
  
• Hedda Rahel Schmidtke, Woontack Woo:
  A Size-Based Qualitative Approach to the Representation of Spatial Granularity. 563-568
  
• Steven Schockaert, Martine De Cock, Etienne E. Kerre:
  Qualitative Temporal Reasoning about Vague Events. 569-574
  
• Anika Schumann, Yannick Pencolé:
  Scalable Diagnosability Checking of Event-Driven Systems. 575-580
  
• Sajjad Ahmed Siddiqi, Jinbo Huang:
  Hierarchical Diagnosis of Multiple Faults. 581-586
  
• Vishwajeet Singh, Krishna P. Miyapuram, Raju S. Bapi:
  Detection of Cognitive States from fMRI Data Using Machine Learning Techniques. 587-592
  
• Peter Struss:
  Model-Based Optimization of Testing through Reduction of Stimuli. 593-598
  
• V. S. Subrahmanian, Leila Amgoud:
  A General Framework for Reasoning about Inconsistency. 599-504
  
• M. G. Suraj, D. S. Guru:
  Appearance Based Recognition Methodology for Recognising Fingerspelling Alphabets. 605-610
  
• Sashank Varma:
  Resource Constraints on Computation and Communication in the Brain. 611-616
  
• Laurent Vercouter, Sara J. Casare, Jaime Simão Sichman, Anarosa Brandão:
  An Experience on Reputation Models Interoperability Based on a Functional Ontology. 617-622
  
• Bart Verheij:
  A Labeling Approach to the Computation of Credulous Acceptance in Argumentation. 623-628
  
• Huan Wang, Shuicheng Yan, Thomas S. Huang, Xiaoou Tang:
  A Convengent Solution to Tensor Subspace Learning. 629-634
  
• Hui Wang:
  All Common Subsequences. 635-640
  
• Mark A. Wood, Joanna Bryson:
  Representations for Action Selection Learning from Real-Time Observation of Task Experts. 641-646
  
• Yan Zhang:
  Epistemic Reasoning in Logic Programs. 647-653
  

Learning

• Isabelle Alvarez, Stephan Bernard, Guillaume Deffuant:
  Keep the Decision Tree and Estimate the Class Probabilities Using its Decision Boundary. 654-659
  
• Edin Andelic, Martin Schafföner, Marcel Katz, Sven E. Krüger, Andreas Wendemuth:
  Updates for Nonlinear Discriminants. 660-665
  
• Sebastian Bader, Pascal Hitzler, Steffen Hölldobler, Andreas Witzel:
  A Fully Connectionist Model Generator for Covered First-Order Logic Programs. 666-671
  
• Bikramjit Banerjee, Peter Stone:
  General Game Learning Using Knowledge Transfer. 672-677
  
• Sabri Bayoudh, Laurent Miclet, Arnaud Delhay:
  Learning by Analogy: A Classification Rule for Binary and Nominal Data. 678-683
  
• Ron Bekkerman, Hema Raghavan, James Allan, Koji Eguchi:
  Interactive Clustering of Text Collections According to a User-Specified Criterion. 684-689
  
• Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, Anna Helena Reali Costa:
  Heuristic Selection of Actions in Multiagent Reinforcement Learning. 690-695
  
• Marenglen Biba, Floriana Esposito, Stefano Ferilli, Nicola Di Mauro, Teresa Maria Altomare Basile:
  Unsupervised Discretization Using Kernel Density Estimation. 696-701
  
• Klaus Brinker, Eyke Hüllermeier:
  Case-Based Multilabel Ranking. 702-707
  
• Deng Cai, Xiaofei He, Kun Zhou, Jiawei Han, Hujun Bao:
  Locality Sensitive Discriminant Analysis. 708-713
  
• Lijuan Cai, Thomas Hofmann:
  Exploiting Known Taxonomies in Learning Overlapping Concepts. 714-719
  
• Paul R. Cohen, Yu-Han Chang, Clayton T. Morrison, Carole R. Beal:
  Learning and Transferring Action Schemas. 720-725
  
• Tom Croonenborghs, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe:
  Online Learning and Exploiting Relational Models in Reinforcement Learning. 726-731
  
• Marco Cuturi:
  Permanents, Transport Polytopes and Positive Definite Kernels on Histograms. 732-737
  
• William Dabney, Amy McGovern:
  Utile Distinctions for Relational Reinforcement Learning. 738-743
  
• Guang Dai, Dit-Yan Yeung:
  Boosting Kernel Discriminant Analysis and Its Application on Tissue Classification of Gene Expression Data. 744-749
  
• Mathieu d'Aquin, Fadi Badra, Sandrine Lafrogne, Jean Lieber, Amedeo Napoli, Laszlo Szathmary:
  Case Base Mining for Adaptation Knowledge Acquisition. 750-755
  
• Murat Dundar, Balaji Krishnapuram, Jinbo Bi, R. Bharat Rao:
  Learning Classifiers When the Training Data Is Not IID. 756-761
  
• Narayanan Unny Edakunni, Stefan Schaal, Sethu Vijayakumar:
  Kernel Carpentry for Online Regression Using Randomly Varying Coefficient Model. 762-767
  
• Saher Esmeir, Shaul Markovitch:
  Occam's Razor Just Got Sharper. 768-773
  
• Santiago Fernández, Alex Graves, Jürgen Schmidhuber:
  Sequence Labelling in Structured Domains with Hierarchical Recurrent Neural Networks. 774-779
  
• Nancy Fulda, Dan Ventura:
  Predicting and Preventing Coordination Problems in Cooperative Q-learning Systems. 780-785
  
• Glenn Fung, Rómer Rosales, R. Bharat Rao:
  Feature Selection and Kernel Design via Linear Programming. 786-791
  
• Matteo Gagliolo, Jürgen Schmidhuber:
  Learning Restart Strategies. 792-797
  
• Ugo Galassi, Attilio Giordana, Lorenza Saitta:
  Incremental Construction of Structured Hidden Markov Models. 798-803
  
• Gemma C. Garriga, Roni Khardon, Luc De Raedt:
  On Mining Closed Sets in Multi-Relational Data. 804-809
  
• Ali Ghodsi, Dana F. Wilkinson, Finnegan Southey:
  Improving Embeddings by Flexible Exploitation of Side Information. 810-816
  
• Sertan Girgin, Faruk Polat, Reda Alhajj:
  State Similarity Based Approach for Improving Performance in RL. 817-822
  
• Yuhong Guo, Russell Greiner:
  Optimistic Active-Learning Using Mutual Information. 823-829
  
• András György, Levente Kocsis, Ivett Szabó, Csaba Szepesvári:
  Continuous Time Associative Bandit Problems. 830-835
  
• Sariel Har-Peled, Dan Roth, Dav Zimak:
  Maximum Margin Coresets for Active and Noise Tolerant Learning. 836-841
  
• Claudia Henry, Richard Nock, Frank Nielsen:
  Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree. 842-847
  
• Manfred Hild, Frank Pasemann:
  Self-Adjusting Ring Modules (SARMs) for Flexible Gait Pattern Generation. 848-852
  
• Thomas R. Hinrichs, Kenneth D. Forbus:
  Analogical Learning in a Turn-Based Strategy Game. 853-858
  
• Jin Huang, Charles X. Ling:
  Constructing New and Better Evaluation Measures for Machine Learning. 859-864
  
• Michael R. James, Michael E. Samples, Dmitri A. Dolgov:
  Improving Anytime Point-Based Value Iteration Using Principled Point Selections. 865-870
  
• M. A. Jayaram, M. C. Nataraja, C. N. Ravikumar:
  A Three-Stage Neural Model for Attribute Based Classification and Indexing of Fly Ashes. 871-876
  
• Ashish Kapoor, Eric Horvitz, Sumit Basu:
  Selective Supervision: Guiding Supervised Learning with Decision-Theoretic Active Learning. 877-882
  
• Yohannes Kassahun, Mark Edgington, Jose de Gea, Frank Kirchner:
  Exploiting Sensorimotor Coordination for Learning to Recognize Objects. 883-888
  
• Aleksander Kolcz, Abdur Chowdhury:
  Avoidance of Model Re-Induction in SVM-Based Feature Selection for Text Categorization. 889-894
  
• George Konidaris, Andrew G. Barto:
  Building Portable Options: Skill Transfer in Reinforcement Learning. 895-900
  
• James T. Kwok, Pak-Ming Cheung:
  Marginalized Multi-Instance Kernels. 901-906
  
• Niels Landwehr, Luc De Raedt:
  r-grams: Relational Grams. 907-912
  
• Jianguo Li, Changshui Zhang, Tao Wang, Yimin Zhang:
  Generalized Additive Bayesian Network Classifiers. 913-918
  
• Wenye Li, Kwong-Sak Leung, Kin-Hong Lee:
  Generalizing the Bias Term of Support Vector Machines. 919-924
  
• Wenhui Liao, Yan Tong, Zhiwei Zhu, Qiang Ji:
  Robust Object Tracking with a Case-Base Updating Strategy. 925-930
  
• Shiau Hong Lim, Li-Lun Wang, Gerald DeJong:
  Explanation-Based Feature Construction. 931-
  
• Yan Liu, Jaime G. Carbonell, Vanathi Gopalakrishnan, Peter Weigele:
  Protein Quaternary Fold Recognition Using Conditional Graphical Models. 937-945
  
• Daniel J. Lizotte, Tao Wang, Michael H. Bowling, Dale Schuurmans:
  Automatic Gait Optimization with Gaussian Process Regression. 944-949
  
• Daniel Lowd, Pedro Domingos:
  Recursive Random Fields. 950-955
  
• Oscar Luaces, José Ramón Quevedo, Francisco Taboada, Guillermo M. Albaiceta, Antonio Bahamonde:
  Prediction of Probability of Survival in Critically Ill Patients Optimizing the Area under the ROC Curve. 956-961
  
• David McSherry, David W. Aha:
  The Ins and Outs of Critiquing. 962-967
  
• Loizos Michael:
  Learning from Partial Observations. 968-974
  
• Volker Nannen, A. E. Eiben:
  Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters. 975-980
  
• Mukund Narasimhan, Jeff Bilmes:
  Local Search for Balanced Submodular Clusterings. 981-986
  
• Canh Hao Nguyen, Tu Bao Ho:
  Kernel Matrix Evaluation. 987-992
  
• Feiping Nie, Shiming Xiang, Changshui Zhang:
  Neighborhood MinMax Projections. 993-998
  
• Santiago Ontañón, Enric Plaza:
  Case-based Learning from Proactive Communication. 999-1004
  
• Laurent Orseau:
  Learning to Count by Think Aloud Imitation. 1005-1010
  
• Chaithanya Pichuka, Raju S. Bapi, Chakravarthy Bhagvati, Arun K. Pujari, Bulusu Lakshmana Deekshatulu:
  A Tighter Error Bound for Decision Tree Learning Using PAC Learnability. 1011-1016
  
• Nathan D. Ratliff, J. Andrew Bagnell:
  Kernel Conjugate Gradient for Fast Kernel Machines. 1017-1022
  
• Balaraman Ravindran, Andrew G. Barto, Vimal Mathew:
  Deictic Option Schemas. 1023-1028
  
• Raquel Ros, Josep Lluís Arcos:
  Acquiring a Robust Case Base for the Robot Soccer Domain. 1029-1034
  
• Ansaf Salleb-Aouissi, Christel Vrain, Cyril Nortet:
  QuantMiner: A Genetic Algorithm for Mining Quantitative Association Rules. 1035-1040
  
• Manu Sharma, Michael P. Holmes, Juan Carlos Santamaría, Arya Irani, Charles Lee Isbell Jr., Ashwin Ram:
  Transfer Learning in Real-Time Strategy Games Using Hybrid CBR/RL. 1041-1046
  
• Young-In Shin, Donald S. Fussell:
  Parametric Kernels for Sequence Data Analysis. 1047-1052
  
• David Silver, Richard S. Sutton, Martin Müller:
  Reinforcement Learning of Local Shape in the Game of Go. 1053-1058
  
• Vikas Sindhwani, Wei Chu, S. Sathiya Keerthi:
  Semi-Supervised Gaussian Process Classifiers. 1059-1064
  
• Erik Talvitie, Satinder Singh:
  An Experts Algorithm for Transfer Learning. 1065-1070
  
• Ah-Hwee Tan:
  Direct Code Access in Self-Organizing Neural Networks for Reinforcement Learning. 1071-1076
  
• Brian Tanner, Vadim Bulitko, Anna Koop, Cosmin Paduraru:
  Grounding Abstractions in Predictive State Representations. 1077-1082
  
• Peter Tino, Nikolaos Gianniotis:
  Metric Properties of Structured Data Visualizations through Generative Probabilistic Modeling. 1083-1088
  
• Ivor W. Tsang, James T. Kwok:
  Ensembles of Partially Trained SVMs with Multiplicative Updates. 1089-1094
  
• Chenggang Wang, Saket Joshi, Roni Khardon:
  First Order Decision Diagrams for Relational MDPs. 1095-1100
  
• Haiying Wang, Huiru Zheng, Francisco Azuaje:
  Self-Adaptive Neural Networks Based on a Poisson Approach for Knowledge Discovery. 1101-1106
  
• Andreas Wendemuth:
  Dynamics of Temporal Difference Learning. 1107-1112
  
• Jonathan Wildstrom, Peter Stone, Emmett Witchel, Michael Dahlin:
  Machine Learning for On-Line Hardware Reconfiguration. 1113-1118
  
• Ben H. Williams, Marc Toussaint, Amos J. Storkey:
  A Primitive Based Generative Model to Infer Timing Information in Unpartitioned Handwriting Data. 1119-1124
  
• Mingrui Wu, Jason D. R. Farquhar:
  A Subspace Kernel for Nonlinear Feature Extraction. 1125-1130
  
• Patrick W. Yaner, Ashok K. Goel:
  Understanding Drawings by Compositional Analogy. 1131-1137
  
• Dit-Yan Yeung, Hong Chang, Guang Dai:
  A Scalable Kernel-Based Algorithm for Semi-Supervised Metric Learning. 1138-1143
  
• Peng Zang, Charles Lee Isbell Jr.:
  Managing Domain Knowledge and Multiple Models with Boosting. 1144-1149
  
• Yi Zhang, Xiaoming Jin:
  Concept Sampling: Towards Systematic Selection in Large-Scale Mixed Concepts in Machine Learning. 1150-1155
  
• Zheng Zhao, Huan Liu:
  Searching for Interacting Features. 1156-1161
  
• Ding Zhou, Levent Bolelli, Jia Li, C. Lee Giles, Hongyuan Zha:
  Learning User Clicks in Web Search. 1162-1167
  
• Xingquan Zhu, Xindong Wu, Taghi M. Khoshgoftaar, Yong Shi:
  An Empirical Study of the Noise Impact on Cost-Sensitive Learning. 1168-1174
  

Multiagent Systems

• Thomas Ågotnes, Wiebe van der Hoek, Juan A. Rodríguez-Aguilar, Carles Sierra, Michael Wooldridge:
  On the Logic of Normative Systems. 1175-1180
  
• Thomas Ågotnes, Wiebe van der Hoek, Michael Wooldridge:
  Quantified Coalition Logic. 1181-1186
  
• Alon Altman, Moshe Tennenholtz:
  An Axiomatic Approach to Personalized Ranking Systems. 1187-1192
  
• Bo An, Chunyan Miao, Zhiqi Shen:
  Market Based Resource Allocation with Incomplete Information. 1193-1198
  
• Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham:
  A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. 1199-1206
  
• Felix Brandt, Tuomas Sandholm, Yoav Shoham:
  Spiteful Bidding in Sealed-Bid Auctions. 1207-1214
  
• Teddy Candale, Sandip Sen:
  Multi-Dimensional Bid Improvement Algorithm for Simultaneous Auctions. 1215-1220
  
• Jesús Cerquides, Ulle Endriss, Andrea Giovannucci, Juan A. Rodríguez-Aguilar:
  Bidding Languages and Winner Determination for Mixed Multi-unit Combinatorial Auctions. 1221-1226
  
• Georgios Chalkiadakis, Craig Boutilier:
  Coalitional Bargaining with Agent Type Uncertainty. 1227-1232
  
• Shih-Fen Cheng, Michael P. Wellman:
  Iterated Weaker-than-Weak Dominance. 1233-1238
  
• Yann Chevaleyre, Ulle Endriss, Sylvia Estivie, Nicolas Maudet:
  Reaching Envy-Free States in Distributed Negotiation Settings. 1239-1244
  
• Samir Chopra, Laurence White:
  Privacy and Artificial Agents, or, Is Google Reading My Email? 1245-1250
  
• Vincent Conitzer, Tuomas Sandholm:
  Incremental Mechanism Design. 1251-1256
  
• Jonathan Dinerstein, Parris K. Egbert, Dan Ventura:
  Learning Policies for Embodied Virtual Agents through Demonstration. 1257-1262
  
• Kurt M. Dresner, Peter Stone:
  Sharing the Road: Autonomous Vehicles Meet Human Drivers. 1263-1268
  
• Partha Sarathi Dutta, Claudia V. Goldman, Nicholas R. Jennings:
  Communicating Effectively in Resource-Constrained Multi-Agent Systems. 1269-1274
  
• Nicolas Gaud, Franck Gechter, Stéphane Galland, Abder Koukam:
  Holonic Multiagent Multilevel Simulation: Application to Real-Time Pedestrian Simulation in Urban Environment. 1275-1280
  
• Rajesh Gautam, Kazuo Miyashita:
  Coordination to Avoid Starvation of Bottleneck Agents in a Large Network System. 1281-1286
  
• Enrico H. Gerding, Alex Rogers, Rajdeep K. Dash, Nicholas R. Jennings:
  Sellers Competing for Buyers in Online Markets: Reserve Prices, Shill Bids, and Auction Fees. 1287-1293
  
• Georg Gottlob, Gianluigi Greco, Toni Mancini:
  Complexity of Pure Equilibria in Bayesian Games. 1294-1299
  
• Joseph Y. Halpern, Yoram Moses:
  Characterizing Solution Concepts in Games Using Knowledge-Based Programs. 1300-1307
  
• Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
  Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. 1308-1314
  
• Alan Holland, Barry O'Sullivan:
  Truthful Risk-Managed Combinatorial Auctions. 1315-1320
  
• Mark Hoogendoorn:
  Adaptation of Organizational Models for Multi-Agent Systems Based on Max Flow Networks. 1321-1326
  
• Jian Huang, Adrian R. Pearce:
  Collaborative Inductive Logic Programming for Path Planning. 1327-1332
  
• Nathanael Hyafil, Craig Boutilier:
  Mechanism Design with Partial Revelation. 1333-1340
  
• Toru Ishida, Yuu Nakajima, Yohei Murakami, Hideyuki Nakanishi:
  Augmented Experiment: Participatory Design with Multiagent Simulation. 1341-1346
  
• Takayuki Ito, Hiromitsu Hattori, Mark Klein:
  Multi-issue Negotiation Protocol for Agents: Exploring Nonlinear Utility Spaces. 1347-1352
  
• Yichuan Jiang, Toru Ishida:
  A Model for Collective Strategy Diffusion in Agent Social Law Evolution. 1353-1358
  
• Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz Sungur:
  Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control. 1359-1365
  
• Jérôme Lang:
  Vote and Aggregation in Combinatorial Domains with Structured Preferences. 1366-1371
  
• Jérôme Lang, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
  Winner Determination in Sequential Majority Voting. 1372-1377
  
• Seong Jae Lee, Amy Greenwald, Victor Naroditskiy:
  RoxyBot-06: An (SAA)2 TAC Travel Agent. 1378-1383
  
• Alessio Lomuscio, Charles Pecheur, Franco Raimondi:
  Automatic Verification of Knowledge and Time with NuSMV. 1384-1389
  
• Rónán Mac Ruairi, Mark T. Keane:
  An Energy-Efficient, Multi-Agent Sensor Network for Detecting Diffuse Events. 1390-1395
  
• Vijay Kumar Mago, M. Syamala Devi:
  A Multi-Agent Medical System for Indian Rural Infant and Child Care. 1396-1401
  
• Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
  Infeasibility Certificates and the Complexity of the Core in Coalitional Games. 1402-1407
  
• Efrat Manisterski, Ron Katz, Sarit Kraus:
  Providing a Recommended Trading Agent to a Population: A Novel Approach. 1408-1414
  
• Efrat Manisterski, David Sarne, Sarit Kraus:
  Enhancing MAS Cooperative Search Through Coalition Partitioning. 1415-1421
  
• Dov Monderer:
  Multipotential Games. 1422-1427
  
• Megan M. Olsen, Hava T. Siegelmann:
  Multi-Agent System that Attains Longevity via Death. 1428-1433
  
• Nir Oren, Timothy J. Norman, Alun D. Preece:
  Argumentation Based Contract Monitoring in Uncertain Domains. 1434-
  
• Nardine Osman, David Robertson:
  Dynamic Verification of Trust in Distributed Open Systems. 1440-1445
  
• Jonathan P. Pearce, Milind Tambe:
  Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems. 1446-1451
  
• Adrian Petcu, Boi Faltings:
  MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization. 1452-1457
  
• Giovanni Pezzulo, Gianguglielmo Calvi, Cristiano Castelfranchi:
  DiPRA: Distributed Practical Reasoning Architecture. 1458-1463
  
• Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
  Incompleteness and Incomparability in Preference Aggregation. 1464-1469
  
• Ariel D. Procaccia, Yoram Bachrach, Jeffrey S. Rosenschein:
  Gossip-Based Aggregation of Trust in Decentralized Reputation Systems. 1470-1475
  
• Ariel D. Procaccia, Jeffrey S. Rosenschein, Aviv Zohar:
  Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination. 1476-1481
  
• Mark Richards, Eyal Amir:
  Opponent Modeling in Scrabble. 1482-1487
  
• Ola Rozenfeld, Moshe Tennenholtz:
  Routing Mediators. 1488-1493
  
• Sabyasachi Saha, Sandip Sen:
  An Efficient Protocol for Negotiation over Multiple Indivisible Resources. 1494-1499
  
• Tuomas Sandholm, Vincent Conitzer, Craig Boutilier:
  Automated Design of Multistage Mechanisms. 1500-1506
  
• Sandip Sen, Stéphane Airiau:
  Emergence of Norms through Social Learning. 1507-1512
  
• Carles Sierra, John K. Debenham:
  Information-Based Agency. 1513-1518
  
• Munindar P. Singh:
  Formalizing Communication Protocols for Multiagent Systems. 1519-1524
  
• Arpita Sinha, Debasish Ghose:
  Control of Agent Swarms Using Generalized Centroidal Cyclic Pursuit Laws. 1525-1530
  
• Evan Sultanik, Pragnesh Jay Modi, William C. Regli:
  On Modeling Multiagent Task Scheduling as a Distributed Constraint Optimization Problem. 1531-1536
  
• Emmanuel Tanguy, Philip J. Willis, Joanna Bryson:
  Emotions as Durative Dynamic State for Action Selection. 1537-
  
• Ioannis A. Vetsikas, Nicholas R. Jennings, Bart Selman:
  Generating Bayes-Nash Equilibria to Design Autonomous Trading Agents. 1543-1550
  
• Yonghong Wang, Munindar P. Singh:
  Formal Trust Model for Multiagent Systems. 1551-1556
  
• Peng Zang, Manish Mehta, Michael Mateas, Ashwin Ram:
  Towards Runtime Behavior Adaptation for Embodied Characters. 1557-1562
  
• Inon Zuckerman, Sarit Kraus, Jeffrey S. Rosenschein:
  Using Focal Point Learning to Improve Tactic Coordination in Human-Machine Interactions. 1563-1569
  

Natural Language Processing

• Rahul Bhagat, Eduard H. Hovy:
  Phonetic Models for Generating Spelling Variants. 1570-1575
  
• István Bíró, Zoltán Szamonek, Csaba Szepesvári:
  Sequence Prediction Exploiting Similary Information. 1576-1581
  
• Sutanu Chakraborti, Rahman Mukras, Robert Lothian, Nirmalie Wiratunga, Stuart N. K. Watt, David J. Harper:
  Supervised Latent Semantic Indexing Using Adaptive Sprinkling. 1582-1587
  
• Pascal Denis, Jason Baldridge:
  A Ranking Approach to Pronoun Resolution. 1588-1593
  
• Xiangyu Duan, Jun Zhao, Bo Xu:
  Word Sense Disambiguation through Sememe Labeling. 1594-1599
  
• Karolina Eliasson:
  Case-Based Techniques Used for Dialogue Understanding and Planning in a Human-Robot Dialogue System. 1600-1605
  
• Evgeniy Gabrilovich, Shaul Markovitch:
  Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis. 1606-1611
  
• Christopher W. Geib, Mark Steedman:
  On Natural Language Processing and Plan Recognition. 1612-1617
  
• Aarti Gupta, Tim Oates:
  Using Ontologies and the Web to Learn Lexical Semantics. 1618-1623
  
• David Guthrie, Louise Guthrie, Ben Allison, Yorick Wilks:
  Unsupervised Anomaly Detection. 1624-1628
  
• Long Jiang, Ming Zhou, Lee-Feng Chien, Cheng Niu:
  Named Entity Translation with Web Mining and Transliteration. 1629-1634
  
• Upali Sathyajith Kohomban, Wee Sun Lee:
  Optimizing Classifier Performance in Word Sense Disambiguation by Redefining Sense Classes. 1635-1640
  
• Mohit Kumar, Nikesh Garera, Alexander I. Rudnicky:
  Learning from the Report-writing Behavior of Individuals. 1641-1646
  
• Sylvain Lamprier, Tassadit Amghar, Bernard Levrat, Frédéric Saubion:
  SegGen: A Genetic Algorithm for Linear Text Segmentation. 1647-1652
  
• Lucian Vlad Lita, Jaime G. Carbonell:
  Cluster-Based Selection of Statistical Answering Strategies. 1653-1658
  
• Rahul Malik, L. Venkata Subramaniam, Saroj Kaushik:
  Automatically Selecting Answer Templates to Respond to Customer Emails. 1659-1664
  
• Yuval Marom, Ingrid Zukerman:
  A Predictive Approach to Help-Desk Response Generation. 1665-1670
  
• Takuya Matsuzaki, Yusuke Miyao, Jun'ichi Tsujii:
  Efficient HPSG Parsing with Supertagging and CFG-Filtering. 1671-1676
  
• Srinivas Medimi, Pushpak Bhattacharyya:
  A Flexible Unsupervised PP-Attachment Method Using Semantic Information. 1677-1682
  
• Roberto Navigli, Mirella Lapata:
  Graph Connectivity Measures for Unsupervised Word Sense Disambiguation. 1683-1688
  
• Vincent Ng:
  Shallow Semantics for Coreference Resolution. 1689-1694
  
• Minh Le Nguyen, Nguyen Thanh Tri, Akira Shimazu:
  Subtree Mining for Question Classification Problem. 1695-1700
  
• Shimei Pan, James Shaw:
  Natural Language Query Recommendation in Conversation Systems. 1701-1706
  
• Yanxin Shi, Mengqiu Wang:
  A Dual-layer CRFs Based Joint Decoding Method for Cascaded Segmentation and Labeling Tasks. 1707-1712
  
• Benjamin Snyder, Regina Barzilay:
  Database-Text Alignment via Structured Multilabel Classification. 1713-1718
  
• Carlo Strapparava, Alessandro Valitutti, Oliviero Stock:
  Dances with Words. 1719-1724
  
• George Tsatsaronis, Michalis Vazirgiannis, Ion Androutsopoulos:
  Word Sense Disambiguation with Spreading Activation Networks Generated from Thesauri. 1725-1730
  
• Kiyotaka Uchimoto, Hitoshi Isahara:
  Morphological Annotation of a Large Spontaneous Speech Corpus in Japanese. 1731-1737
  
• Srinivasan Umesh, D. Rama Sanand, G. Praveen:
  Speaker-Invariant Features for Automatic Speech Recognition. 1738-1743
  
• Jurgen Van Gael, Xiaojin Zhu:
  Correlation Clustering for Crosslingual Link Detection. 1744-1749
  
• Hao-Chuan Wang, Rohit Kumar, Carolyn Penstein Rosé, Tsai-Yen Li, Chun-Yen Chang:
  A Hybrid Ontology Directed Feedback Selection Algorithm for Supporting Creative Problem Solving Dialogues. 1750-1755
  
• Qin Iris Wang, Dekang Lin, Dale Schuurmans:
  Simple Training of Dependency Parsers via Structured Boosting. 1756-1762
  
• Yingchuan Wong, Hwee Tou Ng:
  One Class per Named Entity: Exploiting Unlabeled Text for Named Entity Recognition. 1763-1768
  
• Danny Wyatt, Tanzeem Choudhury, Jeff Bilmes, Henry A. Kautz:
  A Privacy-Sensitive Approach to Modeling Multi-Person Conversations. 1769-1775
  
• Wen-tau Yih, Joshua Goodman, Lucy Vanderwende, Hisami Suzuki:
  Multi-Document Summarization by Maximizing Informative Content-Words. 1776-1782
  
• Kazuhiro Yoshida, Yoshimasa Tsuruoka, Yusuke Miyao, Jun'ichi Tsujii:
  Ambiguous Part-of-Speech Tagging for Improving Accuracy and Domain Portability of Syntactic Parsers. 1783-1788
  
• Shiqi Zhao, Ting Liu, Xincheng Yuan, Sheng Li, Yu Zhang:
  Automatic Acquisition of Context-Specific Lexical Paraphrases. 1789-1794
  
• Shiqi Zhao, Ming Zhou, Ting Liu:
  Learning Question Paraphrases for QA from Encarta Logs. 1795-1801
  

Planning and Scheduling

• Massimiliano Albanese, Vincenzo Moscato, Antonio Picariello, V. S. Subrahmanian, Octavian Udrea:
  Detecting Stochastically Scheduled Activities in Video. 1802-1807
  
• Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlraith:
  A Heuristic Search Approach to Planning with Temporally Extended Preferences. 1808-1815
  
• Russell Bent, Pascal Van Hentenryck:
  Waiting and Relocation Strategies in Online Stochastic Vehicle Routing. 1816-1821
  
• Stefano Borgo:
  Coalitions in Action Logic. 1822-1827
  
• Adi Botea, Martin Müller, Jonathan Schaeffer:
  Fast Planning with Iterative Macros. 1828-1833
  
• Daniel Bryce, Seungchan Kim:
  Planning for Gene Regulatory Network Intervention. 1834-1839
  
• Yixin Chen, Zhao Xing, Weixiong Zhang:
  Long-Distance Mutual Exclusion for Propositional Planning. 1840-1845
  
• Jens Claßen, Patrick Eyerich, Gerhard Lakemeyer, Bernhard Nebel:
  Towards an Integration of Golog and Planning. 1846-1851
  
• William Cushing, Subbarao Kambhampati, Mausam, Daniel S. Weld:
  When is Temporal Planning Really Temporal? 1852-1859
  
• Peng Dai, Judy Goldsmith:
  Topological Value Iteration Algorithm for Markov Decision Processes. 1860-1865
  
• Giuseppe De Giacomo, Sebastian Sardiña:
  Automatic Synthesis of New Behaviors from a Library of Available Behaviors. 1866-1871
  
• Minh Binh Do, J. Benton, Menkes van den Briel, Subbarao Kambhampati:
  Planning with Goal Utility Dependencies. 1872-1878
  
• Alan Fern, Sriraam Natarajan, Kshitij Judah, Prasad Tadepalli:
  A Decision-Theoretic Model of Assistance. 1879-1884
  
• Susana Fernández, Ricardo Aler, Daniel Borrajo:
  Transferring Learned Control-Knowledge between Planners. 1885-1890
  
• Yilan Gu, Mikhail Soutchanski:
  Decidable Reasoning in a Modified Situation Calculus. 1891-1897
  
• Patrik Haslum:
  Reducing Accidental Complexity in Planning Problems. 1898-1903
  
• Sarah L. Hickmott, Jussi Rintanen, Sylvie Thiébaux, Langford B. White:
  Planning via Petri Net Unfolding. 1904-1911
  
• Shen-Shyang Ho, Harry Wechsler:
  Detecting Changes in Unlabeled Data Streams Using Martingale. 1912-1917
  
• Jörg Hoffmann, Carla P. Gomes, Bart Selman, Henry A. Kautz:
  SAT Encodings of State-Space Reachability Problems in Numeric Domains. 1918-1923
  
• Chih-Wei Hsu, Benjamin W. Wah, Ruoyun Huang, Yixin Chen:
  Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences. 1924-1929
  
• Wei Huang, Zhonghua Wen, Yunfei Jiang, Lihua Wu:
  Observation Reduction for Strong Plans. 1930-1935
  
• Anders Jonsson:
  The Role of Macros in Tractable Planning over Causal Graphs. 1936-1941
  
• Elena Kelareva, Olivier Buffet, Jinbo Huang, Sylvie Thiébaux:
  Factored Planning Using Decomposition Trees. 1942-1947
  
• Ryan F. Kelly, Adrian R. Pearce:
  Property Persistence in the Situation Calculus. 1948-1953
  
• T. K. Satish Kumar:
  Fast (Incremental) Algorithms for Useful Classes of Simple Temporal Problems with Preferences. 1954-1959
  
• Jürgen Kuster, Dietmar Jannach, Gerhard Friedrich:
  Handling Alternative Activities in Resource-Constrained Project Scheduling Problems. 1960-1965
  
• Robert Mattmüller, Jussi Rintanen:
  Planning for Temporally Extended Goals as Propositional Satisfiability. 1966-
  
• Mausam, Piergiorgio Bertoli, Daniel S. Weld:
  A Hybridized Planner for Stochastic Domains. 1972-1978
  
• Luc Mercier, Pascal Van Hentenryck:
  Performance Analysis of Online Anticipatory Algorithms for Large Multistage Stochastic Integer Programs. 1979-1984
  
• Michael D. Moffitt, Martha E. Pollack:
  Generalizing Temporal Controllability. 1985-1990
  
• A. Ricardo Morales, Phan Huy Tu, Tran Cao Son:
  An Extension to Conformant Planning Using Logic Programming. 1991-1996
  
• Marek Petrik, Shlomo Zilberstein:
  Average-Reward Decentralized Markov Decision Processes. 1997-2002
  
• Malcolm R. K. Ryan:
  Graph Decomposition for Efficient Multi-Robot Path Planning. 2003-2008
  
• Sven Seuken, Shlomo Zilberstein:
  Memory-Bounded Dynamic Programming for DEC-POMDPs. 2009-2015
  
• Biplav Srivastava, Tuan Anh Nguyen, Alfonso Gerevini, Subbarao Kambhampati, Minh Binh Do, Ivan Serina:
  Domain Independent Approaches for Finding Diverse Plans. 2016-2022
  
• Felipe W. Trevizan, Fabio Gagliardi Cozman, Leliane Nunes de Barros:
  Planning under Risk and Knightian Uncertainty. 2023-2028
  
• Stavros Vassos, Hector J. Levesque:
  Progression of Situation Calculus Action Theories with Incomplete Information. 2029-2024
  
• David Wingate, Vishal Soni, Britton Wolfe, Satinder P. Singh:
  Relational Knowledge with Predictive State Representations. 2035-2040
  
• Yuehua Xu, Alan Fern, Sung Wook Yoon:
  Discriminative Learning of Beam-Search Heuristics for Planning. 2041-2046
  
• Sung Wook Yoon, Alan Fern, Robert Givan:
  Using Learned Policies in Heuristic-Search Planning. 2047-2053
  

Robotics

• Mehran Asadi, Manfred Huber:
  Effective Control Knowledge Transfer through Learning Skill and Representation Hierarchies. 2054-2059
  
• Pranjal Awasthi, Aakanksha Gagrani, Balaraman Ravindran:
  Image Modeling Using Tree Structured Conditional Random Fields. 2060-2065
  
• Michael Beetz, Suat Gedikli, Jan Bandouch, Bernhard Kirchlechner, Nico von Hoyningen-Huene, Alexander Clifford Perzylo:
  Visually Tracking Football Games Based on TV Broadcasts. 2066-2071
  
• Michael Brenner, Nick Hawes, John D. Kelleher, Jeremy L. Wyatt:
  Mediating between Qualitative and Quantitative Representations for Task-Orientated Human-Robot Interaction. 2072-2077
  
• Rupert Brooks, Tal Arbel, Doina Precup:
  Fast Image Alignment Using Anytime Algorithms. 2078-2083
  
• Rawichote Chalodhorn, David B. Grimes, Keith Grochow, Rajesh P. N. Rao:
  Learning to Walk through Imitation. 2084-2090
  
• Alessandro Farinelli, Daniele Nardi, Paul Scerri, Alberto Ingenito:
  Dealing with Perception Errors in Multi-Robot System Coordination. 2091-2096
  
• Alessandro Farinelli, Alberto Finzi, Thomas Lukasiewicz:
  Team Programming in Golog under Partial Observability. 2097-2102
  
• Pasquale Foggia, Jean-Michel Jolion, Alessandro Limongiello, Mario Vento:
  A New Approach for Stereo Matching in Autonomous Mobile Robot Applications. 2103-2108
  
• Stephen Friedman, Hanna Pasula, Dieter Fox:
  Voronoi Random Fields: Extracting Topological Structure of Indoor Environments via Place Labeling. 2109-2114
  
• Stephen Gould, Joakim Arfvidsson, Adrian Kaehler, Benjamin Sapp, Marius Messner, Gary R. Bradski, Paul Baumstarck, Sukwon Chung, Andrew Y. Ng:
  Peripheral-Foveal Vision for Real-time Object Recognition and Tracking in Video. 2115-2121
  
• Timothy M. Hospedales, Joel J. Cartwright, Sethu Vijayakumar:
  Structure Inference for Bayesian Multisensory Perception and Tracking. 2122-2128
  
• Michael Kaess, Ananth Ranganathan, Frank Dellaert:
  Fast Incremental Square Root Information Smoothing. 2129-2134
  
• Ganesh P. Kumar, K. Madhava Krishna:
  Optimal Multi-Sensor Based Multi Target Detection by Moving Sensors to the Maximal Clique in a Covering Graph. 2135-2140
  
• Wei Liu, Xiaoou Tang, Jianzhuang Liu:
  Bayesian Tensor Inference for Sketch-Based Facial Photo Hallucination. 2141-2146
  
• Dimitri Marinakis, Gregory Dudek:
  Topological Mapping through Distributed, Passive Sensors. 2147-2152
  
• Fulvio Mastrogiovanni, Antonio Sgorbissa, Renato Zaccaria:
  A Distributed Architecture for Symbolic Data Fusion. 2153-2158
  
• Yutaka Matsuo, Naoaki Okazaki, Kiyoshi Izumi, Yoshiyuki Nakamura, Takuichi Nishimura, Kôiti Hasida, Hideyuki Nakashima:
  Inferring Long-term User Properties Based on Users' Location History. 2159-2165
  
• Jeffrey Junfeng Pan, Qiang Yang:
  Co-Localization from Labeled and Unlabeled Data Using Graph Laplacian. 2166-2171
  
• Amit Kumar Pandey, K. Madhava Krishna, Mainak Nath:
  Feature Based Occupancy Grid Maps for Sonar Based Safe-Mapping. 2172-
  
• Anna Petrovskaya, Andrew Y. Ng:
  Probabilistic Mobile Manipulation in Dynamic Environments, with Application to Opening Doors. 2178-2184
  
• Christian Plagemann, Dieter Fox, Wolfram Burgard:
  Efficient Failure Detection on Mobile Robots Using Particle Filters with Gaussian Process Proposals. 2185-2190
  
• Ananth Ranganathan, Michael Kaess, Frank Dellaert:
  Loopy SAM. 2191-2196
  
• Ashutosh Saxena, Jamie Schulte, Andrew Y. Ng:
  Depth Estimation Using Monocular and Stereo Cues. 2197-2203
  
• Amarjeet Singh, Andreas Krause, Carlos Guestrin, William J. Kaiser, Maxim A. Batalin:
  Efficient Planning of Informative Paths for Multiple Robots. 2204-2211
  
• Mohan Sridharan, Peter Stone:
  Color Learning on a Mobile Robot: Towards Full Autonomy under Changing Illumination. 2212-2217
  
• David Stavens, Gabriel Hoffmann, Sebastian Thrun:
  Online Speed Adaptation Using Supervised Learning for High-Speed, Off-Road Autonomous Driving. 2218-2224
  
• Rudolph Triebel, Richard Schmidt, Óscar Martínez Mozos, Wolfram Burgard:
  Instace-Based AMN Classification for Improved Object Recognition in 2D and 3D Laser Range Data. 2225-2230
  
• Felix von Hundelshausen, Hans-Joachim Wünsche, Marco Block, Raul Kompass, Raúl Rojas:
  MESH-Based Active Monte Carlo Recognition (MESH-AMCR). 2231-2236
  
• Shiaokai Wang, William Pentney, Ana-Maria Popescu, Tanzeem Choudhury, Matthai Philipose:
  Common Sense Based Joint Training of Human Activity Recognizers. 2237-2242
  
• Chee K. Wong, Jochen Schmidt, Wai K. Yeap:
  Using a Mobile Robot for Cognitive Mapping. 2243-2249
  

Search

• Sandip Aine, P. P. Chakrabarti, Rajeev Kumar:
  AWA* - A Window Constrained Anytime Heuristic Search Algorithm. 2250-2255
  
• Gilles Audemard, Laurent Simon:
  GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. 2256-2261
  
• Gilles Audemard, Saïd Jabbour, Lakhdar Sais:
  Symmetry Breaking in Quantified Boolean Formulae. 2262-2267
  
• Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur:
  Computational Aspects of Analyzing Social Network Dynamics. 2268-2273
  
• Nicolas Baskiotis, Michèle Sebag, Marie-Claude Gaudel, Sandrine-Dominique Gouraud:
  A Machine Learning Approach for Statistical Software Testing. 2274-2279
  
• Ron Bekkerman, Shlomo Zilberstein, James Allan:
  Web Page Clustering Using Heuristic Search in the Web Graph. 2280-2285
  
• Andrew Gilpin, Tuomas Sandholm:
  Information-Theoretic Approaches to Branching in Search. 2286-2292
  
• Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman:
  From Sampling to Model Counting. 2293-2299
  
• Éric Grégoire, Bertrand Mazure, Cédric Piette:
  Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle. 2300-2305
  
• Joseph Y. Halpern, Leandro Chaves Rêgo:
  Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic. 2306-2311
  
• Carlos Hernández, Pedro Meseguer:
  Improving LRTA*(k). 2312-2317
  
• Jinbo Huang:
  The Effect of Restarts on the Efficiency of Clause Learning. 2318-2323
  
• Richard E. Korf, Ariel Felner:
  Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem. 2324-2329
  
• Nga Lam Law, Kwok Yip Szeto:
  Adaptive Genetic Algorithm with Mutation and Crossover Matrices. 2330-2333
  
• Han Lin, Kaile Su:
  Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving. 2334-2339
  
• Lawrence Mandow, José-Luis Pérez-de-la-Cruz:
  A Multiobjective Frontier Search Algorithm. 2340-2345
  
• Robert Mateescu, Rina Dechter:
  A Comparison of Time-Space Schemes for Graphical Models. 2346-2352
  
• Patrice Perny, Olivier Spanjaard, Louis-Xavier Storme:
  State Space Search for Risk-Averse Agents. 2353-2358
  
• Duc Nghia Pham, John Thornton, Abdul Sattar:
  Building Structure into Local Search for SAT. 2359-2364
  
• Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dang, Nicholas R. Jennings:
  Near-Optimal Anytime Coalition Structure Generation. 2365-2371
  
• D. Chris Rayner, Katherine Davison, Vadim Bulitko, Kenneth Anderson, Jieshan Lu:
  Real-Time Heuristic Search with a Priority Queue. 2372-2377
  
• Wheeler Ruml, Minh Binh Do:
  Best-First Utility-Guided Search. 2378-2384
  
• Xiaoxun Sun, Marek J. Druzdzel, Changhe Yuan:
  Dynamic Weighting A* Search-Based MAP Algorithm for Bayesian Networks. 2385-2390
  
• Xiaoxun Sun, Sven Koenig:
  The Fringe-Saving A* Search Algorithm - A Feasibility Study. 2391-2397
  
• Guihua Wen, Lijun Jiang, Nigel R. Shadbolt:
  Using Graph Algebra to Optimize Neighborhood for Isometric Mapping. 2398-2403
  
• Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller:
  Lambda Depth-First Proof Number Search and Its Application to Go. 2404-2409
  
• Rong Zhou, Eric A. Hansen:
  Edge Partitioning in External-Memory Graph Search. 2410-2417
  

Uncertainty

• Christopher Amato, Daniel S. Bernstein, Shlomo Zilberstein:
  Solving POMDPs Using Quadratically Constrained Linear Programs. 2418-2424
  
• Salem Benferhat, Safa Yahi, Habiba Drias:
  On the Compilation of Stratified Belief Bases under Linear and Possibilistic Logic Policies. 2425-2430
  
• Facundo Bromberg, Dimitris Margaritis:
  Efficient and Robust Independence-Based Markov Network Structure Discovery. 2431-2436
  
• Pablo Samuel Castro, Doina Precup:
  Using Linear Programming for Bayesian Exploration in Markov Decision Processes. 2437-2442
  
• Mark Chavira, Adnan Darwiche:
  Compiling Bayesian Networks Using Variable Elimination. 2443-2449
  
• Paolo Ciancarini, Gian Piero Favini:
  Representing Kriegspiel States with Metapositions. 2450-2455
  
• Madalina Croitoru, Kees van Deemter:
  A Conceptual Graph Approach for the Generation of Referring Expressions. 2456-2461
  
• Luc De Raedt, Angelika Kimmig, Hannu Toivonen:
  ProbLog: A Probabilistic Prolog and Its Application in Link Discovery. 2462-2467
  
• James P. Delgrande, Jérôme Lang, Torsten Schaub:
  Belief Change Based on Global Minimisation. 2468-2473
  
• Eyal Even-Dar, Sham M. Kakade, Yishay Mansour:
  The Value of Observation for Monitoring Dynamic Systems. 2474-2479
  
• Brian Ferris, Dieter Fox, Neil D. Lawrence:
  WiFi-SLAM Using Gaussian Process Latent Variable Models. 2480-2485
  
• Guohua Hao, Alan Fern:
  Revisiting Output Coding for Sequential Supervised Learning. 2486-2491
  
• Jingrui He, Jaime G. Carbonell, Yan Liu:
  Graph-Based Semi-Supervised Learning as a Generative Model. 2492-2497
  
• Aaron Hunter, James P. Delgrande:
  An Action Description Language for Iterated Belief Change. 2498-2503
  
• Jorge Jambeiro Filho, Jacques Wainer:
  Using a Hierarchical Bayesian Model to Handle High Cardinality Attributes with Relevant Interactions in a Classification Problem. 2504-2509
  
• Ted Kremenek, Andrew Y. Ng, Dawson R. Engler:
  A Factor Graph Model for Software Bug Finding. 2510-2516
  
• Jérôme Lang:
  Belief Update Revisited. 2517-2522
  
• Seunghak Lee, Iryoung Jeong, Seungjin Choi:
  Dynamically Weighted Hidden Markov Model for Spam Deobfuscation. 2523-2529
  
• Lin Liao, Tanzeem Choudhury, Dieter Fox, Henry A. Kautz:
  Training Conditional Random Fields Using Virtual Evidence Boosting. 2530-2535
  
• Janusz Marecki, Sven Koenig, Milind Tambe:
  A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources. 2536-2541
  
• Nicolas Meuleau, Ronen I. Brafman:
  Hierarchical Heuristic Forward Search in Stochastic Domains. 2542-2549
  
• Shin-ichi Minato, Ken Satoh, Taisuke Sato:
  Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs. 2550-2555
  
• Shravan Matthur Narayanamurthy, Balaraman Ravindran:
  Efficiently Exploiting Symmetries in Real Time Dynamic Programming. 2556-2561
  
• Pradeep Natarajan, Ramakant Nevatia:
  Hierarchical Multi-channel Hidden Semi Markov Models. 2562-2567
  
• Abhaya C. Nayak, Randy Goebel, Mehmet A. Orgun:
  Iterated Belief Contraction from First Principles. 2568-2573
  
• Marek Petrik:
  An Analysis of Laplacian Methods for Value Function Approximation in MDPs. 2574-2579
  
• Avi Pfeffer, Subrata Das, David Lawless, Brenda Ng:
  Global/Local Dynamic Models. 2580-2585
  
• Deepak Ramachandran, Eyal Amir:
  Bayesian Inverse Reinforcement Learning. 2586-2591
  
• Stéphane Ross, Brahim Chaib-draa:
  AEMS: An Anytime Online Search Algorithm for Approximate Policy Refinement in Large POMDPs. 2592-2598
  
• Daniel M. Roy, Leslie Pack Kaelbling:
  Efficient Bayesian Task-Level Transfer Learning. 2599-2604
  
• Taisuke Sato:
  Inside-Outside Probability Computation for Belief Propagation. 2605-2610
  
• Dafna Shahaf, Eyal Amir:
  Logical Circuit Filtering. 2611-2618
  
• Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony:
  Forward Search Value Iteration for POMDPs. 2619-2624
  
• Steven Shapiro, Gerhard Brewka:
  Dynamic Interactions between Goals and Beliefs. 2625-2630
  
• Finnegan Southey, Wesley Loh, Dana F. Wilkinson:
  Inferring Complex Agent Motions from Partial Trajectory Observations. 2631-2637
  
• Pradeep Varakantham, Rajiv T. Maheswaran, Tapana Gupta, Milind Tambe:
  Towards Efficient Computation of Error Bounded Solutions in POMDPs: Expected Value Approximation and Dynamic Disjunctive Beliefs. 2638-2644