Search
Search Results
-
Computing Smallest MUSes of Quantified Boolean Formulas
Computing small (subset-minimal or smallest) explanations is a computationally challenging task for various logics and non-monotonic formalisms....
-
True Crafted Formula Families for Benchmarking Quantified Satisfiability Solvers
As the application of quantified Boolean formulas (QBF) continues to expand in various scientific and industrial domains, the development of...
-
Propositional Logic
The subject of this chapter are propositional formulas (also called Boolean expressions). In the following, we will sketch the theory of...
-
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending the conflict-driven clause learning (CDCL) paradigm from SAT...
-
Probably Partially True: Satisfiability for Łukasiewicz Infinitely-Valued Probabilistic Logic and Related Topics
We study probabilistic-logic reasoning in a context that allows for “partial truths”, focusing on computational and algorithmic properties of...
-
On the upper bounds of (1,0)-super solutions for the regular balanced random (k,2s)-SAT problem
This paper explores the conditions which make a regular balanced random ( k ,2 s )-CNF formula (1,0)-unsatisfiable with high probability. The conditions...
-
Towards Satisfiability Modulo Parametric Bit-vectors
Many SMT solvers implement efficient SAT-based procedures for solving fixed-size bit-vector formulas. These techniques, however, cannot be used...
-
SMT: Something You Must Try
SMT (Satisfiability Modulo Theories) solving is a technology for the fully automated solution of logical formulas. Due to their impressive...
-
Logic-based cognitive planning for conversational agents
This paper presents a novel approach to cognitive planning based on an NP-complete logic of explicit and implicit belief whose satisfiability...
-
More efficient stochastic local search for satisfiability
Uniform random satisfiability (URS) and hard random satisfiability (HRS) are two significant generalizations of random satisfiability (RS). Recently,...
-
Solving 3SAT and MIS Problems with Analog Quantum Machines
This work considers the use of analog quantum machines to solve the boolean satisfiability problem 3SAT by taking Quadratic Unconstrained Binary...
-
An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem
The minimum independent dominance set (MIDS) problem is an important version of the dominating set with some other applications. In this work, we...
-
Hybrid Modal Operators for Definite Descriptions
In this paper, we study computational complexity and expressive power of modal operators for definite descriptions, which correspond to statements...
-
A tractable temporal description logic for reasoning fuzzy spatiotemporal knowledge
Fuzzy spatiotemporal reasoning is extensively used in various application fields such as Geographic Information Systems, Geospatial Artificial...
-
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under...
-
Solving the SAT problem using spiking neural P systems with coloured spikes and division rules
Spiking neural P systems (SNPS) are variants of the third-generation neural networks. In the last few decades, different variants of SNPS models have...
-
CHC Model Validation with Proof Guarantees
Formal verification tooling increasingly relies on logic solvers as automated reasoning engines. A point of commonality among these solvers is the...
-
New method for combining Matsui’s bounding conditions with sequential encoding method
As the first generic method for finding the optimal differentialand linear characteristics, Matsui’s branch and bound search algorithm has played an...
-
Scheduling through logic-based tools
A scheduling problem can be defined in a nutshell as the problem of determining when and how the activities of a project have to be run, according to...
-
Formal Verification of Blockchain Based Tender Systems
AbstractA tender process consists in competing offers from different candidate suppliers or contractors. The tender winner is supposed to supply or...
