An optimization approach for the satisfiability problem

We describe a new approach for solving the satisfiability problem by geometric programming. We focus on the theoretical background and give details of the algorithmic procedure. The algorithm is provably efficient as geometric programming is in essence a polynomial problem. The correctness of the al...

Full description

Bibliographic Details
Main Author:	S. Noureddine
Format:	Article
Language:	English
Published:	Emerald Publishing 2015-01-01
Series:	Applied Computing and Informatics
Subjects:	Satisfiability NP-complete problem Optimization Geometric programming
Online Access:	http://www.sciencedirect.com/science/article/pii/S2210832711000494

id	doaj-252dc081024746399cab58a783fd0112
record_format	Article
spelling	doaj-252dc081024746399cab58a783fd01122020-11-25T02:48:59ZengEmerald PublishingApplied Computing and Informatics2210-83272015-01-01111475910.1016/j.aci.2011.11.002An optimization approach for the satisfiability problemS. NoureddineWe describe a new approach for solving the satisfiability problem by geometric programming. We focus on the theoretical background and give details of the algorithmic procedure. The algorithm is provably efficient as geometric programming is in essence a polynomial problem. The correctness of the algorithm is discussed. The version of the satisfiability problem we study is exact satisfiability with only positive variables, which is known to be NP-complete.http://www.sciencedirect.com/science/article/pii/S2210832711000494SatisfiabilityNP-complete problemOptimizationGeometric programming
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	S. Noureddine
spellingShingle	S. Noureddine An optimization approach for the satisfiability problem Applied Computing and Informatics Satisfiability NP-complete problem Optimization Geometric programming
author_facet	S. Noureddine
author_sort	S. Noureddine
title	An optimization approach for the satisfiability problem
title_short	An optimization approach for the satisfiability problem
title_full	An optimization approach for the satisfiability problem
title_fullStr	An optimization approach for the satisfiability problem
title_full_unstemmed	An optimization approach for the satisfiability problem
title_sort	optimization approach for the satisfiability problem
publisher	Emerald Publishing
series	Applied Computing and Informatics
issn	2210-8327
publishDate	2015-01-01
description	We describe a new approach for solving the satisfiability problem by geometric programming. We focus on the theoretical background and give details of the algorithmic procedure. The algorithm is provably efficient as geometric programming is in essence a polynomial problem. The correctness of the algorithm is discussed. The version of the satisfiability problem we study is exact satisfiability with only positive variables, which is known to be NP-complete.
topic	Satisfiability NP-complete problem Optimization Geometric programming
url	http://www.sciencedirect.com/science/article/pii/S2210832711000494
work_keys_str_mv	AT snoureddine anoptimizationapproachforthesatisfiabilityproblem AT snoureddine optimizationapproachforthesatisfiabilityproblem
_version_	1724745441070809088

An optimization approach for the satisfiability problem

Similar Items