Conference Proceeding Article
In this paper, we describe a simple randomized algorithm that runs in polynomial time and solves connected row convex (CRC) constraints in distributed settings. CRC constraints generalize many known tractable classes of constraints like 2-SAT and implicational constraints. They can model problems in many domains including temporal reasoning and geometric reasoning, and generally speaking, play the role of "Gaussians" in the logical world. Our simple randomized algorithm for solving them in distributed settings, therefore, has a number of important applications. We support our claims through a theoretical analysis and empirical results.
Computer Sciences | Theory and Algorithms
Proceedings of the Twenty-eighth AAAI Conference On Artificial Intelligence and the Twenty-sixth Innovative Applications of Artificial Intelligence Conference
AI Access Foundation
City or Country
KUMAR, T. K. Satish; NGUYEN DUC THIEN; YEOH, William; and KOENIG, Sven.
A simple polynomial-time randomized distributed algorithm for connected row convex constraints. (2014). Proceedings of the Twenty-eighth AAAI Conference On Artificial Intelligence and the Twenty-sixth Innovative Applications of Artificial Intelligence Conference. 3, 2308-2314. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3464
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.