Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming.
Local Consistency and SAT-Solvers.
Learning to Win by Reading Manuals in a Monte-Carlo Framework.
Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction.
Learning and Reasoning with Action-Related Places for Robust Mobile Manipulation.
Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems.
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice.
SAS+ Planning as Satisfiability.
Avoiding and Escaping Depressions in Real-Time Heuristic Search.
Generalized Biwords for Bitext Compression and Translation Spotting.
Robust Local Search for Solving RCPSP/max with Durational Uncertainty.
Exploiting Model Equivalences for Solving Interactive Dynamic Influence Diagrams.
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth.
Proximity-Based Non-uniform Abstractions for Approximate Planning.
Location-Based Reasoning about Complex Multi-Agent Behavior.
A Market-Inspired Approach for Intersection Management in Urban Road Traffic Networks.
The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary.