Timezone: »

Lifted Symmetry Detection and Breaking for MAP Inference
Timothy Kopp · Parag Singla · Henry Kautz

Mon Dec 07 04:00 PM -- 08:59 PM (PST) @ 210 C #59

Symmetry breaking is a technique for speeding up propositional satisfiability testing by adding constraints to the theory that restrict the search space while preserving satisfiability. In this work, we extend symmetry breaking to the problem of model finding in weighted and unweighted relational theories, a class of problems that includes MAP inference in Markov Logic and similar statistical-relational languages. We introduce term symmetries, which are induced by an evidence set and extend to symmetries over a relational theory. We provide the important special case of term equivalent symmetries, showing that such symmetries can be found in low-degree polynomial time. We show how to break an exponential number of these symmetries with added constraints that are linear in the size of the domain. We demonstrate the effectiveness of these techniques through experiments in two relational domains. We also discuss the connections between relational symmetry breaking and work on lifted inference in statistical-relational reasoning.

Author Information

Timothy Kopp (University of Rochester)
Parag Singla (Indian Institute of Technology Delhi)
Henry Kautz (University of Rochester)

More from the Same Authors