Bridging Constraint Satisfaction and Boolean Satisfiability
This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretica...
        保存先:
      
    
                  | 第一著者: | Petke, Justyna. (著者, http://id.loc.gov/vocabulary/relators/aut) | 
|---|---|
| 団体著者: | SpringerLink (Online service) | 
| フォーマット: | 電子媒体 eBook | 
| 言語: | English | 
| 出版事項: | 
      Cham :
        Springer International Publishing : Imprint: Springer,
    
      2015.
     | 
| 版: | 1st ed. 2015. | 
| シリーズ: | Artificial Intelligence: Foundations, Theory, and Algorithms,
             | 
| 主題: | |
| オンライン・アクセス: | https://doi.org/10.1007/978-3-319-21810-6 | 
| タグ: | 
       タグ追加    
     
      タグなし, このレコードへの初めてのタグを付けませんか!
    | 
類似資料
- 
                
        
          Constraint Satisfaction Techniques for Agent-Based Reasoning        
                  
著者:: Neagu, Nicoleta., 等
出版事項: (2005) - 
                
        
          Constraint Solving and Planning with Picat        
                  
著者:: Zhou, Neng-Fa., 等
出版事項: (2015) - 
                
        
          Linear Genetic Programming        
                  
著者:: Brameier, Markus F., 等
出版事項: (2007) - 
                
        
          Theory and Applications of Formal Argumentation Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected Papers /        
                          
出版事項: (2014) - 
                
        
          Robust Intelligent Systems        
                          
出版事項: (2008) 



