Výsledky vyhľadávania - Logic programming DPLL procedure

Enhancing and Evaluating the Product Fuzzy DPLL Solver Autor Uhliarik, Ivor

“…) evolutionary algorithms, and (3) fuzzy generalizations of classical-logic procedures, such as hyperresolution or the Davis–Putnam–Logemann–Loveland (DPLL) procedure…”
Získať plný text

Cutting to the Chase: Solving Linear Integer Arithmetic Autor Jovanović, Dejan, de Moura, Leonardo

“…We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using…”
Získať plný text

EHSAT: an efficient RTL satisfiability solver using an extended DPLL procedure Autor Deng, Shujun, Bian, Jinian, Wu, Weimin, Yang, Xiaoqing, Zhao, Yanni

“… The main framework is the extended Davis-Putnam-Logemann-Loveland procedure (DPLL) which is a unified procedure combining Boolean logic and arithmetic operations…”
Získať plný text

MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability Autor Xing, Zhao, Zhang, Weixiong

“… A branch and bound algorithm based on the Davis–Putnam–Logemann–Loveland procedure (DPLL) is one of the most competitive exact algorithms for solving max-SAT…”
Získať plný text

Formalization and Implementation of Modern SAT Solvers Autor Maric, Filip

“…Most, if not all, state-of-the-art complete SAT solvers are complex variations of the DPLL procedure described in the early 1960…”
Získať plný text

Deciding floating-point logic with abstract conflict driven clause learning Autor Brain, Martin, D’Silva, Vijay, Griggio, Alberto, Haller, Leopold, Kroening, Daniel

“…We present a bit-precise decision procedure for the theory of floating-point arithmetic…”
Získať plný text

Abstract answer set solvers with backjumping and learning Autor LIERLER, YULIYA

“…Nieuwenhuis et al. (2006. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL…”
Získať plný text

Reasoning with Finite Sets and Cardinality Constraints in SMT Autor Bansal, Kshitij, Barrett, Clark, Reynolds, Andrew, Tinelli, Cesare

“… Sets are a common high-level data structure used in programming; thus, such a theory is useful for modeling program constructs directly…”
Získať plný text

An efficient finite-domain constraint solver for circuits Autor Parthasarathy, G., Iyer, M. K., Cheng, K.-T., Wang, L.-C.

“… We describe how DPLL search can be modified by using efficient finite-domain constraint propagation to improve communication between interacting integer and Boolean domains…”
Získať plný text

Preface Autor DOVIER, AGOSTINO

“… = THREE puzzle appeared in Strand Magazine in 1924. These puzzles are nowadays widely used in constraint programming courses…”
Získať plný text

Preface Autor DOVIER, AGOSTINO

“… = THREE puzzle appeared in Strand Magazine in 1924. These puzzles are nowadays widely used in constraint programming courses…”
Získať plný text

Preface Autor DOVIER, AGOSTINO

“… = THREE puzzle appeared in Strand Magazine in 1924. These puzzles are nowadays widely used in constraint programming courses…”
Získať plný text

Reasoning with Finite Sets and Cardinality Constraints in SMT Autor Bansal, Kshitij, Barrett, Clark, Reynolds, Andrew, Tinelli, Cesare

“… Sets are a common high-level data structure used in programming; thus, such a theory is useful for modeling program constructs directly…”
Získať plný text

RTSAT: A Hybrid Satisfiability Solver for RTL Circuits Autor Shujun Deng, Weimin Wu, Jinian Bian

“… Boolean DPLL algorithm is extended into a unified procedure to solve the hybrid constraints combining the Boolean logic and arithmetic operations, and an efficient modeling method of RTL circuits is adopted…”
Získať plný text