Conference Paper

Tackling the Partner Units Configuration Problem

DOI: 10.5591/978-1-57735-516-8/IJCAI11-091 Conference: IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence, At Barcelona, Catalonia, Spain
Source: DBLP

ABSTRACT

The Partner Units Problem is a specific type of configuration problem with important applications in the area of surveillance and security. In this work we show that a special case of the problem, that is of great interest to our partners in industry, can directly be tackled via a structural problem decompostion method. Combining these theoretical insights with general purpose AI techniques such as constraint satisfaction and SAT solving proves to be particularly effective in practice.

Download full-text

Full-text

Available from: Markus Aschinger, May 16, 2014
  • Source
    • "Factorised representations are a natural fit whenever we deal with a large space of possibilities and can be used to represent, e.g., AND/OR trees used in design specification [5] and world-set decompositions used for incomplete information [1]. They can also be used to compactly represent the space of feasible solutions to configuration problems in constraint satisfaction , where we need to connect a set of components so as to meet an objective while respecting given constraints [2]. The focus of this demonstration is our query engine FDB. "
    [Show abstract] [Hide abstract]
    ABSTRACT: FDB is an in-memory query engine for factorised databases, which are relational databases that use compact factorised representations at the physical layer to reduce data redundancy and boost query performance. We demonstrate FDB using real data sets from IMDB, DBLP, and the NELL repository of facts learned from Web pages. The users can inspect factorisations as well as plans used by FDB to compute factorised results of select-project-join queries on factorised databases.
    Preview · Article · Aug 2012 · Proceedings of the VLDB Endowment
  • Source
    • "Formalisms for incomplete information, such as world-set decompositions [4] [17], rely on factorisations of universal relations encoding very large sets of possible worlds; they are products of unions of products of tuples. Outside data management scenarios, factorised relations can be used to compactly represent the space of feasible solutions to configuration problems in constraint satisfaction, where we need to connect a fixed finite set of given components so as to meet a given objective while respecting given constraints [5]. Factorised representations have several key properties that make them appealing in the above mentioned scenarios. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Factorised databases are relational databases that use compact factorised representations at the physical layer to reduce data redundancy and boost query performance. This paper introduces FDB, an in-memory query engine for select-project-join queries on factorised databases. Key components of FDB are novel algorithms for query optimisation and evaluation that exploit the succinctness brought by data factorisation. Experiments show that for data sets with many-to-many relationships FDB can outperform relational engines by orders of magnitude.
    Preview · Article · Mar 2012 · Proceedings of the VLDB Endowment
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in industry. Unfortunately, it can be shown that in the most general case an optimization version of the problem is intractable. We present and evaluate encodings of the problem in the frameworks of answer set programming, propositional satisfiability testing, constraint solving, and integer programming. We also show how to adapt these encodings to a class of problem instances that we have recently shown to be tractable.
    Full-text · Conference Paper · May 2011
Show more