Výsledky vyhledávání - (("boolean satisfiability problem") OR ("boolean satisfiability problemy"))

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

Autoři: Claessen, Koen Een, Niklas Sheeran, Mary a další

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

Témata: Computer Sciences, Datavetenskap (datalogi), Formal verification, Boolean satisfiability problem, Model checking, Supervisory control

Popis souboru: electronic

Přístupová URL adresa: https://gup.ub.gu.se/publication/98185
https://gup.ub.gu.se/publication/98185

On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2

Autoři: Takeyuki TAMURA Tatsuya AKUTSU

Zdroj: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2009, E92.A(8):1771

Υλοποίηση διαδικτυακού προσομοιωτή για αλγορίθμους επίλυσης προβλημάτων SAT

Autoři: Χαρατσάρης, Δημήτριος

Thesis Advisors: Σγάρμπας, Κυριάκος, Charatsaris, Dimitrios, Φακωτάκης, Νικόλαος

Témata: Τεχνητή νοημοσύνη, Προτασιακή λογική, Αλγόριθμοι επίλυσης προβληµάτων, 005.1, Artificial intelligence, Propositional calculus, Boolean satisfiability problem, SAT

Dostupnost: http://hdl.handle.net/10889/5754

Neuro-inspired computing enhanced by scalable algorithms and physics of emerging nanoscale resistive devices

Autoři: Parami Wijesinghe (6838184)

Témata: Neuroscience, Computer Engineering, Software Engineering, Probability, Neurocognitive Patterns and Neural Networks, Electrical and Electronic Engineering not elsewhere classified, Ordinary Differential Equations, Difference Equations and Dynamical Systems, Emerging devices, Magnetic Tunnel Junctions, Cellular neural network, Boolean satisfiability problem, Convolutional neural networks, Speech recognition, Image classification, memristive devices, liquid state machines, echo state networks, ensemble approach, low power consumption, faster evaluation, Low memory, High accuracy, brain inspired computing

Relation: https://figshare.com/articles/Neuro-inspired_computing_enhanced_by_scalable_algorithms_and_physics_of_emerging_nanoscale_resistive_devices/8273483

Accurate Modeling of Continuous-time SAT Solvers in SPICE

Autoři: Pershin, Y. V. Nguyen, D. C.

Zdroj: Radioengineering. 34:526-540

Témata: 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

Popis souboru: text; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2412.14690
https://hdl.handle.net/11012/255413

Accurate Modeling of Continuous-time SAT Solvers in SPICE

Autoři: Y. V. Pershin D. C. Nguyen

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

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

Popis souboru: electronic resource

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

Přístupová URL adresa: https://doaj.org/article/f52d3ce9252049c2bed4fd1945418627

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

Autoři: YE Tianyu WU Heng GAN Zhigang

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

Témata: K-subset summation problem, Grover quantum searching algorithm, Boolean satisfiability problem, quantum circuit, Telecommunication, TK5101-6720

Popis souboru: electronic resource

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

Přístupová URL adresa: https://doaj.org/article/b0d7fbc827654b2c910d31febc854aa4

The Generalized Splitting method for Combinatorial Counting and Static Rare-Event Probability Estimation

Autoři: Zdravko Botev

Témata: Static Splitting, MCMC, static rare-event probability estimation, convergence diagnostic, sequential importance sampling, Boolean Satisfiability problem, kernel density estimation, automatic bandwidth selection

Dostupnost: http://espace.library.uq.edu.au/view/UQ:198531

DynamicSAT: Dynamic Configuration Tuning for SAT Solving

Autoři: Shi, Zhengyuan Jiang, Wentao Zhang, Xindi a další

Přispěvatelé: Shi, Zhengyuan Jiang, Wentao Zhang, Xindi a další

Témata: Boolean satisfiability problem, configuration tuning, multi-armed bandit

Popis souboru: 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

Dostupnost: 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

Autoři: Wenjing Chang Wenlong Liu

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

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

Popis souboru: application/pdf

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

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

SpecBCFuzz: Fuzzing LTL Solvers with Boundary Conditions

Autoři: Luiz Carvalho Renzo Degiovanni Maxime Cordy a další

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

Témata: 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

Autoři: Farah Liyana Azizan Saratha Sathasivam Nurshazneem Roslan a další

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

Témata: 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

Přístupová URL adresa: https://doaj.org/article/ac14728dbef64d25b026da221d08b6be

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

Autoři: Gaeithry Manoharam Azleena Mohd Kassim Suad Abdeen a další

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

Témata: 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

Přístupová URL adresa: https://doaj.org/article/05c48455aa084713811f3a30d4fa5ed5

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

Autoři: MUÑOZ DE LA CUESTA, JAVIER orcid:0000-0003-1605-

Témata: 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

Dostupnost: 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

Autoři: S. Lekashri K. N. Madhusudhan A. SivaSangari a další

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

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

Popis souboru: electronic resource

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

Přístupová URL adresa: https://doaj.org/article/3bebf414312c4ec9b24038d3eaf6d4c3

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

Autoři: Wenjing Chang Mengyu Guo Junwei Luo

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

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

Popis souboru: electronic resource

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

Přístupová URL adresa: https://doaj.org/article/19f1fd8cd95d4aa38537b289df07f644

Solving Graph Coloring Problem Based on Grover Algorithm

Autoři: LIU Xiaonan, LIU Zhengyu, XIE Haoshan, ZHAO Chenyan

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

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

Popis souboru: electronic resource

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

Přístupová URL adresa: https://doaj.org/article/0626d97b4ece4c21b6f629c622f3ce31

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

Autoři: Ahmad Bennakhi Gregory T. Byrd Paul Franzon

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

Témata: 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

Popis souboru: electronic resource

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

Přístupová URL adresa: https://doaj.org/article/aae939a08b72415b9d5a3accea98800a

Inverse design of self-folding 3D shells

Autoři: Diogo E. P. Pinto Nuno A. M. Araújo Petr Šulc a další

Přispěvatelé: Diogo E. P. Pinto Nuno A. M. Araújo Petr Šulc a další

Témata: 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

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

Automated SAT Problem Feature Extraction using Convolutional Autoencoders

Autoři: Dalla, Marco Visentin, Andrea O'Sullivan, Barry

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

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

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10468/13554
http://hdl.handle.net/10468/12238