Regular-SAT: A many-valued approach to solving combinatorial problems
From MaRDI portal
Publication:2643307
DOI10.1016/j.dam.2005.10.020zbMath1121.68104OpenAlexW2025259988MaRDI QIDQ2643307
Carla P. Gomes, Felip Manyà, Ramón Béjar, Cèsar Fernández, Alba Cabiscol
Publication date: 23 August 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.10.020
Related Items (3)
An algorithm for random signed 3-SAT with intervals ⋮ A first polynomial non-clausal class in many-valued logic ⋮ Constraint-directed search for all-interval series
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The intractability of resolution
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Local search algorithms for SAT: an empirical evaluation
- Short Conjunctive Normal Forms in Finitely Valued Logics
- Exploiting data dependencies in many-valued logics
- Determining computational complexity from characteristic ‘phase transitions’
- A machine program for theorem-proving
This page was built for publication: Regular-SAT: A many-valued approach to solving combinatorial problems