ijcai 2009 论文列表IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009. |
Incorporating User Behaviors in New Word Detection.
Streamlining Attacks on CAPTCHAs with a Computer Game.
Towards Ontology Learning from Folksonomies.
Large-Scale Taxonomy Mapping for Restructuring and Integrating Wikipedia.
Exploiting Background Knowledge to Build Reference Sets for Information Extraction.
Conjunctive Query Answering in the Description Logic EL Using a Relational Database System.
A Content-Based Method to Enhance Tag Recommendation.
Using Web Photos for Measuring Video Frame Interestingness.
Can Movies and Books Collaborate? Cross-Domain Collaborative Filtering for Sparsity Reduction.
Efficient Estimation of Influence Functions for SIS Model on Social Networks.
Consequence-Driven Reasoning for Horn SHIQ Ontologies.
Improving Search in Social Networks by Agent Based Mining.
Dynamic Selection of Ontological Alignments: A Space Reduction Mechanism.
Spatial Processes for Recommender Systems.
Sketching Techniques for Collaborative Filtering.
DL-LITER in the Light of Propositional Logic for Decentralized Data Management.
A General Approach to Environment Design with One Agent.
Speeding Up Exact Solutions of Interactive Dynamic Influence Diagrams Using Action Equivalence.
A Syntax-based Framework for Merging Imprecise Probabilistic Logic Programs.
Efficient Computation of Jointree Bounds for Systematic MAP Search.
Learning a Value Analysis Tool for Agent Evaluation.
Parameter Identification in a Class of Linear Structural Equation Models.
Variable and Value Ordering for MPE Search.
Testing Edges by Truncations.
Speeding Up Inference in Markov Logic Networks by Preprocessing to Reduce the Size of the Resulting Grounded Network.
CTPPL: A Continuous Time Probabilistic Programming Language.
A Sparse Covariance Function for Exact Gaussian Process Inference in Large Datasets.
Learning Conditional Preference Networks with Queries.
Lifted Aggregation in Directed First-Order Probabilistic Models.
Generalized First Order Decision Diagrams for First Order Markov Decision Processes.
Greedy Algorithms for Sequential Sensing Decisions.
Multiobjective Optimization using GAI Models.
Fast Recommendations using GAI Models.
Ceteris Paribus Preference Elicitation with Predictive Guarantees.
Markov Network Based Ontology Matching.
Human Activity Encoding and Recognition Using Low-level Visual Features.
Tractable Multi-Agent Path Planning on Grid Maps.
Domain-Guided Novelty Detection for Autonomous Exploration.
A Computational Model for the Alignment of Hierarchical Scene Representations in Human-Robot Interaction.
Learning Kinematic Models for Articulated Objects.
Nonmyopic Adaptive Informative Path Planning for Multiple Robots.
Self-Supervised Aerial Image Analysis for Extracting Parking Lot Structure.
Information-Lookahead Planning for AUV Mapping.
Incremental Phi*: Incremental Any-Angle Path Planning on Grids.
Evaluating Description and Reference Strategies in a Cooperative Human-Robot Dialogue System.
Adversarial Uncertainty in Multi-Robot Patrol.
Learning HTN Method Preconditions and Action Models from Partial Observations.
A Context Driven Approach for Workflow Mining.
HTN Planning with Preferences.
Bayesian Real-Time Dynamic Programming.
Plan Recognition as Planning.
Planning with Partial Preference Models.
Monte-Carlo Exploration for Deterministic Planning.
A Distributed Control Loop for Autonomous Recovery in a Multi-Agent Plan.
Learning Probabilistic Hierarchical Task Networks to Capture User Preferences.
ReTrASE: Integrating Paradigms for Approximate Probabilistic Planning.
Efficient Abstraction and Refinement for Behavioral Description Based Web Service Composition.
Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics.
Cost-Optimal Planning with Landmarks.
Structured Plans and Observation Reduction for Plans with Contexts.
Abnormal Activity Recognition Based on HDP-HMM Models.
Learning Hierarchical Task Networks for Nondeterministic Planning Domains.
Delaying Commitment in Plan Recognition Using Combinatory Categorial Grammars.
Activity Recognition with Intended Actions.
Optimal Symbolic Planning with Action Costs and Preferences.
Topological Order Planner for POMDPs.
Domain-Independent, Automatic Partitioning for Probabilistic Planning.
Temporal Planning in Domains with Linear Processes.
Stratified Planning.
Completeness and Optimality Preserving Reduction for Planning.
Equivalence Relations in Fully and Partially Observable Markov Decision Processes.
Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events.
Solving POMDPs: RTDP-Bel vs. Point-based Algorithms.
Goal Recognition with Variable-Order Markov Models.
Translating HTNs to PDDL: A Small Amount of Domain Knowledge Can Go a Long Way.
A Translation-Based Approach to Contingent Planning.
Word Sense Disambiguation for All Words without Hard Labor.
On-line Evolutionary Exponential Family Mixture.
Situated Resolution and Generation of Spatial Referring Expressions for Robotic Assistants.
Wikispeedia: An Online Game for Inferring Semantic Distances between Concepts.
Multiscale Analysis of Document Corpora Based on Diffusion Models.
Graph-Based Multi-Modality Learning for Topic-Focused Multi-Document Summarization.
Context-Sensitive Semantic Smoothing using Semantically Relatable Sequences.
Probabilistic Counting with Randomized Storage.
Computational Semantics of Noun Compounds in a Semantic Space Model.
Online Graph Planarisation for Synchronous Parsing of Semantic and Syntactic Dependencies.
Context-Based Approach for Pivot Translation Services.
Introspection and Adaptable Model Integration for Dialogue-based Question Answering.
On the Tip of My Thought: Playing the Guillotine Game.
Improving a Virtual Human Using a Model of Degrees of Grounding.
Improving Morphology Induction by Learning Spelling Rules.
Reading Between the Lines.
Detection of Imperative and Declarative Question-Answer Pairs in Email Conversations.
Explicit Versus Latent Concept Models for Cross-Language Information Retrieval.
Web-Scale N-gram Models for Lexical Disambiguation.
Knowledge-Based WSD and Specific Domains: Performing Better than Generic Supervised WSD.
Efficient Dominant Point Algorithms for the Multiple Longest Common Subsequence (MLCS) Problem.
Learning to Follow Navigational Route Instructions.
Simultaneous Discovery of Conservation Laws and Hidden Particles with Smith Matrix Decomposition.
Representation and Synthesis of Melodic Expression.
Towards Context Aware Emotional Intelligence in Machines: Computing Contextual Appropriateness of Affective States.
A Visual Approach to Sketched Symbol Recognition.
Efficient Online Learning and Prediction of Users' Desktop Actions.
Expressive Power-Based Resource Allocation for Data Centers.
DrosophilaGene Expression Pattern Annotation through Multi-Instance Multi-Label Learning.
Is It Enough to Get the Behavior Right?
Interpreting Written How-To Instructions.
Topic Tracking Model for Analyzing Consumer Purchase Behavior.
Sensing and Predicting the Pulse of the City through Shared Bicycling.
Suggesting Email View Filters for Triage and Search.
Improving State Evaluation, Inference, and Search in Trick-Based Card Games.
Combining Speech and Sketch to Interpret Unconstrained Descriptions of Mechanical Devices.
Using Entropy to Distinguish Shape Versus Text in Hand-Drawn Diagrams.
Semi-Supervised Regression for Evaluating Convenience Store Location.
Generalized Clustergrams for Overlapping Biclusters.
Analysis of a Winning Computational Billiards Player.
Multiple Information Sources Cooperative Learning.
Multiclass Probabilistic Kernel Discriminant Analysis.
Non-Metric Label Propagation.
Smart PCA.
An Efficient Nonnegative Matrix Factorization Approach in Flexible Kernel Space.
M3IC: Maximum Margin Multiple Instance Clustering.
Fast Active Tabu Search and its Application to Image Retrieval.
Robust Distance Metric Learning with Auxiliary Knowledge.
Spatio-Temporal Event Detection Using Dynamic Conditional Random Fields.
Transfer Learning Using Task-Level Features with Application to Information Retrieval.
Multi-Relational Learning with Gaussian Processes.
Discriminative Semi-Supervised Feature Selection via Manifold Regularization.
Early Prediction on Time Series: A Nearest Neighbor Approach.
Knowledge Transfer on Hybrid Graph.
Preference Learning with Extreme Examples.
Generalized Cluster Aggregation.
Manifold Alignment without Correspondence.
Multi-Class Classifiers and their Underlying Shared Structure.
Toward Unsupervised Activity Discovery Using Multi-Dimensional Motif Detection in Time Series.
On Multiple Kernel Learning with Multiple Labels.
Maintaining Predictions over Time without a Model.
Succinct Approximate Counting of Skewed Data.
Latent Variable Perceptron Algorithm for Structured Classification.
On the Equivalence between Canonical Correlation Analysis and Orthonormalized Partial Least Squares.
Predictive Projections.
Semi-Supervised Metric Learning Using Pairwise Constraints.
Streamed Learning: One-Pass SVMs.
Goal-Driven Learning in the GILA Integrated Intelligence Architecture.
Expanding Domain Sentiment Lexicon through Double Propagation.
Semi-Supervised Classification Using Sparse Gaussian Process Regression.
Domain Adaptation via Transfer Component Analysis.
Spectral Embedded Clustering.
Autonomously Learning an Action Hierarchy Using a Learned Qualitative State Representation.
Semi-Supervised Learning of Visual Classifiers from Web Images and Text.
Transfer Learning from Minimal Target Data by Mapping across Relational Domains.
Large Margin Boltzmann Machines.
Spectral Kernel Learning for Semi-Supervised Classification.
Learning the Optimal Neighborhood Kernel for Classification.
Probabilistic Models for Concurrent Chatting Activity Recognition.
Boosting Constrained Mutual Subspace Method for Robust Image-Set Based Object Recognition.
Relation Regularized Matrix Factorization.
Exploiting Multi-Modal Interactions: A Unified Framework.
Exponential Family Sparse Coding with Application to Self-taught Learning.
Efficient Skill Learning using Abstraction Selection.
Unsupervised Rank Aggregation with Domain-Specific Expertise.
Local Query Mining in a Probabilistic Prolog.
gRegress: Extracting Features from Graph Transactions for Regression.
Semi-Supervised Classification on Evolutionary Data.
Linear Dimensionality Reduction for Multi-label Classification.
Bootstrap Voting Experts.
Graph Embedding with Constraints.
Ranking Structured Documents: A Large Margin Based Approach for Patent Prior Art Search.
Learning Optimal Subsets with Implicit User Preferences.
Local Learning Regularized Nonnegative Matrix Factorization.
Search Techniques for Fourier-Based Learning.
Knowledge Driven Dimension Reduction for Clustering.
Inverse Reinforcement Learning in Partially Observable Environments.
Bayesian Extreme Components Analysis.
Selecting Informative Universum Sample for Semi-Supervised Learning.
Locality Preserving Nonnegative Matrix Factorization.
Angluin-Style Learning of NFA.
Self-Managing Associative Memory for Dynamic Acquisition of Expertise in High-Level Domains.
Adaptive Cluster Ensemble Selection.
Relational Random Forests Based on Random Relational Rules.
Active Policy Iteration: Efficient Exploration through Active Learning for Value Function Approximation in Reinforcement Learning.
Exponential Family Hybrid Semi-Supervised Learning.
On Combinations of Binary Qualitative Constraint Calculi.
Efficient Inference for Expressive Comparative Preference Languages.
Knowing More - From Global to Local Correspondence.
Applications and Extensions of PTIME Description Logics with Functional Constraints.
Declarative Programming of Search Problems with Built-in Arithmetic.
Realising Deterministic Behavior from Multiple Non-Deterministic Behaviors.
Negotiation Using Logic Programming with Consistency Restoring Rules.
Effective Query Rewriting with Ontologies over DBoxes.
Nominals for Everyone.
Automated Theorem Proving for General Game Playing.
Composition of ConGolog Programs.
Dialectical Abstract Argumentation: A Characterization of the Marking Criterion.
Model-based Revision Operators for Terminologies in Description Logics.
Reasoning with Knowledge, Action and Time in Dynamic and Uncertain Domains.
A Fixed-Parameter Tractable Algorithm for Spatio-Temporal Calendar Management.
Labellings and Games for Extended Argumentation Frameworks.
A Logic for Reasoning about Counterfactual Emotions.
On First-Order Definability and Computability of Progression for Local-Effect Actions and Beyond.
Combining RCC-8 with Qualitative Direction Calculi: Algorithms and Complexity.
The Complexity of Learning Separable ceteris paribus Preferences.
A Semantical Account of Progression in the Presence of Defaults.
Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers.
Roman Kontchakov Luca Pulina Ulrike Sattler Thomas Schneider Petra Selmer Frank Wolter Michael Zakharyaschev
Forgetting and Uniform Interpolation in Large-Scale Description Logic Terminologies.
Circumscriptive Event Calculus as Answer Set Programming.
Answer-Set Programming with Bounded Treewidth.
Evaluating Abductive Hypotheses using an EM Algorithm on BDDs.
On the Accrual of Arguments in Defeasible Logic Programming.
Symmetric Splitting in the General Theory of Stable Models.
Plausible Repairs for Inconsistent Requirements.
Solving Strong-Fault Diagnostic Models by Model Relaxation.
FRACTAL: Efficient Fault Isolation Using Active Testing.
Knowledge Compilation Properties of Trees-of-BDDs, Revisited.
Bidirectional Answer Set Programs with Function Symbols.
Query Answering in Description Logics with Transitive Roles.
Decomposition of Declarative Knowledge Bases with External Functions.
A Unified Framework for Representation and Development of Dialectical Proof Procedures in Argumentation.
A Tableaux-Based Method for Computing Least Common Subsumers for Expressive Description Logics.
Diagnosing Multiple Persistent and Intermittent Faults.
Import-by-Query: Ontology Reasoning under Access Limitations.
A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic.
Regular Path Queries in Expressive Description Logics with Nominals.
Euclidean and Mereological Qualitative Spaces: A Study of SCC and DCC.
Next Steps in Propositional Horn Contraction.
Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes.
An Argumentation-Based Interpreter for Golog Programs.
Computational Properties of Resolution-based Grounded Semantics.
Extending Decidable Cases for Rules with Existential Variables.
Which Semantics for Neighbourhood Semantics?
Repairing Preference-Based Argumentation Frameworks.
A Logic for Coalitions with Bounded Resources.
A New Bayesian Approach to Multiple Intermittent Fault Diagnosis.
Mixing Search Strategies for Multi-Player Games.
Combining Breadth-First and Depth-First Strategies in Searching for Treewidth.
A* Search with Inconsistent Heuristics.
Qualitative CSP, Finite CSP, and SAT: Comparing Methods for Qualitative Constraint-based Reasoning.
Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features.
Efficient Incremental Search for Moving Target Search.
Memory-Based Heuristics for Explicit State Spaces.
Russian Doll Search with Tree Decomposition.
A Structural Approach to Reasoning with Quantified Boolean Formulas.
A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT.
Evaluating Strategies for Running from the Cops.
Open Contractible Global Constraints.
A Divide-and-Conquer Approach for Solving Interval Algebra Networks.
A Soft Global Precedence Constraint.
Towards Efficient Consistency Enforcement for Global Constraints in Weighted Constraint Satisfaction.
Variety Reasoning for Multiset Constraint Propagation.
Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT.
Multi-Way Number Partitioning.
Set Branching in Constraint Optimization.
Exploiting Decomposition on Constraint Problems with High Tree-Width.
SATenstein: Automatically Building Local Search SAT Solvers from Components.
New Improvements in Optimal Rectangle Packing.
Solving 8x8 Hex.
Control-Based Clause Sharing in Parallel SAT Solving.
Minimum Proof Graphs and Fastest-Cut-First Search Heuristics.
Local Search: Is Brute-Force Avoidable?
Michael R. Fellows Frances A. Rosamond Fedor V. Fomin Daniel Lokshtanov Saket Saurabh Yngve Villanger
Duplicate Avoidance in Depth-First Search with Applications to Treewidth.
Monte Carlo Tree Search Techniques in the Game of Kriegspiel.
Search Strategies for an Anytime Usage of the Branch and Prune Algorithm.
Reasoning with Lines in the Euclidean Space.
Nested Monte-Carlo Search.
Best-First Heuristic Search for Multi-Core Machines.
Experiments with Massively Parallel Constraint Solving.
Canadian Traveler Problem with Remote Sensing.
TBA*: Time-Bounded A*.
Making Bound Consistency as Effective as Arc Consistency.
Decompositions of All Different, Global Cardinality and Related Constraints.
Circuit Complexity and Decompositions of Global Constraints.
Online Stochastic Optimization in the Large: Application to Kidney Exchange.
Predicting Learnt Clauses Quality in Modern SAT Solvers.
On Solving Boolean Multilevel Optimization Problemse.
Towards Industrial-Like Random SAT Instances.
Interruptible Algorithms for Multi-Problem Solving.
K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems.
Axiomatic Characterization of Task Oriented Negotiation.
A Multi-Agent Learning Approach to Online Distributed Resource Allocation.
Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms.
Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules.
A Dichotomy Theorem on the Existence of Efficient or Neutral Sequential Voting Correspondences.
Finite Local Consistency Characterizes Generalized Scoring Rules.
Eliciting Honest Reputation Feedback in a Markov Setting.
Where Are the Really Hard Manipulation Problems? The Phase Transition in Manipulating the Veto Rule.
Acquiring Agent-Based Models of Conflict from Event Data.
Discovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs.
Dynamic Configuration of Agent Organizations.
Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm.
Flexible Procurement of Services with Uncertain Durations using Redundancy.
Investigations of Continual Computation.
Probabilistic State Translation in Extensive Games with Large Action Sets.
Towards Con-Resistant Trust Models for Distributed Agent Systems.
Modeling Agents through Bounded Rationality Theories.
Coalition Structure Generation in Multi-Agent Systems with Positive and Negative Externalities.
A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics.
Generalised Fictitious Play for a Continuum of Anonymous Players.
Thou Shalt Covet Thy Neighbor's Cake.
How Pervasive Is the Myerson-Satterthwaite Impossibility?
Argumentation System with Changes of an Agent's Knowledge Base.
Strategyproof Classification with Shared Inputs.
Balancing Utility and Deal Probability for Auction-Based Negotiations in Highly Nonlinear Utility Spaces.
A Kernel Method for Market Clearing.
Event-Detecting Multi-Agent MDPs: Complexity and Constant-Factor Approximations.
Exchanging Reputation Information between Communities: A Payment-Function Approach.
Collaboration and Shared Plans in the Open World: Studies of Ridesharing.
DCOPs Meet the Real World: Exploring Unknown Reward Matrices with Applications to Mobile Sensor Networks.
Strengthening Schedules through Uncertainty Analysis Agents.
Collaborative Multi Agent Physical Search with Probabilistic Knowledge.
Multi-Step Multi-Sensor Hider-Seeker Games.
Iterated Regret Minimization: A New Solution Concept.
On the Complexity of Compact Coalitional Games.
Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information.
Charting the Tractability Frontier of Mixed Multi-Unit Combinatorial Auctions.
Multimode Control Attacks on Elections.
Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness.
Learning Graphical Game Models.
Preference Functions that Score Rankings and Maximum Likelihood Estimation.
How Hard Is It to Control Sequential Elections via the Agenda?
Compiling the Votes of a Subelectorate.
Commitment Tracking via the Reactive Event Calculus.
Simple Coalitional Games with Beliefs.
Coalitional Affinity Games and the Stability Gap.
Planning Games.
Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods.
Algorithms and Complexity Results for Pursuit-Evasion Problems.
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes.
Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions.
UCT for Tactical Assault Planning in Real-Time Strategy Games.
Using Reasoning Patterns to Help Humans Solve Complex Games.
Nonmanipulable Selections from a Tournament.
Activity Recognition: Linking Low-level Sensors to High-level Intelligence.
How Experience of the Body Shapes Language about Space.
Machine Learning in Ecosystem Informatics and Sustainability.
Intelligent Tutoring Systems: New Challenges and Directions.
Past IJCAI Conferences.
AAAI Organization.
IJCAI Organization.
Events Colocated with IJCAI-09.
IJCAI-09 Keynote and Invited Speakers.
IJCAI-09 Awards and Distinguished Papers.
IJCAI-09 Sponsorship.
IJCAI-09 Conference Organization.
Preface.