A novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra

Carlos Barrón-Romero

A novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra

Data Structures and Algorithms 2018-04-17 v7 Computational Complexity Logic in Computer Science

Authors: Carlos Barrón-Romero

Abstract

This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two operations: expansion and simplification are used to explains why using algebra grows the resolution steps. It is proved that its complexity has an upper bound of $2^{n-1}$ where $n$ is the number of logical variables of the given problem.

Keywords

constraint satisfaction computational complexity optimization algorithm

Cite

@article{arxiv.1605.07503,
  title  = {A novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra},
  author = {Carlos Barrón-Romero},
  journal= {arXiv preprint arXiv:1605.07503},
  year   = {2018}
}

Comments

arXiv admin note: text overlap with arXiv:1602.06867 Published in COMTEL 2016 (http://www.comtel.pe/memoriacomtel/COMTEL2016.pdf) See in http://academicos.azc.uam.mx/cbr/

A novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra

Abstract

Keywords

Cite

Comments

Related papers