Solving Satisfiability using Decomposition and the Most Constrained Subproblem
From Tetherless World Wiki
Citation: Eyal Amir and Sheila A. McIlraith. (2001) Solving Satisfiability using Decomposition and the Most Constrained Subproblem. In Proceedings of SAT 2001: the Workshop on Theory and Applications of Satisfiability Testing. Electronic Notes in Discrete Mathematics, Volume 9, Henry Kautz and Bart Selman (Ed.), June,2001.
| Publication inproceedings ( Edit ) | |
| type | InProceedings |
| bibtype | inproceedings |
| Bibtex basics | |
| author | Eyal Amir and Sheila A. McIlraith |
| title | Solving Satisfiability using Decomposition and the Most Constrained Subproblem |
| booktitle | Proceedings of SAT 2001: the Workshop on Theory and Applications of Satisfiability Testing. Electronic Notes in Discrete Mathematics, Volume 9, Henry Kautz and Bart Selman (Ed.) |
| year | 2001 |
| month | June |
| Bibtex more | |
| note | Volume 9 |
| Access Paper | |
| KSL Technical Report ID: KSL-01-16 |
Facts about Solving Satisfiability using Decomposition and the Most Constrained SubproblemRDF feed
| Author | Eyal Amir and Sheila A. McIlraith + |
| Bibtype | inproceedings + |
| Booktitle | Proceedings of SAT 2001: the Workshop on Theory and Applications of Satisfiability Testing. Electronic Notes in Discrete Mathematics, Volume 9, Henry Kautz and Bart Selman (Ed.) + |
| Has author | Eyal Amir and Sheila A. McIlraith + |
| Has identifier | KSL-01-16 + |
| Has publishing details | June,2001 + |
| Has title | Solving Satisfiability using Decomposition and the Most Constrained Subproblem + |
| Has where published | Proceedings of SAT 2001: the Workshop on Theory and Applications of Satisfiability Testing. Electronic Notes in Discrete Mathematics, Volume 9, Henry Kautz and Bart Selman (Ed.) + |
| Has year | 2001 + |
| Ksl tr id | KSL-01-16 + |
| Month | June + |
| Note | Volume 9 |
| Process note | NO + |
| Title | Solving Satisfiability using Decomposition and the Most Constrained Subproblem + |
| Year | 2001 + |
