Replanning in Domains with Partial Information and Sensing Actions.
The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces.
A New Look at BDDs for Pseudo-Boolean Constraints.
Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach.
Learning to Predict from Textual Data.
Irrelevant and independent natural extension for sets of desirable gambles.
Tractable Set Constraints.
Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results.
Transforming Graph Data for Statistical Relational Learning.
Towards Unsupervised Learning of Temporal Relations between Events.
Safe Exploration of State and Action Spaces in Reinforcement Learning.
The Tractability of CSP Classes Defined by Forbidden Patterns.
An approximative inference method for solving ∃∀SO satisfiability problems.
Evaluating Indirect Strategies for Chinese-Spanish Statistical Machine Translation.
Coalition Structure Generation over Graphs.
Complexity of Judgment Aggregation.
Removing Redundant Messages in N-ary BnB-ADOPT.
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation.
A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing.