default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st AAAI / 18th IAAI 2006: Boston, Massachusetts, USA
- Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, July 16-20, 2006, Boston, Massachusetts, USA. AAAI Press 2006
Invited Talk
- Pedro M. Domingos, Stanley Kok, Hoifung Poon, Matthew Richardson, Parag Singla:
Unifying Logical and Statistical AI. 2-9
Technical Papers
Constraint Satisfaction and Satisfiability
- Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu:
The Impact of Balancing on Problem Hardness in a Highly Structured Domain. 10-15 - Marco Benedetti:
Abstract Branching for Quantified Formulas. 16-21 - Simon de Givry, Thomas Schiex, Gérard Verfaillie:
Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP. 22-27 - Robert T. Effinger, Brian Charles Williams:
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs. 28-35 - Paul Elliott, Brian C. Williams:
DNNF-based Belief State Estimation. 36-41 - Hélène Fargier, Pierre Marquis:
On the Use of Partially Ordered Decision Graphs in Knowledge Compilation and Quantified Boolean Formulae. 42-47 - Carmen Gervet, Pascal Van Hentenryck:
Length-Lex Ordering for Set CSPs. 48-53 - Carla P. Gomes, Ashish Sabharwal, Bart Selman:
Model Counting: A New Strategy for Obtaining Good Bounds. 54-61 - Tarik Hadzic, Henrik Reif Andersen:
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration. 62-67 - Federico Heras, Javier Larrosa:
New Inference Rules for Efficient Max-SAT Solving. 68-73 - T. K. Satish Kumar:
Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints. 74-79 - J. H. M. Lee, C. F. K. Siu:
Weighted Constraint Satisfaction with Set Variables. 80-85 - Chu Min Li, Felip Manyà, Jordi Planes:
Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. 86-91 - Zhijun Lin, Yuanlin Zhang, Hector Hernandez:
Fast SAT-based Answer Set Solver. 92-97 - Lengning Liu, Miroslaw Truszczynski:
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints. 98-103 - Inês Lynce, João Marques-Silva:
Efficient Haplotype Inference with Boolean Satisfiability. 104-109 - Michael D. Moffitt, Martha E. Pollack:
Temporal Preference Optimization as Weighted Constraint Satisfaction. 110-116 - Jean-François Puget:
An Efficient Way of Breaking Value Symmetries. 117-122 - Claude-Guy Quimper, Alejandro López-Ortiz, Gilles Pesant:
A Quadratic Propagator for the Inter-Distance Constraint. 123-128 - Tran Cao Son, Enrico Pontelli, Phan Huy Tu:
Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms. 129-134 - Matthew J. Streeter, Stephen F. Smith:
An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem. 135-142 - Lintao Zhang:
Solving QBF by Combining Conjunctive and Disjunctive Normal Forms. 143-150
Human Computer Interaction and Cognitive Modeling
- Carole R. Beal, Lei Qu, Hyokyeong Lee:
Classifying Learner Engagement through Integration of Multiple Data Sources. 151-156 - Li Chen, Pearl Pu:
Evaluating Critiquing-based Recommender Agents. 157-162 - Jeffrey Johns, Beverly Park Woolf:
A Dynamic Mixture Model to Detect Student Motivation and Proficiency. 163-168 - Ron Katz, Sarit Kraus:
Modeling Human Decision Making in Cliff-Edge Environments. 169-174 - Carlos Martinho, Ana Paiva:
Using Anticipation to Create Believable Behaviour. 175-180 - Tom M. Mitchell, Sophie H. Wang, Yifen Huang, Adam Cheyer:
Extracting Knowledge about Users' Activities from Raw Workstation Contents. 181-186 - Bradford W. Mott, Sunyoung Lee, James C. Lester:
Probabilistic Goal Recognition in Interactive Narrative Environments. 187-192 - Subramonia Sarma, Yoonsuck Choe:
Salience in Orientation-Filter Response Measured as Suspicious Coincidence in Natural Images. 193-198 - Marc T. Tomlinson, Bradley C. Love:
From Pigeons to Humans: Grounding Relational Learning in Concrete Examples. 199-204 - Paolo Viappiani, Boi Faltings, Pearl Pu:
Evaluating Preference-based Search Tools: A Tale of Two Approaches. 205-212
Knowledge Representation and Logic
- Alexandre Albore, Natasha Alechina, Piergiorgio Bertoli, Chiara Ghidini, Brian Logan, Luciano Serafini:
Model-Checking Memory Requirements of Resource-Bounded Reasoners. 213-218 - Leila Amgoud, Henri Prade:
Explaining Qualitative Decision under Uncertainty by Argumentation. 219-224 - Yolifé Arvelo, Blai Bonet, Maria-Esther Vidal:
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic. 225-230 - Chitta Baral, Jicheng Zhao:
Goal Specification, Non-Determinism and Quantifying over Policies. 231-237 - Thomas Eiter, Kewen Wang:
Forgetting and Conflict Resolving in Disjunctive Logic Programming. 238-243 - Martin Gebser, Joohyung Lee, Yuliya Lierler:
Elementary Sets of Logic Programs. 244-249 - Georg Gottlob, Reinhard Pichler, Fang Wei:
Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. 250-256 - Aaron Hunter, James P. Delgrande:
Belief Change in the Context of Fallible Actions and Observations. 257-262 - Gerhard Lakemeyer, Hector J. Levesque:
Towards an Axiom System for Default Logic. 263-268 - Thomas Andreas Meyer, Kevin Lee, Richard Booth, Jeff Z. Pan:
Finding Maximally Satisfiable Terminologies for the Description Logic ALC. 269-274 - Magdalena Ortiz, Diego Calvanese, Thomas Eiter:
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics. 275-280 - Guilin Qi, Weiru Liu, David A. Bell:
Merging Stratified Knowledge Bases under Constraints. 281-286 - Stephan Schiffel, Michael Thielscher:
Reconciling Situation Calculus and Fluent Calculus. 287-292 - Ke Wang, Yabo Xu, Rong She, Philip S. Yu:
Classification Spanning Private Databases. 293-298 - Michael J. Wooldridge, Paul E. Dunne, Simon Parsons:
On the Complexity of Linking Deductive and Abstract Argument Systems. 299-304 - Peter Z. Yeh, Bruce W. Porter, Ken Barker
:
A Unified Knowledge Based Approach for Sense Disambiguation and Semantic Role Labeling. 305-311
Machine Learning
- Fabrizio Angiulli:
Clustering by Exceptions. 312-317 - Sooraj Bhat, Charles Lee Isbell Jr., Michael Mateas:
On the Difficulty of Modular Reinforcement Learning for Real-World Partial Programming. 318-323 - Yaxin Bi, Sally I. McClean, Terry J. Anderson:
On Combining Multiple Classifiers Using an Evidential Approach. 324-329 - Guang Dai, Dit-Yan Yeung:
Tensor Embedding Methods. 330-335 - Ian Davidson, S. S. Ravi:
Identifying and Generating Easy Sets of Constraints for Clustering. 336-341 - Chris H. Q. Ding, Tao Li, Wei Peng:
Nonnegative Matrix Factorization and Probabilistic Latent Semantic Indexing: Equivalence Chi-Square Statistic, and a Hybrid Method. 342-347 - Saher Esmeir, Shaul Markovitch:
Anytime Induction of Decision Trees: An Iterative Improvement Approach. 348-355 - Alborz Geramifard, Michael H. Bowling, Richard S. Sutton:
Incremental Least-Squares Temporal Difference Learning. 356-361 - Nela Gurevich, Shaul Markovitch, Ehud Rivlin:
Active Learning with Near Misses. 362-367 - Christopher Hundt, Prakash Panangaden, Joelle Pineau, Doina Precup:
Representing Systems with Hidden State. 368-374 - Michael R. James, Ton Wessling, Nikos Vlassis:
Improving Approximate Value Iteration Using Memories and Predictive State Representations. 375-380 - Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griffiths, Takeshi Yamada, Naonori Ueda:
Learning Systems of Concepts with an Infinite Relational Model. 381-388 - Niels Landwehr, Andrea Passerini, Luc De Raedt, Paolo Frasconi:
kFOIL: Learning Simple Relational Kernels. 389-394 - Niklas Lavesson, Paul Davidsson:
Quantifying the Impact of Learning Algorithm Parameter Tuning. 395-400 - Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. Ng:
Efficient L1 Regularized Logistic Regression. 401-408 - Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guozhu Dong:
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns. 409-414 - Yaxin Liu, Peter Stone:
Value-Function-Based Transfer for Reinforcement Learning Using Structure Mapping. 415-420 - Yi Liu, Rong Jin, Liu Yang:
Semi-supervised Multi-label Learning by Constrained Non-negative Matrix Factorization. 421-426 - Richard Maclin, Jude W. Shavlik, Trevor Walker, Lisa Torrey:
A Simple and Effective Method for Incorporating Advice into Kernel Methods. 427-432 - Andrew McCallum, Chris Pal, Gregory Druck, Xuerui Wang:
Multi-Conditional Learning: Generative/Discriminative Training for Clustering and Classification. 433-439 - Matthew Michelson, Craig A. Knoblock:
Learning Blocking Schemes for Record Linkage. 440-445 - Tom Y. Ouyang, Kenneth D. Forbus:
Strategy Variations in Analogical Problem Solving. 446-451 - Charles Parker, Alan Fern, Prasad Tadepalli:
Gradient Boosting for Sequence Alignment. 452-457 - Hoifung Poon, Pedro M. Domingos:
Sound and Efficient Inference with Probabilistic and Deterministic Dependencies. 458-463 - Achim Rettinger, Martin Zinkevich, Michael H. Bowling:
Boosting Expert Ensembles for Rapid Concept Recall. 464-469 - Jianhua Ruan, Weixiong Zhang:
Identification and Evaluation of Weak Community Structures in Networks. 470-475 - Victor S. Sheng, Charles X. Ling:
Thresholding for Making Classifiers Cost-sensitive. 476-481 - Shengli Sheng, Charles X. Ling, Ailing Ni, Shichao Zhang:
Cost-Sensitive Test Strategies. 482-487 - Parag Singla, Pedro M. Domingos:
Memory-Efficient Inference in Relational Domains. 488-493 - Vishal Soni, Satinder Singh:
Using Homomorphisms to Transfer Options across Continuous Reinforcement Learning Domains. 494-499 - Jiang Su, Harry Zhang:
A Fast Decision Tree Learning Algorithm. 500-505 - Samarth Swarup, Sylvian R. Ray:
Cross-Domain Knowledge Transfer Using Structured Representations. 506-511 - Sean R. Szumlanski, Annie S. Wu, Charles E. Hughes:
Conflict Resolution and a Framework for Collaborative Interactive Evolution. 512-517 - Shimon Whiteson, Peter Stone:
Sample-Efficient Evolutionary Function Approximation for Reinforcement Learning. 518-523 - David Wingate, Satinder Singh:
Mixtures of Predictive Linear Gaussian Models for Nonlinear, Stochastic Dynamical Systems. 524-529 - Alicia P. Wolfe, Andrew G. Barto:
Decision Tree Methods for Finding Reusable MDP Homomorphisms. 530-535 - Linli Xu, Koby Crammer, Dale Schuurmans:
Robust Support Vector Machine Training via Convex Outlier Ablation. 536-542 - Liu Yang, Rong Jin, Rahul Sukthankar, Yi Liu:
An Efficient Algorithm for Local Distance Metric Learning. 543-548 - Wai-Leong Yeow, Chen-Khong Tham, Wai-Choong Wong:
Hard Constrained Semi-Markov Decision Processes. 549-554 - Yang Yu, Zhi-Hua Zhou:
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms. 555-560 - Qijun Zhao, David Zhang, Hongtao Lu:
A Direct Evolutionary Feature Extraction Algorithm for Classifying High Dimensional Data. 561-566 - Zhi-Hua Zhou, Xu-Ying Liu:
On Multi-Class Cost-Sensitive Learning. 567-572 - Martin Zinkevich, Michael H. Bowling, Nolan Bard, Morgan Kan, Darse Billings:
Optimal Unbiased Estimators for Evaluating Agent Performance. 573-579
Multiagent Systems
- Mazda Ahmadi, Peter Stone:
Keeping in Touch: Maintaining Biconnected Structure by Homogeneous Robots. 580-585 - Alon Altman, Moshe Tennenholtz:
Quantifying Incentive Compatibility of Ranking Systems. 586-591 - Moshe Babaioff, Ron Lavi, Elan Pavlov:
Impersonation-Based Mechanisms. 592-597 - Michael Benisch, George B. Davis, Tuomas Sandholm:
Algorithms for Rationalizability and CURB Sets. 598-604 - Felix Brandt, Felix A. Fischer, Yoav Shoham:
On Strictly Competitive Multi-Player Games. 605-612 - Vincent Conitzer:
Computing Slater Rankings Using Similarities among Candidates. 613-619 - Vincent Conitzer, Andrew J. Davenport, Jayant Kalagnanam:
Improved Bounds for Computing Kemeny Rankings. 620-626 - Vincent Conitzer, Tuomas Sandholm:
Nonexistence of Voting Rules That Are Usually Hard to Manipulate. 627-634 - Viet Dung Dang, Rajdeep K. Dash, Alex Rogers, Nicholas R. Jennings:
Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks. 635-640 - Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Bribery in Elections. 641-646 - Rachel Greenstadt, Jonathan P. Pearce, Milind Tambe:
Analysis of Privacy Loss in Distributed Constraint Optimization. 647-653 - Gery Gutnik, Gal A. Kaminka:
From Centralized to Distributed Selective Overhearing. 654-659 - Katsutoshi Hirayama:
A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction. 660-665 - Jian Huang, Adrian R. Pearce:
Distributed Interactive Learning in Multi-Agent Systems. 666-671 - Nathanael Hyafil, Craig Boutilier:
Regret-based Incremental Partial Revelation Mechanisms. 672-678 - Albert Xin Jiang, Kevin Leyton-Brown:
A Polynomial-Time Algorithm for Action Graph Games. 679-684 - Kaivan Kamali, Xiaocong Fan, John Yen:
Multiparty Proactive Communication: A Perspective for Evolving Shared Mental Models. 685-690 - Dov Monderer, Moshe Tennenholtz:
Strong Mediated Equilibrium. 691-696 - Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki Maruono, Vincent Conitzer, Tuomas Sandholm:
A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments. 697-702 - Adrian Petcu, Boi Faltings:
ODPOP: An Algorithm for Open/Distributed Constraint Optimization. 703-708 - Amit Shabtay, Zinovi Rabinovich, Jeffrey S. Rosenschein:
Behaviosites: Manipulation of Multiagent System Behavior through Parasitic Infection. 709-715 - Gita Sukthankar, Katia P. Sycara:
Simultaneous Team Assignment and Behavior Recognition from Spatio-Temporal Agent Traces. 716-721 - Yathiraj B. Udupi, Munindar P. Singh:
Contract Enactment in Virtual Organizations: A Commitment-Based Approach. 722-727 - Dongmo Zhang, Yan Zhang:
A Computational Model of Logic-Based Negotiation. 728-733 - Aviv Zohar, Jeffrey S. Rosenschein:
Mechanisms for Partial Information Elicitation: The Truth, but Not the Whole Truth. 734-739 - Aviv Zohar, Jeffrey S. Rosenschein:
Robust Mechanisms for Information Elicitation. 740-746
Natural Language Processing
- David DeVault, Iris Oved, Matthew Stone:
Societal Grounding Is Essential to Meaningful Language Use. 747-754 - Sanda M. Harabagiu, Andrew Hickl, V. Finley Lacatusu:
Negation, Contrast and Contradiction in Text Processing. 755-762 - Man Lan, Chew Lim Tan, Hwee-Boon Low:
Proposing a New Term Weighting Scheme for Text Categorization. 763-768 - Shijian Lu, Chew Lim Tan:
Script and Language Identification in Degraded and Distorted Document Images. 769-774 - Rada Mihalcea, Courtney D. Corley, Carlo Strapparava:
Corpus-based and Knowledge-based Measures of Text Semantic Similarity. 775-780 - Vivi Nastase, Jelber Sayyad-Shirabad, Marina Sokolova, Stan Szpakowicz:
Learning Noun-Modifier Semantic Relations with Corpus-based and WordNet-based Features. 781-787
Reasoning about Plans and Actions
- Jorge A. Baier, Sheila A. McIlraith:
Planning with First-Order Temporally Extended Goals using Heuristic Search. 788-795 - Nate Blaylock, James F. Allen:
Fast Hierarchical Goal Schema Recognition. 796-801 - Stephen A. Block, Andreas F. Wehowsky, Brian C. Williams:
Robust Execution on Contingent, Temporally Flexible Plans. 802-808 - Ronen I. Brafman, Carmel Domshlak:
Factored Planning: How, When, and When Not. 809-814 - Balázs Csanád Csáji, László Monostori:
Adaptive Sampling Based Large-Scale Stochastic Resource Control. 815-820 - Stefan Edelkamp, Shahid Jabbar:
Cost-Optimal External Planning. 821-826