Results 131 to 140 of about 18,245 (221)

Representation theorems for hypergraph satisfiability [PDF]

, 1997
Given a set of propositions, one can consider its inconsistency hypergraph. Then the satisfiability of sets of clauses with respect to that hypergraph (see [1], [6]) turns out to be the usual satisfiability.
Kolany, Adam
core  

Satisfiability in composition-nominative logics

Open Computer Science, 2012
Nikitchenko Mykola, Tymofieiev Valentyn
doaj   +1 more source

Percolation of Satisfiability in Finite Dimensions [PDF]

, 2003
The satisfiability and optimization of finite-dimensional Boolean formulas are studied using percolation theory, rare region arguments, and boundary effects.
Middleton, Alan, Schwarz, J. M.
core  

Fast LTL satisfiability checking by sat solvers

, 2014
. Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of different search procedures.
Lijun Zhang, Jifeng He, Geguang Pu, Jianwen Li, Moshe Y. Vardi   +4 more
core  

Generalized Satisfiability for the Description Logic ALC

, 2015
. The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms.
Arne Meier, Thomas Schneider
core  

Boolean Satisfiability in Electronic Design Automation [PDF]

, 2000
Marques-Silva, J. P., Sakallah, K. A.
core   +2 more sources

Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation. [PDF]

PLoS One, 2023
Ali GA, Abubakar H, Alzaeemi SAS, Almawgani AHM, Sulaiman A, Tay KG.   +5 more
europepmc   +1 more source

Design Diagnosis Using Boolean Satisfiability

, 2008
Recent advances in Boolean satisfiability have made it an attractive engine for solving many digital VLSI design problems such as verification, model checking, optimization and test generation.
Alexander Smith, Anastasios Viglas, Andreas Veneris   +2 more
core  

Combining Adaptive and Dynamic Local Search for Satisfiability

, 2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+, draws on the features of two other WalkSAT family algorithms: AdaptNovelty+ and G2WSAT, while ...
Thornton, John, Sattar, Abdul, Pham, Duc Nghia, Gretton, Charles   +3 more
core  

Parameterized Complexities of Dominating and Independent Set Reconfiguration. [PDF]

Algorithmica
Bodlaender HL, Groenland C, Swennenhuis CMF.   +2 more
europepmc   +1 more source