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...
        Gorde:
      
    
                  | Egile nagusia: | Petke, Justyna. (Egilea, http://id.loc.gov/vocabulary/relators/aut) | 
|---|---|
| Erakunde egilea: | SpringerLink (Online service) | 
| Formatua: | Baliabide elektronikoa eBook | 
| Hizkuntza: | English | 
| Argitaratua: | 
      Cham :
        Springer International Publishing : Imprint: Springer,
    
      2015.
     | 
| Edizioa: | 1st ed. 2015. | 
| Saila: | Artificial Intelligence: Foundations, Theory, and Algorithms,
             | 
| Gaiak: | |
| Sarrera elektronikoa: | https://doi.org/10.1007/978-3-319-21810-6 | 
| Etiketak: | 
       Etiketa erantsi    
     
      Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
    | 
Antzeko izenburuak
- 
                
        
          Constraint Satisfaction Techniques for Agent-Based Reasoning        
                  
nork: Neagu, Nicoleta., et al.
Argitaratua: (2005) - 
                
        
          Constraint Solving and Planning with Picat        
                  
nork: Zhou, Neng-Fa., et al.
Argitaratua: (2015) - 
                
        
          Linear Genetic Programming        
                  
nork: Brameier, Markus F., et al.
Argitaratua: (2007) - 
                
        
          Theory and Applications of Formal Argumentation Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected Papers /        
                          
Argitaratua: (2014) - 
                
        
          Robust Intelligent Systems        
                          
Argitaratua: (2008) 



