Results 1 to 10 of about 62,255 (228)

Quantum Algorithm for Variant Maximum Satisfiability. [PDF]

Entropy (Basel), 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
Alasow A, Jin P, Perkowski M.
europepmc   +2 more sources

Testing Quantum Satisfiability. [PDF]

Commun Math Phys
Abstract Quantum k-SAT (the problem of determining whether a k-local Hamiltonian is frustration-free) is known to be QMA $$_1$$ 1 -complete for
Montanaro A, Shao C, Verdon D, Verdon D.
europepmc   +6 more sources

Non-Systematic Weighted Satisfiability in Discrete Hopfield Neural Network Using Binary Artificial Bee Colony Optimization

Mathematics, 2022
Recently, new variants of non-systematic satisfiability logic were proposed to govern Discrete Hopfield Neural Network. This new variant of satisfiability logical rule will provide flexibility and enhance the diversity of the neuron states in the ...
Siti Syatirah Muhammad Sidik, Nur Ezlin Zamri, Mohd Shareduwan Mohd Kasihmuddin, Habibah A. Wahab, Yueling Guo, Mohd. Asyraf Mansor   +5 more
doaj   +2 more sources

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, Martin Lange, Markus Latte   +2 more
doaj   +4 more sources

Satisfiability Modulo ODEs [PDF]

2013 Formal Methods in Computer-Aided Design, 2013
We study SMT problems over the reals containing ordinary differential equations. They are important for formal verification of realistic hybrid systems and embedded software.
Clarke, Edmund, Gao, Sicun, Kong, Soonho
core   +3 more sources

A Survey of Satisfiability Modulo Theory [PDF]

Computer Algebra in Scientific Computing, 2016
Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories.
A Albarghouthi, A Haken, A Maréchal, A Schrijver, AR Bradley, B Dutertre, D Handelman, D Jovanović, D Kroening, D Monniaux, D Monniaux, D Monniaux, DY Grigor’ev, G Faure, G Winskel, GB Dantzig, GE Collins, H Unno, I Dillig, J Christ, J Ferrante, J Henry, JC King, KL McMillan, KL McMillan, KL McMillan, L Dai, L Moura de, M Armand, M Brain, N Bjørner, P Cuoq, R Loos, R Sebastiani, R Sharma, S Basu, S Böhme, S Cotton   +37 more
core   +3 more sources

Minimal reduct for propositional circumscription. [PDF]

Front Artif Intell
Circumscription 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 ...
Xie Z, Wang Y, Yang L, Feng R.
europepmc   +2 more sources

Efficient optimization with higher-order ising machines. [PDF]

Nat Commun, 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.
Bybee C, Kleyko D, Nikonov DE, Khosrowshahi A, Olshausen BA, Sommer FT.   +5 more
europepmc   +2 more sources

Satisfiability-Aided Language Models Using Declarative Prompting [PDF]

Neural Information Processing Systems, 2023
Prior work has combined chain-of-thought prompting in large language models (LLMs) with programmatic representations to perform effective and transparent reasoning.
Xi Ye, Qiaochu Chen, Işıl Dillig, Greg Durrett   +3 more
semanticscholar   +1 more source

Machine Learning Methods in Solving the Boolean Satisfiability Problem [PDF]

Machine Intelligence Research, 2022
This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT), an archetypal NP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy ...
Wenxuan Guo, Junchi Yan, Hui-Ling Zhen, Xijun Li, M. Yuan, Yaohui Jin   +5 more
semanticscholar   +1 more source