Results 1 to 10 of about 1,182 (134)
Quantum Algorithm for Variant Maximum Satisfiability [PDF]
Entropy, 2022 In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that
Abdirahman Alasow +2 more
doaj +2 more sources
An optimization approach for the satisfiability problem
Applied Computing and Informatics, 2015 We describe a new approach for solving the satisfiability problem by geometric programming. We focus on the theoretical background and give details of the algorithmic procedure. The algorithm is provably efficient as geometric programming is in essence a
S. Noureddine
doaj +3 more sources
Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework [PDF]
PeerJ Computer ScienceThe Boolean satisfiability (SAT) problem exhibits different structural features in various domains. Neural network models can be used as more generalized algorithms that can be learned to solve specific problems based on different domain data than ...
Wenjing Chang, Mengyu Guo, Junwei Luo
doaj +3 more sources
Governance as a complex, networked, democratic, satisfiability problem [PDF]
npj ComplexityDemocratic governments comprise a subset of a population whose goal is to produce coherent decisions solving societal challenges while respecting the will of the people.
Laurent Hébert-Dufresne +8 more
doaj +2 more sources
APPLICATION OF INCREMENTAL SATISFIABILITY PROBLEM SOLVERS FOR NON-DETERMINISTIC POLYNOMIAL-TIME HARD PROBLEMS AS ILLUSTRATED BY MINIMAL BOOLEAN FORMULA SYNTHESIS PROBLEM [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper considers a method for solution of the nondeterministic polynomial hard problem (NP-hard problem) of a minimal Boolean formula synthesis from a given truth table.
Konstantin I. Chukharev
doaj +1 more source
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic [PDF]
Logical Methods in Computer Science, 2022 We introduce a model of register automata over infinite trees with extrema constraints. Such an automaton can store elements of a linearly ordered domain in its registers, and can compare those values to the suprema and infima of register values in ...
Szymon Toruńczyk, Thomas Zeume
doaj +1 more source
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our attention to finite ...
Jakub Michaliszyn +2 more
doaj +1 more source
Satisfiability Problem in Interval FP-logic
Известия Иркутского государственного университета: Серия "Математика", 2023 The article investigates the interval modal logic, in which an action of the modal operator $\Diamond$ is limited by the boundaries of an interval. In addition, the language of modal logic is extended by the operator $D (\alpha, \beta)$, the truth of ...
N.A. Protsenko +2 more
doaj +1 more source
Clausal Forms in MaxSAT and MinSAT
International Journal of Computational Intelligence Systems, 2022 We tackle the problem of reducing non-clausal MaxSAT and MinSAT to clausal MaxSAT and MinSAT. Our motivation is twofold: (i) the clausal form transformations used in SAT are unsound for MaxSAT and MinSAT, because they do not preserve the minimum or ...
Chu Min Li +3 more
doaj +1 more source
Satisfiability Games for Branching-Time Logics [PDF]
Logical Methods in Computer Science, 2013 The satisfiability problem for branching-time temporal logics like CTL*, CTL and CTL+ has important applications in program specification and verification. Their computational complexities are known: CTL* and CTL+ are complete for doubly exponential time,
Oliver Friedmann +2 more
doaj +1 more source