Search Results - (("boolean satisfiability problem") OR ("boolean satisfiability problems"))

Accurate Modeling of Continuous-time SAT Solvers in SPICE

Authors: Pershin, Y. V. Nguyen, D. C.

Source: Radioengineering. 34:526-540

Subject Terms: SPICE, FOS: Computer and information sciences, 3-SAT, computing technology, Emerging Technologies (cs.ET), boolean satisfiability problem, Computer Science - Emerging Technologies, FOS: Physical sciences, nonlinear dynamical systems, Chaotic Dynamics (nlin.CD), Nonlinear Sciences - Chaotic Dynamics

File Description: text; application/pdf

Access URL: http://arxiv.org/abs/2412.14690
https://hdl.handle.net/11012/255413

A Fine-Grained Complexity View on Propositional Abduction: Algorithms and Lower Bounds

Authors: Lagerkvist, V. Maizia, Mohamed Schmidt, Johannes

Source: Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence International Joint Conferences on Artifical Intelligence (IJCAI). :4562-4569

Subject Terms: Computational complexity, Formal logic, Abductive reasoning, Boolean satisfiability problems, Complete problems, Complexity results, Complexity theory, Fast solvers, Fine grained, Low bound, Monotonics, Non-monotonic reasoning, Knowledge based systems

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-70264
https://doi.org/10.24963/ijcai.2025/508

Accurate Modeling of Continuous-time SAT Solvers in SPICE

Authors: Y. V. Pershin D. C. Nguyen

Source: Radioengineering, Vol 34, Iss 3, Pp 526-540 (2025)

Subject Terms: spice, nonlinear dynamical systems, computing technology, boolean satisfiability problem, 3-sat, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

File Description: electronic resource

Relation: https://www.radioeng.cz/fulltexts/2025/25_03_0526_0540.pdf; https://doaj.org/toc/1210-2512

Access URL: https://doaj.org/article/f52d3ce9252049c2bed4fd1945418627

Solving the K-subset summation problem based on twice quantum searching

Authors: YE Tianyu WU Heng GAN Zhigang

Source: Tongxin xuebao, Vol 46, Pp 182-190 (2025)

Subject Terms: K-subset summation problem, Grover quantum searching algorithm, Boolean satisfiability problem, quantum circuit, Telecommunication, TK5101-6720

File Description: electronic resource

Relation: https://doaj.org/toc/1000-436X

Access URL: https://doaj.org/article/b0d7fbc827654b2c910d31febc854aa4

DynamicSAT: Dynamic Configuration Tuning for SAT Solving

Authors: Shi, Zhengyuan Jiang, Wentao Zhang, Xindi et al.

Contributors: Shi, Zhengyuan Jiang, Wentao Zhang, Xindi et al.

Subject Terms: Boolean satisfiability problem, configuration tuning, multi-armed bandit

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 340, 31st International Conference on Principles and Practice of Constraint Programming (CP 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.34

Availability: https://doi.org/10.4230/LIPIcs.CP.2025.34
https://nbn-resolving.org/urn:nbn:de:0030-drops-238952
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.34

SAT-GATv2: A Dynamic Attention-Based Graph Neural Network for Solving Boolean Satisfiability Problem

Authors: Wenjing Chang Wenlong Liu

Source: Electronics ; Volume 14 ; Issue 3 ; Pages: 423

Subject Terms: Boolean satisfiability problem (SAT), random 3-SAT, graph neural network (GNN), message-passing neural networks (MPNNs), dynamic attention mechanisms (GATv2), artificial intelligence

File Description: application/pdf

Relation: https://dx.doi.org/10.3390/electronics14030423

Availability: https://doi.org/10.3390/electronics14030423

SpecBCFuzz: Fuzzing LTL Solvers with Boundary Conditions

Authors: Luiz Carvalho Renzo Degiovanni Maxime Cordy et al.

Source: Proceedings of the IEEE/ACM 46th International Conference on Software Engineering. :1-13

Subject Terms: FOS: Computer and information sciences, Model checking, Automated Software Testing Techniques, 4. Education, Linear temporal logic, Fuzz testing, Computer science, Model Checking, Programming language, Algorithm, Software Fault Localization, Theoretical computer science, Computational Theory and Mathematics, Bug Localization, Solver, Soundness, Computer Science, Physical Sciences, Fuzzing, Boolean satisfiability problem, Satisfiability, Software, Formal Methods in Software Verification and Control, Empirical Studies in Software Engineering, Information Systems

Logic mining with hybridized 3-satisfiability fuzzy logic and harmony search algorithm in Hopfield neural network for Covid-19 death cases

Authors: Farah Liyana Azizan Saratha Sathasivam Nurshazneem Roslan et al.

Source: AIMS Mathematics, Vol 9, Iss 2, Pp 3150-3173 (2024)

Subject Terms: Artificial neural network, 0209 industrial biotechnology, Radiology, Nuclear Medicine and Imaging, Artificial intelligence, Metaheuristic, 02 engineering and technology, Automated Currency Recognition and Authentication, mathematical analysis, Health Sciences, Machine learning, QA1-939, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Hopfield network, Satisfiability, Data mining, hopfield neural network, Modeling the Dynamics of COVID-19 Pandemic, fuzzy logic system, Harmony search, Applications of Deep Learning in Medical Imaging, Computer science, metaheuristic algorithms, 3. Good health, Fuzzy logic, Algorithm, covid-19, Modeling and Simulation, 3sat, Computer Science, Physical Sciences, logic mining, Medicine, Computer Vision and Pattern Recognition, Boolean satisfiability problem, reverse analysis, Mathematics

Access URL: https://doaj.org/article/ac14728dbef64d25b026da221d08b6be

Special major 1, 3 satisfiability logic in discrete Hopfield neural networks

Authors: Gaeithry Manoharam Azleena Mohd Kassim Suad Abdeen et al.

Source: AIMS Mathematics, Vol 9, Iss 5, Pp 12090-12127 (2024)

Subject Terms: Artificial neural network, Artificial intelligence, discrete hopfield neural network, 02 engineering and technology, first-order, 01 natural sciences, 7. Clean energy, Engineering, Theoretical computer science, Artificial Intelligence, QA1-939, 0202 electrical engineering, electronic engineering, information engineering, Type-2 Fuzzy Logic Systems and Applications, Hopfield network, 0101 mathematics, Satisfiability, exhaustive search, major random 1, Neural Network Fundamentals and Applications, Computer science, third-order, benchmark neuron state, Control and Systems Engineering, Computer Science, Physical Sciences, Intelligent Control System for Industrial Processes, 3 satisfiability, Boolean satisfiability problem, Mathematics

Access URL: https://doaj.org/article/05c48455aa084713811f3a30d4fa5ed5

A Formal Proof of P ̸= NP: Self-Referential Complexity and Computational Limits

Authors: MUÑOZ DE LA CUESTA, JAVIER orcid:0000-0003-1605-

Subject Terms: P vs NP Self-Referential Complexity NP-Complete Boolean Satisfiability Problem (SAT) Superpolynomial Time Deterministic Turing Machine Computational Limits Gödel's Incompleteness Theorems Von Neumann's Automata Binary Search Tree Polynomial Reductions Complexity Theory Cryptography Formal Proof Millennium Prize Problems DPLL Algorithm Conflict-Driven Clause Learning (CDCL) 3-SAT Clique Problem Simulations

Relation: https://zenodo.org/records/15351379; oai:zenodo.org:15351379; https://doi.org/10.13140/RG.2.2.35960.76802

Availability: https://doi.org/10.13140/RG.2.2.35960.76802
https://zenodo.org/records/15351379

Adaptive real-time reconfiguration gate scheduling scheme using time perceptive stream

Authors: S. Lekashri K. N. Madhusudhan A. SivaSangari et al.

Source: Automatika, Vol 64, Iss 4, Pp 1067-1071 (2023)

Subject Terms: Bandwidth utilization, time perceptive stream, ultra low latency, gate scheduling, Boolean satisfiability problem, Control engineering systems. Automatic machinery (General), TJ212-225, Automation, T59.5

File Description: electronic resource

Relation: https://doaj.org/toc/0005-1144; https://doaj.org/toc/1848-3380

Access URL: https://doaj.org/article/3bebf414312c4ec9b24038d3eaf6d4c3

Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework

Authors: Wenjing Chang Mengyu Guo Junwei Luo

Source: PeerJ Computer Science, Vol 10, p e2169 (2024)

Subject Terms: Boolean satisfiability problem, Transformer, Random 3-SAT, Deep learning, GRU, Cross-attention, Electronic computers. Computer science, QA75.5-76.95

File Description: electronic resource

Relation: https://peerj.com/articles/cs-2169.pdf; https://peerj.com/articles/cs-2169/; https://doaj.org/toc/2376-5992

Access URL: https://doaj.org/article/19f1fd8cd95d4aa38537b289df07f644

Solving Graph Coloring Problem Based on Grover Algorithm

Authors: LIU Xiaonan, LIU Zhengyu, XIE Haoshan, ZHAO Chenyan

Source: Jisuanji kexue, Vol 50, Iss 6, Pp 351-357 (2023)

Subject Terms: grover algorithm, graph coloring problem, quantum circuit, ibmq, boolean satisfiability problem, Computer software, QA76.75-76.765, Technology (General), T1-995

File Description: electronic resource

Relation: https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2023-50-6-351.pdf; https://doaj.org/toc/1002-137X

Access URL: https://doaj.org/article/0626d97b4ece4c21b6f629c622f3ce31

Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better

Authors: Ahmad Bennakhi Gregory T. Byrd Paul Franzon

Source: Entropy, Vol 26, Iss 10, p 875 (2024)

Subject Terms: quantum computing, B-SAT, Boolean satisfiability problem, Grover’s search, electronic design automation (EDA), conjunctive normal form (CNF), Science, Astrophysics, QB460-466, Physics, QC1-999

File Description: electronic resource

Relation: https://www.mdpi.com/1099-4300/26/10/875; https://doaj.org/toc/1099-4300

Access URL: https://doaj.org/article/aae939a08b72415b9d5a3accea98800a

Inverse design of self-folding 3D shells

Authors: Diogo E. P. Pinto Nuno A. M. Araújo Petr Šulc et al.

Contributors: Diogo E. P. Pinto Nuno A. M. Araújo Petr Šulc et al.

Subject Terms: self-assembly, DNA, Boolean satisfiability problem, coarse-grained, design dimension, design-proce, external condition, folding proce, folding, inverse design, target structure, three-dimensional structure

Relation: info:eu-repo/semantics/altIdentifier/pmid/38563942; info:eu-repo/semantics/altIdentifier/wos/WOS:001198639000008; volume:132; issue:11; firstpage:1; lastpage:6; numberofpages:6; journal:PHYSICAL REVIEW LETTERS; https://hdl.handle.net/11573/1706021

Availability: https://hdl.handle.net/11573/1706021
https://doi.org/10.1103/physrevlett.132.118201

Preprocessing is What You Need: Understanding and Predicting the Complexity of SAT-based Uniform Random Sampling

Authors: ZEYEN, Olivier CORDY, Maxime Perrouin, Gilles et al.

Source: urn:isbn:9798400705892 ; Proceedings - 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering, FormaliSE 2024 (2024-04-14); Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE), Lisbon, Prt [Prt], 14-04-2024 => 15-04-2024

