Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report)
Authors:
- Eyal AmirEAEyal Amir
- Sheila McllraithSMSheila Mcllraith
- 30 June 2001
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 9, 329-343
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Dynamic BacktrackingJournal of Artificial Intelligence Research, 1993
- Tree clustering for constraint networksArtificial Intelligence, 1989
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysisArtificial Intelligence, 1977
- A Selection Problem of Shared Fixed Costs and Network FlowsManagement Science, 1970
- Attrition gamesNaval Research Logistics Quarterly, 1956