Results 201 to 210 of about 20,200 (225)

On strategies for solving boolean satisfiability problems

2012 International Conference on Signals and Electronic Systems (ICSES), 2012
The paper deals with one of the most important problems of modern digital systems verification and design - Boolean satisfiability checking. The work analyzes different strategies for SAT solving evaluations. The approach is based on FUDASAT algorithm that employs commonsense reasoning methodology.
openaire   +1 more source

The Unique Horn-Satisfiability problem and quadratic Boolean equations

Annals of Mathematics and Artificial Intelligence, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks

2020
Graph Neural Network (GNN) has shown great power on many practical tasks in the past few years. It is also considered to be a potential technique in bridging the gap between machine learning and symbolic reasoning. Experimental investigations have also shown that some \(\mathcal {NP}\)-Hard constraint satisfaction problems can be well learned by the ...
Minghao Liu 0001, Fan Zhang, Pei Huang 0002, Shuzi Niu, Feifei Ma, Jian Zhang 0001   +5 more
openaire   +1 more source

Comparison of Boolean satisfiability encodings on FPGA detailed routing problems

Proceedings of the conference on Design, automation and test in Europe, 2008
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean satisfiability (SAT) problems against the only 2 previously used encodings. We also consider two symmetry-breaking heuristics. Compared to other methods for FPGA detailed routing, SAT-based approaches have the advantage that they can prove the ...
Miroslav N. Velev, Ping Gao
openaire   +1 more source

Solving Employee Timetabling Problems Using Boolean Satisfiability

2006 Innovations in Information Technology, 2006
The employee timetabling problem (ETP) is concerned with assigning a number of employees into a given set of shifts over a fixed period of time, e.g. a week, while meeting the employee's preferences and organizational work regulations. The problem also attempts to optimize the performance criteria and distribute the shifts equally among the employees ...
Fadi Aloul, Bashar Al-Rawi, Anas Al-Farra, Basel Al-Roh   +3 more
openaire   +1 more source

Linear Programming Formulation of Boolean Satisfiability Problem

2013
It was investigated the Boolean satisfiability (SAT) problem defined as follows: given a Boolean formula, check whether an assignment of Boolean values to the propositional variables in the formula exists, such that the formula evaluates to true. If such an assignment exists, the formula is said to be satisfiable; otherwise, it is unsatisfiable.
openaire   +1 more source

Steiner systems and the Boolean satisfiability problem

Proceedings of the 1996 ACM symposium on Applied Computing - SAC '96, 1996
openaire   +1 more source

Machine Learning Methods in Solving the Boolean Satisfiability Problem

Machine Intelligence Research, 2023
Wenxuan Guo, Xijun Li, Mingxuan Yuan
exaly  

Linear Programming Formulation of Boolean Satisfiability Problem

Lecture Notes in Electrical Engineering, 2014
Algirdas A Maknickas
exaly  

Solving Combinatorial Optimization Problems With Boolean Satisfiability Solvers

Combinatorial Optimization problems are about making decisions that satisfy constraints and optimize objectives. An example is the hospital staff rostering problem, where we decide which staff members take which shifts. Rosters cannot violate policy constraints, but should minimize costs and maximize quality of care.
openaire   +1 more source