Results 11 to 20 of about 1,567 (182)
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
Efficient optimization with higher-order Ising machines [PDF]
Nature Communications, 2023 A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables.
Connor Bybee +5 more
doaj +2 more sources
Minimal reduct for propositional circumscription [PDF]
Frontiers in Artificial IntelligenceCircumscription is an important logic framework for representing and reasoning common-sense knowledge. With efficient implementations for circumscription, including circ2dlp and aspino, it has been widely used in model-based diagnosis and other domains ...
Zhongtao Xie +3 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
exaly +3 more sources
Terminal Satisfiability in GSTE [PDF]
Journal of Applied Mathematics, 2014 Generalized symbolic trajectory evaluation (GSTE) is an extension of symbolic trajectory evaluation (STE) and a method of model checking. GSTE specifications are given as assertion graphs.
Yongsheng Xu +4 more
doaj +4 more sources
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
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
An Effective SAT Solver Utilizing ACO Based on Heterogenous Systems
IEEE Access, 2020 This paper presents new parallel strategies for preprocessing and solving the issue of Boolean Satisfaction (SAT) on Heterogeneous systems of multicore and many-core CPU and Graphics Processing Unit (GPU) using Open Multi-Processor (OpenMP) and NVIDIA ...
Hassan Youness +4 more
doaj +1 more source
Journal of Algorithms, 2003 Summary: Let \(\Phi\) be a set of general boolean functions on \(n\) variables, such that each function depends on exactly \(k\) variables, and each variable can take a value from \([1,d]\). We say that \(\Phi\) is \(\varepsilon\)-far from satisfiable, if one must remove at least \(\varepsilon n^k\) functions in order to make the set of remaining ...
Noga Alon, Asaf Shapira
openaire +3 more sources
Logical Methods in Computer Science, 2013 We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable.
Luc Segoufin, Balder ten Cate
doaj +1 more source