Search
Search Results
-
Properties of the satisfiability threshold of the strictly d-regular random (3,2s)-SAT problem
A k -CNF (conjunctive normal form) formula is a regular ( k, s )-CNF one if every variable occurs s times in the formula, where k ⩾ 2 and s > 0 are...
-
Non-numerical weakly relational domains
The weakly relational domain of Octagons offers a decent compromise between precision and efficiency for numerical properties. Here, we are concerned...
-
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
In this paper, we discuss algorithms for the problem of finding read-once resolution refutations of unsatisfiable 2CNF formulas within the resolution...
-
On the Complexity of the Clone Membership Problem
We investigate the complexity of the Boolean clone membership problem (CMP): given a set of Boolean functions F and a Boolean function f , determine...
-
A Navigation Logic for Recursive Programs with Dynamic Thread Creation
Dynamic Pushdown Networks (DPNs) are a model for multithreaded programs with recursion and dynamic creation of threads. In this paper, we propose a...
-
Explainable Algorithm Selection for the Capacitated Lot Sizing Problem
Algorithm selection is a class of meta-algorithms that has emerged as a crucial approach for solving complex combinatorial optimization problems....
-
Verification of LSTM Neural Networks with Non-linear Activation Functions
Recurrent neural networks are increasingly employed in safety-critical applications, such as control in cyber-physical systems, and therefore their...
-
Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment
We study the complexity of two standard reasoning problems for Forward Guarded Logic (...
-
A Parallel and Distributed Quantum SAT Solver Based on Entanglement and Teleportation
Boolean satisfiability (SAT) solving is a fundamental problem in computer science. Finding efficient algorithms for SAT solving has broad...
-
A Tabu Search Algorithm for the Map Labeling Problem
In this paper we propose an algorithm based on the Tabu Search metaheuristic for the Map Labeling problem, i.e. the relevant problem in cartography...
-
Classified enhancement model for big data storage reliability based on Boolean satisfiability problem
Disk reliability is a serious problem in the big data foundation environment. Although the reliability of disk drives has greatly improved over the...
-
The Complexity of Online Graph Games
Online computation is a concept to model uncertainty where not all information on a problem instance is known in advance. An online algorithm...
-
Synthesising Programs with Non-trivial Constants
Program synthesis is the mechanised construction of software. One of the main difficulties is the efficient exploration of the very large solution...
-
Learning the travelling salesperson problem requires rethinking generalization
End-to-end training of neural network solvers for graph combinatorial optimization problems such as the Travelling Salesperson Problem (TSP) have...
-
Probe Machine Based Computing Model for Solving Satisfiability Problem
Probe Machine (PM) is a recently reported theoretical model with massive parallelism. Particularly, Turing Machine (TM) had been proven to be the...
-
A Novel EGs-Based Framework for Systematic Propositional-Formula Simplification
This paper presents a novel simplification calculus for propositional logic derived from Peirce’s Existential Graphs’ rules of inference and...
-
Using OR-Tools When Solving the Nurse Scheduling Problem
Scheduling of employees is a common problem that can be found in most organizations all over the world. One example is the nurse scheduling problem...
-
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization
In the last decade, numerous algorithms for single-objective Boolean optimization have been proposed that rely on the iterative usage of a highly...
-
CNF Encodings of Symmetric Functions
Many Boolean functions that need to be encoded as CNF in practice, have only exponential size CNF representations. To avoid this effect, one usually...
-
Algorithm selection on a meta level
The problem of selecting an algorithm that appears most suitable for a specific instance of an algorithmic problem class, such as the Boolean...
