scholarly journals Extending propositional satisfiability to determine minimal fuzzy-rough reducts

2010 ◽  
Author(s):  
Richard Jensen ◽  
Andrew Tuson ◽  
Qiang Shen
Keyword(s):  
Propositional Satisfiability

scholarly journals Evolving Solutions to Community-Structured Satisfiability Formulas

2019 ◽  
Vol 33 ◽  
pp. 2346-2353
Author(s):  
Frank Neumann ◽  
Andrew M. Sutton
Keyword(s):  
Community Structure ◽  
Evolutionary Algorithms ◽  
Objective Function ◽  
Search Space ◽  
Propositional Satisfiability ◽  
Satisfying Assignment ◽  
Distance Correlation ◽  
Strong Signal ◽  
Fitness Distance Correlation ◽  
Correlation Properties

We study the ability of a simple mutation-only evolutionary algorithm to solve propositional satisfiability formulas with inherent community structure. We show that the community structure translates to good fitness-distance correlation properties, which implies that the objective function provides a strong signal in the search space for evolutionary algorithms to locate a satisfying assignment efficiently. We prove that when the formula clusters into communities of size s ∈ ω(logn) ∩O(nε/(2ε+2)) for some constant 0

scholarly journals A Formal Approach for Cautious Reasoning in Answer Set Programming (Extended Abstract)

2020 ◽  
Author(s):  
Giovanni Amendola ◽  
Carmine Dodaro ◽  
Marco Maratea
Keyword(s):  
Answer Set Programming ◽  
Satisfiability Modulo Theories ◽  
Propositional Satisfiability ◽  
Formal Approach ◽  
Boolean Formulas ◽  
Reasoning Tasks ◽  
Answer Set

The issue of describing in a formal way solving algorithms in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set Programming (ASP), and Constraint ASP, has been relatively recently solved employing abstract solvers. In this paper we deal with cautious reasoning tasks in ASP, and design, implement and test novel abstract solutions, borrowed from backbone computation in SAT. By employing abstract solvers, we also formally show that the algorithms for solving cautious reasoning tasks in ASP are strongly related to those for computing backbones of Boolean formulas. Some of the new solutions have been implemented in the ASP solver WASP, and tested.

Propositional Satisfiability Techniques

2004 ◽  
pp. 143-166 ◽  
Author(s):  
Malik Ghallab ◽  
Dana Nau ◽  
Paolo Traverso
Keyword(s):  
Propositional Satisfiability

Chapter 20. Software Verification

2021 ◽  
Author(s):  
Daniel Kroening
Keyword(s):  
Program Analysis ◽  
Software Verification ◽  
Embedded Software ◽  
Propositional Satisfiability ◽  
Low Level

This chapter covers an application of propositional satisfiability to program analysis. We focus on the discovery of programming flaws in low-level programs, such as embedded software. The loops in the program are unwound together with a property to form a formula, which is then converted into CNF. The method supports low-level programming constructs such as bit-wise operators or pointer arithmetic.

Parallel propositional satisfiability checking with distributed dynamic learning

2003 ◽  
Vol 29 (7) ◽  
pp. 969-994 ◽  
Author(s):  
Wolfgang Blochinger ◽  
Carsten Sinz ◽  
Wolfgang Küchlin
Keyword(s):  
Propositional Satisfiability ◽  
Dynamic Learning ◽  
Satisfiability Checking

scholarly journals A new algorithm for the propositional satisfiability problem

1995 ◽  
Vol 60 (1-3) ◽  
pp. 159-179 ◽  
Author(s):  
G. Gallo ◽  
D. Pretolani
Keyword(s):  
Satisfiability Problem ◽  
Propositional Satisfiability
Sign in / Sign up

Export Citation Format

Share Document