TY  -  
T1  - Core-Boosted Linear Search for Incomplete MaxSAT 
SN  -  /  
UR  - http://hdl.handle.net/10138/310651 
T3  - Lecture Notes in Computer Science. Theoretical Computer Science and General Issues 
A1  - Berg, Otto Jeremias; Demirović, Emir; Stuckey, Peter J. 
A2  - Rousseau, Louis-Martin; Stergiou, Kostas 
PB  - Springer International Publishing AG 
Y1  - 2019 
LA  - eng 
AB  - Maximum Satisfiability (MaxSAT), the optimisation extension of the well-known Boolean Satisfiability (SAT) problem, is a competitive approach for solving NP-hard problems encountered in various artificial intelligence and industrial domains. Due to its computational complexity, there is an inherent tradeoff between scalability and guarantee on solution quality in MaxSAT solving. Limitations on available computational resources in many practical applications motivate the development of complete a... 
VO  -  
IS  -  
SP  -  
OP  -  
KW  - 113 Computer and information sciences 
N1  -   
PP  -  
ER  -