On Minimal Constraint Networks
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NP-hard to dec...
| Hoofdauteur: | |
|---|---|
| Formaat: | Conference item |
| Gepubliceerd in: |
Perugia‚ Italy
2011
|
| _version_ | 1826299766986768384 |
|---|---|
| author | Gottlob, G |
| author_facet | Gottlob, G |
| author_sort | Gottlob, G |
| collection | OXFORD |
| description | In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NP-hard to decide whether a constraint network can be decomposed into an equivalent k-ary constraint network, and study related questions. |
| first_indexed | 2024-03-07T05:06:56Z |
| format | Conference item |
| id | oxford-uuid:da3fb72f-a10b-41fc-8d8e-a28e5fb45c40 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T05:06:56Z |
| publishDate | 2011 |
| publisher | Perugia‚ Italy |
| record_format | dspace |
| spelling | oxford-uuid:da3fb72f-a10b-41fc-8d8e-a28e5fb45c402022-03-27T09:01:48ZOn Minimal Constraint NetworksConference itemhttp://purl.org/coar/resource_type/c_5794uuid:da3fb72f-a10b-41fc-8d8e-a28e5fb45c40Department of Computer SciencePerugia‚ Italy2011Gottlob, GIn a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NP-hard to decide whether a constraint network can be decomposed into an equivalent k-ary constraint network, and study related questions. |
| spellingShingle | Gottlob, G On Minimal Constraint Networks |
| title | On Minimal Constraint Networks |
| title_full | On Minimal Constraint Networks |
| title_fullStr | On Minimal Constraint Networks |
| title_full_unstemmed | On Minimal Constraint Networks |
| title_short | On Minimal Constraint Networks |
| title_sort | on minimal constraint networks |
| work_keys_str_mv | AT gottlobg onminimalconstraintnetworks |