Solving Satisfiability using Decomposition and the Most Constrained Subproblem

From Tetherless World Wiki

Jump to: navigation, search

KSL-01-16 +  redirect page

Solving Satisfiability using Decomposition and the Most Constrained Subproblem +  Has identifier

Solving Satisfiability using Decomposition and the Most Constrained Subproblem +  Ksl tr id

Solving Satisfiability using Decomposition and the Most Constrained Subproblem

Bibtype  inproceedings

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

Title  Solving Satisfiability using Decomposition and the Most Constrained Subproblem

Year  2001

Note  Volume 9

Author  Eyal Amir and Sheila A. McIlraith +

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  Solving Satisfiability using Decomposition and the Most Constrained Subproblem +

Ksl tr id  Solving Satisfiability using Decomposition and the Most Constrained Subproblem +

Month  June +

Process note  NO +

Categories  InProceedings +, KSL Technical Report +, Publication +

 

Enter the name of the page to start browsing from.
Views
Personal tools