Search
Search Results
-
A Resolution Proof System for Dependency Stochastic Boolean Satisfiability
Dependency stochastic Boolean satisfiability (DSSAT), which generalizes stochastic Boolean satisfiability (SSAT) and dependency quantified Boolean...
-
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...
-
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
Local Search for Solving Satisfiability of Polynomial Formulas
Satisfiability Modulo the Theory of Nonlinear Real Arithmetic, SMT(NRA) for short, concerns the satisfiability of polynomial formulas, which are...
-
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...
-
Multiple Query Satisfiability of Constrained Horn Clauses
We address the problem of checking the satisfiability of a set of constrained Horn clauses (CHCs) possibly including more than one query. We propose...
-
Multi-discrete genetic algorithm in hopfield neural network with weighted random k satisfiability
The existing Discrete Hopfield Neural Network with systematic Satisfiability models produced repetition of final neuron states which promotes to...
-
Constrained Horn Clauses Satisfiability via Catamorphic Abstractions
Catamorphisms are functions recursively defined on Algebraic Data Types (such as lists and trees), which are often used to compute suitable...
-
Logics with Probabilistic Team Semantics and the Boolean Negation
We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the...