The objective of this study is to develop land cover classification algorithm suited for the eastern Asia by using multi-temporal MODIS land reflectance products; Surface Reflectance 8-Day L3 product and Nadir BRDF-Adjusted Reflectance 16-Day L3 product. In this study, land cover maps derived from these two kinds of source data products are generated and compared. Time-domain co-occurrence matr...

Many mathematical and practical problems can be expressed as constraint satisfaction problems (CSPs). The general CSP is known to be NP-complete, but many different conditions have been identified which are sufficient to ensure that classes of instances satisfying those conditions are tractable, that is, solvable in polynomial time [1–4, 7]. The increasing efficiency of SAT-solvers has led to t...

Recent advances in SAT are focused on efficiently solving real-world or industrial problems. However, the reduced number of industrial SAT instances and the high cost of solving them condition the development and debugging processes of new techniques. This problem can be solved by defining new models of random SAT instance that capture realistically the main features of the real-world SAT insta...

Usage of SAT methods in Formal Verification is increasing [1]. Recently several preprocessors for SAT instances have been proposed [2], [3], [4]. Few of them have shown successes in some Formal Verification problems like Bounded Model Checking (BMC) and Equivalence Checking. As far as we know, none of them have been successful in reducing the complexity of microprocessor verification SAT instan...

We present Regular-SAT, an extension of Boolean Satisfiability based on a class of many-valued CNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT results and apply them to Regular-SAT. In addition, Regular-SAT has a number of advantages over Boolean SAT. Most importantly, it produces more compact encodings that capture pro...

While there has been very substantial progress in practical algorithms for satisfiability, there are many related logical problems where satisfiability alone is not enough. One particularly useful extension to satisfiability is the associated counting problem, #SAT, which requires computing the number of assignments that satisfy the input formula. #SAT’s practical importance stems in part from ...

We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch paradigm (cf. [9]): randomly guess an initial assignment and then, guided by those clauses (constraints) that are not satisfied, by successively choosing a random literal from such a clause and flipping the corresponding...