Search
Search Results
-
A Semi-Tensor Product Based All Solutions Boolean Satisfiability Solver
Boolean satisfiability (SAT) is widely used as a solver engine in electronic design automation (EDA). Typically, SAT is used to determine whether one...
-
A Resolution Proof System for Dependency Stochastic Boolean Satisfiability
Dependency stochastic Boolean satisfiability (DSSAT), which generalizes stochastic Boolean satisfiability (SSAT) and dependency quantified Boolean...
-
-
Learning to select SAT encodings for pseudo-Boolean and linear integer constraints
Many constraint satisfaction and optimisation problems can be solved effectively by encoding them as instances of the Boolean Satisfiability problem...
-
The complexities of the satisfiability checking problems of feature diagram sublanguages
It is well-known that the satisfiability problem of feature diagrams (FDs) is computationally hard. This paper examines the complexities of the...
-
Railway Scheduling Using Boolean Satisfiability Modulo Simulations
Railway scheduling is a problem that exhibits both non-trivial discrete and continuous behavior. In this paper, we model this problem using...
-
Maximum Satisfiability of Mission-Time Linear Temporal Logic
Mission-time Linear Temporal Logic (MLTL) is a variant of Linear Temporal Logic (LTL) with finite interval bounds on temporal operators, and is a...
-
Satisfiability Modulo Finite Fields
We study satisfiability modulo the theory of finite fields and give a decision procedure for this theory. We implement our procedure for prime fields...
-
Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem
For typical first-order logical theories, satisfying assignments have a straightforward finite representation that can directly serve as a...
-
Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic
AbstractSequential reactive systems are computer programs or hardware devices which process the flows of input data or control signals and output the...
-
ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy
Stochastic local search algorithm with configuration check strategy can effectively solve random satisfiability instances, so configuration check...
-
Variational satisfiability solving: efficiently solving lots of related SAT problems
Incremental satisfiability (SAT) solving is an extension of classic SAT solving that enables solving a set of related SAT problems by identifying and...
-
Bloomfilter-Based Practical Kernelization Algorithms for Minimum Satisfiability
Minimum Satisfiability problem (briefly, given a CNF formula, find an assignment satisfying the minimum number of clauses) has raised much attention...
-
Subtropical Satisfiability for SMT Solving
A wide range of problems from aerospace engineering and other application areas can be encoded logically and solved using satisfiability modulo...
-
A Refined Branching Algorithm for the Maximum Satisfiability Problem
The Maximum satisfiability problem ( MaxSAT ) is a fundamental NP-hard problem which has significant applications in many areas. Based on refined...
-
Saturation-Based Boolean Conjunctive Query Answering and Rewriting for the Guarded Quantification Fragments
Query answering is an important problem in AI, database and knowledge representation. In this paper, we develop saturation-based Boolean conjunctive...
-
How Easy it is to Know How: An Upper Bound for the Satisfiability Problem
We investigate the complexity of the satisfiability problem for a modal logic expressing ‘knowing how’ assertions, related to an agent’s abilities to...
-
Robust Weighted Partial Maximum Satisfiability Problem: Challenge to \(\varSigma _{2}^{P}\) -Complete Problem
This paper introduces a new problem called the Robust Maximum Satisfiability problem (R-MaxSAT), as well as its extension called the Robust weighted...