On the Tractability of Smooth Constraint Satisfaction Problems
We identify a property of constraints called smoothness, and present an extremely simple randomized algorithm for solving smooth constraints. The complexity of the algorithm is much less than the lower bound for establishing path-consistency, and because smoothness is shown to be identical to connec...
Saved in:
Published in | Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems pp. 304 - 319 |
---|---|
Main Author | |
Format | Book Chapter |
Language | English |
Published |
Berlin, Heidelberg
Springer Berlin Heidelberg
|
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We identify a property of constraints called smoothness, and present an extremely simple randomized algorithm for solving smooth constraints. The complexity of the algorithm is much less than the lower bound for establishing path-consistency, and because smoothness is shown to be identical to connected row-convexity (CRC) for the case of binary constraints, the time and space complexity of solving CRC constraints is improved. Central to our algorithm is the relationship of smooth constraints to random walks on directed graphs. We also provide simple deterministic algorithms to test for the smoothness of a given CSP under given domain orderings of the variables. Finally, we show that some other known tractable constraint languages, like the set of implicational constraints, and the set of binary integer linear constraints, are special cases of smooth constraints, and can therefore be solved much more efficiently than the traditional time and space complexities attached with them. |
---|---|
AbstractList | We identify a property of constraints called smoothness, and present an extremely simple randomized algorithm for solving smooth constraints. The complexity of the algorithm is much less than the lower bound for establishing path-consistency, and because smoothness is shown to be identical to connected row-convexity (CRC) for the case of binary constraints, the time and space complexity of solving CRC constraints is improved. Central to our algorithm is the relationship of smooth constraints to random walks on directed graphs. We also provide simple deterministic algorithms to test for the smoothness of a given CSP under given domain orderings of the variables. Finally, we show that some other known tractable constraint languages, like the set of implicational constraints, and the set of binary integer linear constraints, are special cases of smooth constraints, and can therefore be solved much more efficiently than the traditional time and space complexities attached with them. |
Author | Satish Kumar, T. K. |
Author_xml | – sequence: 1 givenname: T. K. surname: Satish Kumar fullname: Satish Kumar, T. K. email: tksk@ksl.stanford.edu organization: Knowledge Systems Laboratory, Stanford University, |
BookMark | eNqVjrFOwzAUAB9QJBLoxA94ZUj77OfE9cJSgdhAanfLQQ41pH7I9sLfQyUGVqYb7oZrYZE4BYBbiSuJaNZSakubnpyiM2ip10hKDdqcQyMHKTsibS9gac3m5NQge4ULaJBQddZouoK2lHdEVMaqBu6fk6iHIPbZv1Y_xjnWL8GT2B2Z60FsOZWafUxV7HyNZfqpIifxknmcw7HcwOXk5xKWv7yGu8eH_fapK585preQ3cj8UZxEd7p3f-7pP-033jJF_Q |
ContentType | Book Chapter |
Copyright | Springer-Verlag Berlin Heidelberg 2005 |
Copyright_xml | – notice: Springer-Verlag Berlin Heidelberg 2005 |
DOI | 10.1007/11493853_23 |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Applied Sciences Computer Science |
EISBN | 3540322647 9783540322641 |
EISSN | 1611-3349 |
Editor | Barták, Roman Milano, Michela |
Editor_xml | – sequence: 1 givenname: Roman surname: Barták fullname: Barták, Roman email: roman.bartak@mff.cuni.cz – sequence: 2 givenname: Michela surname: Milano fullname: Milano, Michela email: michela.milano@unibo.it |
EndPage | 319 |
GroupedDBID | -DT -GH -~X 1SB 29L 2HA 2HV 5QI 875 AASHB ABMNI ACGFS ADCXD AEFIE ALMA_UNASSIGNED_HOLDINGS EJD F5P FEDTE HVGLF LAS LDH P2P RIG RNI RSU SVGTG VI1 ~02 |
ID | FETCH-springer_books_10_1007_11493853_233 |
ISBN | 9783540261520 3540261524 |
ISSN | 0302-9743 |
IngestDate | Tue Oct 01 19:57:56 EDT 2024 |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-springer_books_10_1007_11493853_233 |
ParticipantIDs | springer_books_10_1007_11493853_23 |
PublicationPlace | Berlin, Heidelberg |
PublicationPlace_xml | – name: Berlin, Heidelberg |
PublicationSeriesTitle | Lecture Notes in Computer Science |
PublicationSubtitle | Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31-June 1, 2005. Proceedings |
PublicationTitle | Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems |
Publisher | Springer Berlin Heidelberg |
Publisher_xml | – name: Springer Berlin Heidelberg |
RelatedPersons | Kleinberg, Jon M. Mattern, Friedemann Nierstrasz, Oscar Tygar, Dough Steffen, Bernhard Kittler, Josef Vardi, Moshe Y. Weikum, Gerhard Sudan, Madhu Naor, Moni Mitchell, John C. Terzopoulos, Demetri Pandu Rangan, C. Kanade, Takeo Hutchison, David |
RelatedPersons_xml | – sequence: 1 givenname: David surname: Hutchison fullname: Hutchison, David organization: Lancaster University, UK – sequence: 2 givenname: Takeo surname: Kanade fullname: Kanade, Takeo organization: Carnegie Mellon University, Pittsburgh, USA – sequence: 3 givenname: Josef surname: Kittler fullname: Kittler, Josef organization: University of Surrey, Guildford, UK – sequence: 4 givenname: Jon M. surname: Kleinberg fullname: Kleinberg, Jon M. organization: Cornell University, Ithaca, USA – sequence: 5 givenname: Friedemann surname: Mattern fullname: Mattern, Friedemann organization: ETH Zurich, Switzerland – sequence: 6 givenname: John C. surname: Mitchell fullname: Mitchell, John C. organization: Stanford University, CA, USA – sequence: 7 givenname: Moni surname: Naor fullname: Naor, Moni organization: Weizmann Institute of Science, Rehovot, Israel – sequence: 8 givenname: Oscar surname: Nierstrasz fullname: Nierstrasz, Oscar organization: University of Bern, Switzerland – sequence: 9 givenname: C. surname: Pandu Rangan fullname: Pandu Rangan, C. organization: Indian Institute of Technology, Madras, India – sequence: 10 givenname: Bernhard surname: Steffen fullname: Steffen, Bernhard organization: University of Dortmund, Germany – sequence: 11 givenname: Madhu surname: Sudan fullname: Sudan, Madhu organization: Massachusetts Institute of Technology, MA, USA – sequence: 12 givenname: Demetri surname: Terzopoulos fullname: Terzopoulos, Demetri organization: New York University, NY, USA – sequence: 13 givenname: Dough surname: Tygar fullname: Tygar, Dough organization: University of California, Berkeley, USA – sequence: 14 givenname: Moshe Y. surname: Vardi fullname: Vardi, Moshe Y. organization: Rice University, Houston, USA – sequence: 15 givenname: Gerhard surname: Weikum fullname: Weikum, Gerhard organization: Max-Planck Institute of Computer Science, Saarbruecken, Germany |
SSID | ssj0002792 ssj0000318356 |
Score | 2.6103382 |
Snippet | We identify a property of constraints called smoothness, and present an extremely simple randomized algorithm for solving smooth constraints. The complexity of... |
SourceID | springer |
SourceType | Publisher |
StartPage | 304 |
SubjectTerms | Binary Constraint Constraint Network Constraint Satisfaction Problem Space Complexity True Assignment |
Title | On the Tractability of Smooth Constraint Satisfaction Problems |
URI | http://link.springer.com/10.1007/11493853_23 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5svXnwjYrKIl6kpJRukjYHhSKVWmsDtkpvZdNsPDWBJl789c7sI91a8XUJZQnJdL_w7czsfLOEXLYiV7g88Z2gHQeOCyzscM_nTsSSZiDiJI445jseh37v2e1PvMkyoS_VJUVUn71_qSv5D6owBriiSvYPyJYPhQH4DfjCFRCG6yfndzXNWpYLvi5Kj69zL_cBwieVLce2rLmW9OXyHIgCRQFYizU3xZPABRAXY9SNafMQyGOuVZl4K54zUzrcIy5bH5UF2eN67aFuf26hKpcco-hKtf6WW_ejeZahymlpxMiSU6y-BqdM5NcDvasxzArzD9TBE4aH1pKStW96dumcE0RwXrNhsR4DioYgR7GeUKzsY69FpnqbaqZl6tRivWgzxbtr64EqAYGYL2Dgl0ybrEIqrQDYb7PT7Q9eymycpDbsKqTXcGyrqPaflDFaFSSNVe0kLeO17BMVmdab1rbWpccy3iFbqGKhKC-BqdslGyLdI9s65qB6JnMYMrNrxvbJTZhSwJLaWNIsoQpLusSS2lhSg-UBubrrjm97jrFrih9vPjWdqy3j2SGpplkqjgjlvhfB3LOEga8au15bNHg74YKJWLiJNzsmFz8_7-Q3N52SarF4E2fg5RXRuYboAxbvVtQ |
link.rule.ids | 785,786,790,799,27956 |
linkProvider | Library Specific Holdings |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Integration+of+AI+and+OR+Techniques+in+Constraint+Programming+for+Combinatorial+Optimization+Problems&rft.au=Satish+Kumar%2C+T.+K.&rft.atitle=On+the+Tractability+of+Smooth+Constraint+Satisfaction+Problems&rft.series=Lecture+Notes+in+Computer+Science&rft.pub=Springer+Berlin+Heidelberg&rft.isbn=9783540261520&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=304&rft.epage=319&rft_id=info:doi/10.1007%2F11493853_23 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon |