Suchergebnisse - "boolean satisfiability problem"

Accurate Modeling of Continuous-time SAT Solvers in SPICE

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

Quelle: Radioengineering. 34:526-540

Schlagwörter: 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

Dateibeschreibung: text; application/pdf

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

Accurate Modeling of Continuous-time SAT Solvers in SPICE

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

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

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

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/f52d3ce9252049c2bed4fd1945418627

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

Autoren: YE Tianyu WU Heng GAN Zhigang

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

Schlagwörter: K-subset summation problem, Grover quantum searching algorithm, Boolean satisfiability problem, quantum circuit, Telecommunication, TK5101-6720

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/b0d7fbc827654b2c910d31febc854aa4

DynamicSAT: Dynamic Configuration Tuning for SAT Solving

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

Weitere Verfasser: Shi, Zhengyuan Jiang, Wentao Zhang, Xindi et al.

Schlagwörter: configuration tuning, Boolean satisfiability problem, ddc:004, multi-armed bandit

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.34

SpecBCFuzz: Fuzzing LTL Solvers with Boundary Conditions

Autoren: Luiz Carvalho Renzo Degiovanni Maxime Cordy et al.

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

Schlagwörter: 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

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

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

Schlagwörter: 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

Zugangs-URL: https://doaj.org/article/ac14728dbef64d25b026da221d08b6be

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

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

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

Schlagwörter: 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

Zugangs-URL: https://doaj.org/article/05c48455aa084713811f3a30d4fa5ed5

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

Autoren: Wenjing Chang Wenlong Liu

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

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

Dateibeschreibung: application/pdf

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

Verfügbarkeit: https://doi.org/10.3390/electronics14030423

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

Autoren: Lekashri, S. Madhusudhan, K. N. SivaSangari, A. et al.

Quelle: Automatika, Vol 64, Iss 4, Pp 1067-1071 (2023)
Automatika : časopis za automatiku, mjerenje, elektroniku, računarstvo i komunikacije
Volume 64
Issue 4

Schlagwörter: T59.5, Automation, ultra low latency, Control engineering systems. Automatic machinery (General), TJ212-225, 0202 electrical engineering, electronic engineering, information engineering, time perceptive stream, gate scheduling, Bandwidth utilization, Boolean satisfiability problem, 02 engineering and technology

Dateibeschreibung: application/pdf

Zugangs-URL: https://doaj.org/article/3bebf414312c4ec9b24038d3eaf6d4c3
https://hrcak.srce.hr/file/456576
https://doi.org/10.1080/00051144.2023.2243142
https://hrcak.srce.hr/315983

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

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

Schlagwörter: 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

Verfügbarkeit: https://doi.org/10.13140/RG.2.2.35960.76802
https://zenodo.org/records/15351379

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

Autoren: Wenjing Chang Mengyu Guo Junwei Luo

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

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

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/19f1fd8cd95d4aa38537b289df07f644

Automated SAT Problem Feature Extraction using Convolutional Autoencoders

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

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

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

Dateibeschreibung: application/pdf

Zugangs-URL: http://hdl.handle.net/10468/13554
http://hdl.handle.net/10468/12238

Solving Graph Coloring Problem Based on Grover Algorithm

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

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

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

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/0626d97b4ece4c21b6f629c622f3ce31

Using machine learning classifiers in SAT branching

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/10468/15191

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

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

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

Schlagwörter: Computer Sciences, Datavetenskap (datalogi), Formal verification, Boolean satisfiability problem, Model checking, Supervisory control

Dateibeschreibung: electronic

Zugangs-URL: https://gup.ub.gu.se/publication/98185
https://gup.ub.gu.se/publication/98185

Flexible scheduling of diagnostic tests in automotive manufacturing

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

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-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

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

Autoren: Ahmad Bennakhi Gregory T. Byrd Paul Franzon

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

Schlagwörter: 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

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/aae939a08b72415b9d5a3accea98800a

Inverse design of self-folding 3D shells

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

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

Schlagwörter: 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

Verfügbarkeit: https://hdl.handle.net/11573/1706021
https://doi.org/10.1103/physrevlett.132.118201

Higher-Order Quantified Boolean Satisfiability

Autoren: Chistikov, Dmitry Haase, Christoph Hadizadeh, Zahra et al.

Weitere Verfasser: Chistikov, Dmitry Haase, Christoph Hadizadeh, Zahra et al.

Schlagwörter: Boolean satisfiability problem, higher-order Boolean functions, weak k-EXP hierarchies, non-elementary complexity, Presburger arithmetic

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.33

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.MFCS.2022.33
https://nbn-resolving.org/urn:nbn:de:0030-drops-168313
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.33

Fluctuation distributions of energy minima in complex landscapes

Autoren: Boltz, Horst-Holger Kurchan, Jorge Liu, Andrea, J et al.

Weitere Verfasser: Boltz, Horst-Holger Kurchan, Jorge Liu, Andrea, J et al.

Quelle: ISSN: 2643-1564.

Schlagwörter: Boolean satisfiability problem, NP-hard problems, Glasses, Spin glasses, Brownian dynamics, Computational complexity, Random matrix theory, Stochastic differential equations, [PHYS.COND.CM-SM]Physics [physics]/Condensed Matter [cond-mat]/Statistical Mechanics [cond-mat.stat-mech], [PHYS.COND.CM-DS-NN]Physics [physics]/Condensed Matter [cond-mat]/Disordered Systems and Neural Networks [cond-mat.dis-nn]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1911.08943; ARXIV: 1911.08943

Verfügbarkeit: https://hal.science/hal-04990843
https://hal.science/hal-04990843v1/document
https://hal.science/hal-04990843v1/file/PhysRevResearch.3.013061.pdf
https://doi.org/10.1103/physrevresearch.3.013061