Výsledky vyhľadávania - "((\"boolean satisfiability problem\") OR (\"boolean satisfiability problems\"))"

Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator

Autori: Cantone, Domenico Ursino, Pietro

Zdroj: ACM Transactions on Computational Logic. 25:1-30

Predmety: 03B25, 03B70, 03D15, 03E05, 05A18, 05C20, Satisfiability problem and decision procedures, Unordered Cartesian product, NEXPTIME satisfiability tests, Computable Set Theory, FOS: Mathematics, Mathematics - Combinatorics, Mathematics - Logic, Combinatorics (math.CO), 0102 computer and information sciences, 0101 mathematics, Logic (math.LO), 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2106.01224
https://hdl.handle.net/20.500.11769/575151
https://doi.org/10.1145/3626823

Solving Boolean Satisfiability Problems Using A Hypergraph-based Probabilistic Computer

Autori: He, Yihan Hong, Ming-Chun Zheng, Wanli a ďalší

Predmety: FOS: Physical sciences, Computational Physics (physics.comp-ph), Physics - Computational Physics

Prístupová URL adresa: http://arxiv.org/abs/2505.22215

HPC-based parallel software for solving applied Boolean satisfiability problems

Autori: A. A. Pashinin V. G. Bogdanova S. A. Gorsky

Zdroj: 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO). :1006-1011

Predmety: 0206 medical engineering, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://dblp.uni-trier.de/db/conf/mipro/mipro2020.html#BogdanovaGP20
https://doi.org/10.23919/MIPRO48935.2020.9245400

Accurate Modeling of Continuous-time SAT Solvers in SPICE

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

Zdroj: Radioengineering. 34:526-540

Predmety: 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 súboru: text; application/pdf

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

Scalable parallel solver of boolean satisfiability problems

Autori: S. A. Gorsky V. G. Bogdanova

Zdroj: 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). :0222-0227

Predmety: 13. Climate action, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://dblp.uni-trier.de/db/conf/mipro/mipro2018.html#BogdanovaG18

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

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

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

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

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-70264
https://doi.org/10.24963/ijcai.2025/508

Dense Implicant Cubes in Boolean Satisfiability Problems

Additional Titles: Tiheät implikanttikuutiot Boolen toteutuvuusongelmissa

Autori: Janhunen, Tomi Perustieteiden korkeakoulu Lipping, Joonas

Témy: G2 Pro gradu, diplomityö

Accurate Modeling of Continuous-time SAT Solvers in SPICE

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

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

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

Popis súboru: electronic resource

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

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

Automatically Transforming Object-Oriented Graph-Based Representations Into Boolean Satisfiability Problems for Computational Design Synthesis

Autori: Clemens Münzer Kristina Shea Bergen Helms

Zdroj: Journal of Mechanical Design. 135

Predmety: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://mechanicaldesign.asmedigitalcollection.asme.org/article.aspx?articleid=1714488
http://mechanicaldesign.asmedigitalcollection.asme.org/article.aspx?articleid=1714488
https://asmedigitalcollection.asme.org/mechanicaldesign/article/135/10/101001/380573/Automatically-Transforming-Object-Oriented-Graph

Towards Quantum Computing: Solving Satisfiability Problem by Quantum Annealing

Autori: Su, Juexiao

Predmety: Electrical engineering, Boolean Satisfiability, Quantum Annealing

Popis súboru: application/pdf

Prístupová URL adresa: https://escholarship.org/uc/item/8qp5200s
https://escholarship.org/content/qt8qp5200s/qt8qp5200s.pdf

Solving the boolean satisfiability problem using multilevel techniques

Autori: Salih, Sirar Song, Yujie

Dostupnosť: http://hdl.handle.net/11250/137529

Efficient solution of Boolean satisfiability problems with digital memcomputing

Autori: Bearden, Sean RB Pei, Yan Ru Di Ventra, Massimiliano

Zdroj: Scientific Reports. 10(1)

Predmety: Information and Computing Sciences, Mathematical Sciences, Artificial Intelligence, cs.ET, cond-mat.stat-mech, cs.CC, cs.NE

Popis súboru: application/pdf

Prístupová URL adresa: https://escholarship.org/uc/item/00x5s15w
https://escholarship.org/content/qt00x5s15w/qt00x5s15w.pdf

