Results 201 to 210 of about 133,438 (232)
Some of the next articles are maybe not open access.
Programming with Boolean Satisfaction
2012In recent years, research on Boolean satisfiability (SAT) is generating remarkably powerful SAT solvers capable of handling larger and larger SAT instances. With the availability of progressively stronger SAT solvers, an accumulating number of applications have been developed which demonstrate that real world problems can often be solved by encoding ...
openaire +1 more source
Scalable program analysis using Boolean satisfiability
Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings., 2006Summary form only given. Static program analysis suffers from a fundamental trade-off between precision and scalability, and the analyses that scale to the largest programs are generally not the most precise methods known. This talk describes how recent advances in algorithms for solving instances of Boolean satisfiability (SAT) can be exploited to ...
openaire +1 more source
CTL Model Checking for Boolean Program
2006Nowadays, there are some subtle errors in a software system. So verification technique is very important. The one of important verification technique is model checking technique. Model checking is a technique to verify behavior of system with desired property. There are many researches about software model checking.
Taehoon Lee, Gihwon Kwon, Hyuksoo Han
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
Linear Programming Formulation of Boolean Satisfiability Problem
2013It was investigated the Boolean satisfiability (SAT) problem defined as follows: given a Boolean formula, check whether an assignment of Boolean values to the propositional variables in the formula exists, such that the formula evaluates to true. If such an assignment exists, the formula is said to be satisfiable; otherwise, it is unsatisfiable.
openaire +1 more source
Pseudo-Boolean Programming for Bivalent Optimization
1973This thesis introduces an effective computational algorithm making use of Boolean algebra for solving bivalent optimization problems with linear and nonlinear constraints. This method is a combination of the algorithm suggested by Hammer and the branch and bound method.
openaire +1 more source
Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma
Ca-A Cancer Journal for Clinicians, 2020Aaron J Grossberg +2 more
exaly
Oral complications of cancer and cancer therapy
Ca-A Cancer Journal for Clinicians, 2012Joel B Epstein +2 more
exaly