{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T10:15:38Z","timestamp":1655979338547},"reference-count":0,"publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAAI"],"abstract":"\n \n 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.\n \n <\/jats:p>","DOI":"10.1609\/aaai.v28i1.9043","type":"journal-article","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T09:35:15Z","timestamp":1655976915000},"source":"Crossref","is-referenced-by-count":0,"title":["A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints"],"prefix":"10.1609","volume":"28","author":[{"given":"T. K. Satish","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Duc Thien","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"William","family":"Yeoh","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[]}],"member":"9382","published-online":{"date-parts":[[2014,6,21]]},"container-title":["Proceedings of the AAAI Conference on Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/download\/9043\/8902","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/download\/9043\/8902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T09:35:16Z","timestamp":1655976916000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/9043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2014,8,1]]}},"URL":"https:\/\/doi.org\/10.1609\/aaai.v28i1.9043","relation":{},"ISSN":["2374-3468","2159-5399"],"issn-type":[{"value":"2374-3468","type":"electronic"},{"value":"2159-5399","type":"print"}],"subject":[],"published":{"date-parts":[[2014,6,21]]}}}