Results 71 to 80 of about 62,255 (228)
Does Treewidth Help in Modal Satisfiability?
, 2010 Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance.
A. Herzig +24 more
core +1 more source
An Optimal Decision Procedure for MPNL over the Integers [PDF]
, 2011 Interval temporal logics provide a natural framework for qualitative and quantitative temporal reason- ing over interval structures, where the truth of formulae is defined over intervals rather than points.
Angelo Montanari +19 more
core +3 more sources
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
Classical and quantum satisfiability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present the linear algebraic definition of QSAT and propose a direct logical characterization of such a definition. We then prove that this logical version of QSAT is not an extension of classical satisfiability problem (SAT).
Anderson de Araújo, Marcelo Finger
doaj +1 more source
A Constructive Quantum Lov\'asz Local Lemma for Commuting Projectors [PDF]
, 2013 The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors.
Arad, Itai, Sattath, Or
core
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Research of Hamming weight-based algebraic side-channel attack on LED
Tongxin xuebao, 2013 :The security of LED against the algebraic side-channel attack (ASCA)was evaluated, which is a lightweight block cipher proposed in CHES 2011.Firstly, the attack model of ASCA was analyzed, and then the design and algebraic representations of LED were ...
Ke-ke JI +4 more
doaj
Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 The restricted Maximum k-Satisfiability MAX- kSAT is an enhanced Boolean satisfiability counterpart that has attracted numerous amount of research. Genetic algorithm has been the prominent optimization heuristic algorithm to solve constraint optimization
Mohd Shareduwan Bin Mohd Kasihmuddin +2 more
doaj +1 more source
Timed Context-Free Temporal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and context-free ...
Laura Bozzelli +2 more
doaj +1 more source
Discrete hopfield neural network in restricted maximum k-satisfiability logic programming
, 2018 Maximum k-Satisfiability (MAX-kSAT) consists of the most consistent interpretation that generate the maximum number of satisfied clauses. MAX-kSAT is an important logic representation in logic programming since not all combinatorial problem is ...
M. Kasihmuddin, M. Mansor, S. Sathasivam
semanticscholar +1 more source