Scaling Relational Inference Using Proofs And Refutations
AAAI'16: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence(2016)
摘要
Many inference problems are naturally formulated using hard and soft constraints over relational domains: the desired solution must satisfy the hard constraints, while optimizing the objectives expressed by the soft constraints. Existing techniques for solving such constraints rely on efficiently grounding a sufficient subset of constraints that is tractable to solve. We present an eager-lazy grounding algorithm that eagerly exploits proofs and lazily refutes counterexamples. We show that our algorithm achieves significant speedup over existing approaches without sacrificing soundness for real-world applications from information retrieval and program analysis.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络