Empirical investigation of stochastic local search for maximum satisfiability-Reference-Cited by-同舟云学术

Empirical investigation of stochastic local search for maximum satisfiability

Published:2018-08-30 Issue:1 Volume:13 Page:86-98
ISSN:2095-2228
Container-title:Frontiers of Computer Science
language:en
Short-container-title:Front. Comput. Sci.

Author:

Chu Yi,Luo Chuan,Cai Shaowei,You Haihang

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s11704-018-7107-z/fulltext.html

Reference47 articles.

1. Prestwich S D. CNF encodings. Handbook of Satisfiability. 2009, 75–97

2. Li C M, Manyà F. MaxSAT, hard and soft constraints. Handbook of Satisfiability, 2009, 185: 613–631

3. Smyth K, Hoos H H, Stützle T. Iterated robust tabu search for MAX-SAT. In: Proceedings of Conference of the Canadian Society for Computational Studies of Intelligence. 2003, 129–144

4. Yang Q, Wu K, Jiang Y. Learning action models from plan examples using weighted MAX-SAT. Artificial Intelligence, 2007, 171(2–3): 107–143

5. Chen Y, Safarpour S, Marques-Silva J, Veneris A G. Automated design debugging with maximum satisfiability. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2010, 29(11): 1804–1817

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5;Theory and Applications of Satisfiability Testing – SAT 2021;2021

2. New phase transitions for formulas in Łukasiewicz logic;Frontiers of Computer Science;2020-05-06

3. Applying aspiration in local search for satisfiability;PLOS ONE;2020-04-23

4. Solving quantified constraint satisfaction problems with value selection rules;Frontiers of Computer Science;2020-03-16