Inverse Design of Self-Folding 3D Shells

Autori: Pinto, Diogo E. P. Araújo, Nuno A. M. Šulc, Petr a ďalší

Zdroj: Physical Review Letters

Predmety: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, self-assembly, DNA, Boolean satisfiability problems, coarse-grained, design dimensions, design-process, external conditions, folding process, foldings, inverse designs, target structure, three-dimensional structure, Soft Condensed Matter (cond-mat.soft), FOS: Physical sciences, Condensed Matter - Soft Condensed Matter

Popis súboru: application/pdf

Prístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/38563942
http://arxiv.org/abs/2310.03537

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

Autori: ZEYEN, Olivier CORDY, Maxime Perrouin, Gilles a ďalší

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

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

Dostupnosť: 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

Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting.

Autori: Creignou, Nadia Vollmer, Heribert

Zdroj: Fundamenta Informaticae; 2015, Vol. 136 Issue 4, p297-316, 20p

Predmety: LOGIC circuits, MATHEMATICAL variables, COMPUTATIONAL complexity, BOOLEAN functions, COMBINATORIAL enumeration problems

Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting

Autori: Heribert Vollmer Nadia Creignou Creignou, Nadia

Prispievatelia: Heribert Vollmer Nadia Creignou Creignou, Nadia

Zdroj: Fundamenta Informaticae. 136:297-316

Predmety: [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, 0101 mathematics, 16. Peace & justice, 01 natural sciences, 3. Good health

Prístupová URL adresa: https://hal.science/hal-01192908v1
https://content.iospress.com/articles/fundamenta-informaticae/fi136-4-01
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.baztech-eb14e432-189a-4f11-81ee-e8f289d4f392
https://dblp.uni-trier.de/db/journals/fuin/fuin136.html#CreignouV15
https://hal.archives-ouvertes.fr/hal-01192908
https://doi.org/10.3233/FI-2015-1159

The VLSAT-2 Benchmark Suite ; Le jeu de tests VLSAT-2

Autori: Bouvier, Pierre Garavel, Hubert Construction of verified concurrent systems (CONVECS) a ďalší

Prispievatelia: Bouvier, Pierre Garavel, Hubert Construction of verified concurrent systems (CONVECS) a ďalší

Zdroj: https://inria.hal.science/hal-03337115 ; [Technical Report] RT-0514, INRIA Grenoble Rhône-Alpes. 2021, pp.1-8.

Predmety: SAT solving, Boolean satisfiability problem, Data set, DIMACS CNF, Nested-Unit Petri Net, NUPN, Petri Net, SAT formula, Benchmark suite, ensemble de données, formule SAT, problème SAT, réseau de Petri, satisfaisabilité booléenne, suite de tests, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]

Dostupnosť: https://inria.hal.science/hal-03337115
https://inria.hal.science/hal-03337115v1/document
https://inria.hal.science/hal-03337115v1/file/RT-0514.pdf

SAT-based Counterexample-Guided Inductive Synthesis of Distributed Controllers

Autori: Chukharev, Konstantin Suvorov, Dmitrii Chivilikhin, Daniil a ďalší

Zdroj: IEEE Access. 8:207485-207498

Predmety: Control system synthesis, Inference algorithms, Boolean satisfiability, Counterexample-guided inductive synthesis, Formal verification, Model checking, Dependable Communication and Computation Systems, Kommunikations- och beräkningssystem

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-81478
https://doi.org/10.1109/ACCESS.2020.3037780

Verification of some Boolean partial polymorphisms

Autori: Behrisch, Mike orcid:0000-0003-0050-

Predmety: Boolean relation, weak base, partial polymorphism, preservation, Boolean satisfiability problem, sat solving

Relation: https://github.com/z3prover/z3; https://zenodo.org/records/5745853; oai:zenodo.org:5745853; https://doi.org/10.5281/zenodo.5745853

Dostupnosť: https://doi.org/10.5281/zenodo.5745853
https://zenodo.org/records/5745853

A Continuous-time Dynamical System Solving the Satisfiability Problem

Autori: Hiroshi YAMASHITA

Zdroj: SEISAN KENKYU. 2020, 72(2):117