Results 11 to 20 of about 44,054 (190)
Testing Quantum Satisfiability. [PDF]
Commun Math PhysAbstract 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
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
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
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 ...
Alon, Noga, Shapira, Asaf
openaire +2 more sources
Expected number of locally maximal solutions for random Boolean CSPs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 For a large number of random Boolean constraint satisfaction problems, such as random $k$-SAT, we study how the number of locally maximal solutions evolves when constraints are added.
Nadia Creignou +2 more
doaj +1 more source
Mathematics, 2022 Real life logical rule is not always satisfiable in nature due to the redundant variable that represents the logical formulation. Thus, the intelligence system must be optimally governed to ensure the system can behave according to non-satisfiable ...
Vikneswari Someetheram +6 more
doaj +1 more source
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits [PDF]
, 2013 We give a nontrivial algorithm for the satisfiability problem for cn-wire threshold circuits of depth two which is better than exhaustive search by a factor 2^{sn} where s= 1/c^{O(c^2)}.
Impagliazzo, Russell +2 more
core +1 more source
Adversarial satisfiability problem [PDF]
Journal of Statistical Mechanics: Theory and Experiment, 2011 We study the adversarial satisfiability problem, where the adversary can choose whether variables are negated in clauses or not in order to make the resulting formula unsatisfiable. This is one case of a general class of adversarial optimization problems that often arise in practice and are algorithmically much harder than the standard optimization ...
Castellana, Michele, Zdeborová, Lenka
openaire +3 more sources
A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment [PDF]
, 2017 Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms.
Voigt, Marco
core +3 more sources