Learning and Reasoning with Action-Related Places for Robust Mobile Manipulation
We propose the concept of Action-Related Place (ARPlace) as a powerful and flexible representation of task-related place in the context of mobile manipulation. ARPlace represents robot base locations...
View ArticleRobust Local Search for Solving RCPSP/max with Durational Uncertainty
Scheduling problems in manufacturing, logistics and project management have frequently been modeled using the framework of Resource Constrained Project Scheduling Problems with minimum and maximum time...
View ArticleLocation-Based Reasoning about Complex Multi-Agent Behavior
Recent research has shown that surprisingly rich models of human activity can be learned from GPS (positional) data. However, most effort to date has concentrated on modeling single individuals or...
View ArticleThe CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a...
Bilingual machine-readable dictionaries are knowledge resources useful in many automatic tasks. However, compared to monolingual computational lexicons like WordNet, bilingual dictionaries typically...
View ArticleCounting-Based Search: Branching Heuristics for Constraint Satisfaction Problems
Designing a search heuristic for constraint programming that is reliable across problem domains has been an important research topic in recent years. This paper concentrates on one family of...
View ArticleExploiting Model Equivalences for Solving Interactive Dynamic Influence Diagrams
We focus on the problem of sequential decision making in partially observable environments shared with other agents of uncertain types having similar or conflicting objectives. This problem has been...
View ArticleConsistency Techniques for Flow-Based Projection-Safe Global Cost Functions...
Many combinatorial problems deal with preferences and violations, the goal of which is to find solutions with the minimum cost. Weighted constraint satisfaction is a framework for modeling such...
View ArticleSAS+ Planning as Satisfiability
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from STRIPS. We introduce...
View ArticleLocal Consistency and SAT-Solvers
Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency...
View ArticleComputing All-Pairs Shortest Paths by Leveraging Low Treewidth
We present two new and efficient algorithms for computing all-pairs shortest paths. The algorithms operate on directed graphs with real (possibly negative) weights. They make use of directed path...
View ArticleGeneralized Biwords for Bitext Compression and Translation Spotting
Large bilingual parallel texts (also known as bitexts) are usually stored in a compressed form, and previous work has shown that they can be more efficiently compressed if the fact that the two texts...
View ArticleCompleteness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at least one query,...
View ArticleProximity-Based Non-uniform Abstractions for Approximate Planning
In a deterministic world, a planning agent can be certain of the consequences of its planned sequence of actions. Not so, however, in dynamic, stochastic domains where Markov decision processes are...
View ArticleAvoiding and Escaping Depressions in Real-Time Heuristic Search
Heuristics used for solving hard real-time search problems have regions with depressions. Such regions are bounded areas of the search space in which the heuristic function is inaccurate compared to...
View ArticleReformulating the Situation Calculus and the Event Calculus in the General...
Circumscription and logic programs under the stable model semantics are two well-known nonmonotonic formalisms. The former has served as a basis of classical logic based action formalisms, such as the...
View ArticleA Market-Inspired Approach for Intersection Management in Urban Road Traffic...
Traffic congestion in urban road networks is a costly problem that affects all major cities in developed countries. To tackle this problem, it is possible (i) to act on the supply side, increasing the...
View ArticleLearning to Win by Reading Manuals in a Monte-Carlo Framework
Domain knowledge is crucial for effective performance in autonomous control systems. Typically, human effort is required to encode this knowledge into a control algorithm. In this paper, we present an...
View ArticleA Knowledge Level Account of Forgetting
Forgetting is an operation on knowledge bases that has been addressed in different areas of Knowledge Representation and with respect to different formalisms, including classical propositional and...
View ArticleA Game Theoretic Analysis of the Adversarial Retrieval Setting
The main goal of search engines is ad hoc retrieval: ranking documents in a corpus by their relevance to the information need expressed by a query. The Probability Ranking Principle (PRP) --- ranking...
View ArticleAxiomatising Incomplete Preferences through Sets of Desirable Gambles
We establish the equivalence of two very general theories: the first is the decision-theoretic formalisation of incomplete preferences based on the mixture independence axiom; the second is the theory...
View Article
