Symbolic Techniques in Satisfiability Solving

SAT 2005 ◽  
2007 ◽  
pp. 25-50
Author(s):  
Guoqiang Pan ◽  
Moshe Y. Vardi
Keyword(s):  
Satisfiability Solving

Grid based clustering for satisfiability solving

2020 ◽  
Vol 88 ◽  
pp. 106069 ◽  
Author(s):  
Celia Hireche ◽  
Habiba Drias ◽  
Hadjer Moulai
Keyword(s):  
Satisfiability Solving ◽  
Grid Based

Complete Boolean Satisfiability Solving Algorithms Based on Local Search

2013 ◽  
Vol 28 (2) ◽  
pp. 247-254 ◽  
Author(s):  
Wen-Sheng Guo ◽  
Guo-Wu Yang ◽  
William N. N. Hung ◽  
Xiaoyu Song
Keyword(s):  
Local Search ◽  
Boolean Satisfiability ◽  
Satisfiability Solving

scholarly journals Classification of Dataflow Actors with Satisfiability and Abstract Interpretation

2012 ◽  
Vol 3 (1) ◽  
pp. 49-69 ◽  
Author(s):  
Matthieu Wipliez ◽  
Mickaël Raulet
Keyword(s):  
Signal Processing ◽  
Abstract Interpretation ◽  
Expressive Power ◽  
Time Analysis ◽  
Synchronous Dataflow ◽  
Dataflow Programming ◽  
Execution Speed ◽  
Satisfiability Solving ◽  
Dataflow Models

Dataflow programming has been used to describe signal processing applications for many years, traditionally with cyclo-static dataflow (CSDF) or synchronous dataflow (SDF) models that restrict expressive power in favor of compile-time analysis and predictability. More recently, dynamic dataflow is being used for the description of multimedia video standards as promoted by the RVC standard (ISO/IEC 23001:4). Dynamic dataflow is not restricted with respect to expressive power, but it does require runtime scheduling in the general case, which may be costly to perform on software. The authors presented in a previous paper a method to automatically classify actors of a dynamic dataflow program within more restrictive dataflow models when possible, along with a method to transform the actors classified as static to improve execution speed by reducing the number of FIFO accesses (Wipliez & Raulet, 2010). This paper presents an extension of the classification method using satisfiability solving, and details the precise semantics used for the abstract interpretation of actors. The extended classification is able to classify more actors than what could previously be achieved.

scholarly journals Symmetry in Gardens of Eden

10.37236/2611 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Christiaan Hartman ◽  
Marijn J. H. Heule ◽  
Kees Kwekkeboom ◽  
Alain Noels
Keyword(s):  
Lower Bound ◽  
Cellular Automaton ◽  
Search Space ◽  
Garden Of Eden ◽  
Game Of Life ◽  
Bounding Box ◽  
Wide Range ◽  
Important Challenge ◽  
Satisfiability Solving ◽  
Conway’S Game Of Life

Conway's Game of Life has inspired enthusiasts to search for a wide range of patterns for this classic cellular automaton. One important challenge in this context is finding the smallest Garden of Eden (GoE), a state without a predecessor. We take up this challenge by applying two techniques. First, we focus on GoEs that contain a symmetry. This significantly reduces the size of the search space for interesting sizes of the grid. Second, we implement the search using incremental satisfiability solving to check thousands of states per second. By combining these techniques, we broke several records regarding GoEs: the fewest defined cells, the smallest bounding box, and the lowest living density. Furthermore, we established a new lower bound for the smallest GoE.

Greedy Clique Decomposition for Symbolic Satisfiability Solving

2012 ◽  
Vol 4 (10) ◽  
pp. 174-184
Author(s):  
Yanyan Xu ◽  
Wei Chen ◽  
Kaile Su ◽  
Wenhui Zhang
Keyword(s):  
Satisfiability Solving
Sign in / Sign up

Export Citation Format

Share Document