Subject Terms: Boolean formulae, Boolean satisfiability problems, Performance, Random sampling, SAT solvers, SAT-based, Search spaces, Software, Uniform Random Sampling, Engineering, computing & technology, Computer science, Ingénierie, informatique & technologie, Sciences informatiques

Relation: https://orbilu.uni.lu/handle/10993/61583; info:hdl:10993/61583; https://orbilu.uni.lu/bitstream/10993/61583/1/3644033.3644371.pdf

Availability: https://orbilu.uni.lu/handle/10993/61583
https://orbilu.uni.lu/bitstream/10993/61583/1/3644033.3644371.pdf
https://doi.org/10.1145/3644033.3644371

Automated SAT Problem Feature Extraction using Convolutional Autoencoders

Authors: Dalla, Marco Visentin, Andrea O'Sullivan, Barry

Source: 2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI). :232-239

Subject Terms: CNF encoding, N-P complete problem, SAT problem, Feature extraction, Deep learning, Satisfiability prediction, Autoencoders, Boolean Satisfiability Problem (SAT), Boolean satisfiability, Convolutional autoencoders

File Description: application/pdf

Access URL: http://hdl.handle.net/10468/13554
http://hdl.handle.net/10468/12238

Using machine learning classifiers in SAT branching

Authors: Bergin, Ruth Helen Dalla, Marco Visentin, Andrea et al.

Subject Terms: Machine and deep learning in search, Artificial intelligence, Memory, Machine learning, Combinatorial Search, Search strategy selection, Search in Boolean satisfiability, Boolean satisfiability problem (SAT), Random vs systematic search strategy selection, Solution quality trade-offs, Time

File Description: application/pdf

Access URL: https://hdl.handle.net/10468/15191

SAT-Solving in Practice, with a Tutorial Example from Supervisory Control

Authors: Claessen, Koen Een, Niklas Sheeran, Mary et al.

Source: Discrete Event Dynamic Systems. 19(4):495-524

Subject Terms: Computer Sciences, Datavetenskap (datalogi), Formal verification, Boolean satisfiability problem, Model checking, Supervisory control

File Description: electronic

Access URL: https://gup.ub.gu.se/publication/98185
https://gup.ub.gu.se/publication/98185

Flexible scheduling of diagnostic tests in automotive manufacturing

Authors: Simone König Maximilian Reihn Felipe Gelinski Abujamra et al.

Source: Flexible Services and Manufacturing Journal. 35:320-342

Subject Terms: Non-preemptive scheduling, Car manufacturing, 0211 other engineering and technologies, Article, Multiple constraints, Boolean satisfiability problem, Automotive testing, Information and Computing Sciences, 02 engineering and technology, ddc:670, ddc

File Description: application/pdf

Access URL: https://link.springer.com/content/pdf/10.1007/s10696-021-09438-3.pdf
https://hdl.handle.net/10419/313364
https://mediatum.ub.tum.de/1764021
https://mediatum.ub.tum.de/1780183