3 articles for “Satisfiability”

Set a search alert

Research ArticleOpen accessIn the keywordsOn a Proof of Inequality of PvsNPAngelo Raffaele MeoThis study is a new version of a previous paper. Its purpose is to simplify some sections of the old version and, above all, to present the proofs of some theorems which had been omitted for the sake of brevity. The analysis discussed in this study and its previous version is based on a well-known NP-complete problem which is called … …Journal of Computer Science, Vol. 19, Issue 1 · 16 Jan 2023 · 7,531 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsOn the P VS NP Question: A New Proof of InequalityAngelo Raffaele MeoThe analysis discussed in this study is based on a well-known NP-complete problem which is called “satisfiability problem or SAT”. From SAT a new NP-complete problem derives, which is described by a Boolean function of the number n of the clauses of SAT called “core function”. In this study a new proof is presented according which the number of gates … …Journal of Computer Science, Vol. 17, Issue 5 · 27 May 2021 · 9,442 accessesView PDF Cite

Research ArticleOpen accessIn the abstractCONSTRAINT SOVLING ENGINE BASED NURSE ROSTERING WITH INTELLIGENT BACKTRACKINGS. Chitrakala, S. P. Surendernath, R. PriyatharshiniEfficient utilization of time and effort is essential in Personnel scheduling problems to evenly balance the workload among the people and attempt to satisfy the personnel preferences. In Constraint Satisfaction Problem based scheduling problems, when a branch of the search fails the backtracking search algorithm back up to the preceding variable and try a different value for it. So here … …Journal of Computer Science, Vol. 10, Issue 10 · 22 May 2014 · 6,942 accessesView PDF Cite