Results 91 to 100 of about 1,567 (182)
New Journal of Physics, 2016 We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists ...
Salvatore Mandrà +2 more
doaj +1 more source
International Journal of Robust and Nonlinear Control, Volume 36, Issue 5, Page 3047-3067, 25 March 2026.ABSTRACT This paper presents a robust control synthesis and analysis framework for nonlinear systems with uncertain initial conditions. First, a deep learning‐based lifting approach is proposed to approximate nonlinear dynamical systems with linear parameter‐varying (LPV) state‐space models in higher‐dimensional spaces while simultaneously ...
Sourav Sinha, Mazen Farhood
wiley +1 more source
On the Satisfiability of Local First-Order Logics with Data [PDF]
Logical Methods in Computer ScienceWe study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality.
Benedikt Bollig +2 more
doaj +1 more source
Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions
Scientific Reports, 2018 Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic ...
Parami Wijesinghe +2 more
doaj +1 more source
Satisfiability with Exponential Families [PDF]
, 2007 Fix a set S ⊆ {0, 1}* of exponential size, e.g. |S ∩ {0, 1}n| ∈ Ω(αn), α > 1. The S-SAT problem asks whether a propositional formula F over variables v1, . . . , vn has a satisfying assignment (v1, . . . , vn) ∈ {0, 1}n ∩ S. Our interest is in determining the complexity of S-SAT.
Dominik Scheder, Philipp Zumstein
openaire +1 more source
Ontology-Based Finite Satisfiability of UML Class Model
IEEE Access, 2018 Software models are core artifacts in model driven engineering (MDE) and processable by computer. They are automatically transformed into other models and in MDE, programming code is also produced by the models.
Abdul Hafeez Khan +3 more
doaj +1 more source
Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi [PDF]
Logical Methods in Computer ScienceThe coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based.
Daniel Hausmann, Lutz Schröder
doaj +1 more source
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures [PDF]
Logical Methods in Computer ScienceWe introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete.
Stephane Demri, Karin Quaas
doaj +1 more source
Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems
MathematicsSolving satisfiability problems is central to many areas of computer science, including artificial intelligence and optimization. Efficiently solving satisfiability problems requires exploring vast search spaces, where search space partitioning plays a ...
Yuexin Huang, Qinzhou Niu, Yanfang Song
doaj +1 more source
Satisfiability of XPath Expressions [PDF]
, 2004 In this paper, we investigate the complexity of deciding the satisfiability of XPath 2.0 expressions, i.e., whether there is an XML document for which their result is nonempty. Several fragments that allow certain types of expressions are classified as either in PTIME or NP-hard to see which type of expression make this a hard problem.
openaire +2 more sources