Boolean satisfiability (SAT) is of central importance in many areas of Operations Research and Computer Science. In its general (conjunctive normal) form, the problem can be stated as follows. There is a number of Boolean (binary) variables generically called “literals,” and a number of covertype constraints implicitly defined over these variables, called “clauses.” Pairs of the literals may be...

Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzl...

Traditional incremental SAT solvers have achieved great success in the domain of Bounded Model Checking (BMC). However, modern solvers depend on advanced preprocessing procedures to obtain high levels of performance. Unfortunately, many preprocessing techniques such as a variable and (blocked) clause elimination cannot be directly used in an incremental manner. This work focuses on extending th...

OBJECTIVE The expansion of adipose tissue is linked to the development of its vasculature. However, the regulation of adipose tissue angiogenesis in humans has not been extensively studied. Our aim was to compare the angiogenesis associated with subcutaneous adipose tissue (SAT) and visceral adipose tissue (VAT) from the same obese patients in an in vivo model. RESEARCH DESIGN AND METHODS Adi...

Consider SAT, the prototypical example of an NP-complete problem. An instance of this problem consists of a Boolean function f (x1, . . . ,xn) = c1 ∧ . . .∧ cm; the SAT problem asks you to determine whether there exists a satisfying assignment—that is, an input (a1, . . . ,an) such that f (a1, . . . ,an) = 1. UNIQUE-SAT is a variant of SAT that poses the same problem with the restriction that f...

Constraint satisfaction deals with developing automated techniques for solving computationally hard problems in a declarative fashion. The main emphasis of this thesis is on constraint satisfaction techniques for the propositional satisfiability problem (SAT). As solving techniques for propositional satisfiability have rapidly progressed during the last 15 years, implementations of decision pro...

Mobile Food Ordering Apps (MFOAs) programs have changed the way consumers order and consume food. are widely recognized in restaurant industry as an innovative method of serving customers; however, there important questions about impact implementing MFOAs on customers’ willingness to reuse such applications, several studies examined results using from a customer perspective. The main objective ...

NUSMV is a symbolic model checker originated from the reengineering, reimplementation and extension of SMV [11], version 2.4.4 (SMV from now on). NUSMV has been designed to be applicable in technology transfer projects: it is a well structured, open, flexible and documented platform for model checking, and is robust and close to industrial systems standards. This paper describes the new version...

Reductions in the capacity of the human choline transporter (SLC5A7, CHT) have been hypothesized to diminish cortical cholinergic neurotransmission, leading to risk for cognitive and mood disorders. To determine the acetylcholine (ACh) release capacity of cortical cholinergic projections in a mouse model of cholinergic hypofunction, the CHT+/- mouse, we assessed extracellular ACh levels while m...

We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT. Tools from graph structure theory, in particular treewidth, have been used to successfully identify tractable cases in many subfields of AI, including SAT, Constraint Satisfaction Problems (CSP), Bayesian reasoning, and planning. In this paper we attack #SAT and MaxSAT using similar, but mo...