DPLL

Results: 52



#Item
1Theoretical computer science / Mathematical logic / Mathematics / Formal methods / Logic in computer science / Automated theorem proving / Constraint programming / Electronic design automation / Conflict-driven clause learning / Satisfiability modulo theories / Boolean satisfiability problem / Unit propagation

Challenges in Satisfiability Modulo Theories Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio? Abstract. Here we give a short overview of the DPLL(T ) approach to Satisfiability Modulo

Add to Reading List

Source URL: www.lsi.upc.edu

Language: English - Date: 2007-09-19 06:11:44
2Theoretical computer science / Mathematical logic / Mathematics / Automated theorem proving / Boolean algebra / Constraint programming / Logic in computer science / Formal methods / DPLL algorithm / Conflict-driven clause learning / Boolean satisfiability problem / Satisfiability modulo theories

Abstract DPLL and Abstract DPLL Modulo Theories Robert Nieuwenhuis? , Albert Oliveras? , and Cesare Tinelli ??

Add to Reading List

Source URL: www.lsi.upc.edu

Language: English - Date: 2005-01-28 04:06:06
3Theoretical computer science / Mathematics / Mathematical logic / Boolean algebra / Formal methods / Logic in computer science / Electronic design automation / NP-complete problems / Boolean satisfiability problem / Satisfiability modulo theories / Unit propagation / Literal

DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic Robert Nieuwenhuis and Albert Oliveras? Abstract. At CAV’04 we presented the DPLL(T ) approach for satisfiability modulo theories T . I

Add to Reading List

Source URL: www.lsi.upc.edu

Language: English - Date: 2005-06-14 03:44:48
4Theoretical computer science / Mathematical logic / Mathematics / Constraint programming / Automated theorem proving / Logic in computer science / Formal methods / Propositional calculus / Satisfiability modulo theories / DPLL algorithm / Unit propagation / Solver

Splitting on Demand in SAT Modulo Theories Clark Barrett? , Robert Nieuwenhuis?? , Albert Oliveras??, and Cesare Tinelli? ? ? Abstract. Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-base

Add to Reading List

Source URL: www.lsi.upc.edu

Language: English - Date: 2006-07-31 08:38:18
5Theoretical computer science / Mathematical logic / Mathematics / Formal methods / Logic in computer science / Computability theory / Electronic design automation / NP-complete problems / Satisfiability modulo theories / Solver / Entscheidungsproblem / Decidability

SMT Beyond DPLL(T): A New Approach to Theory Solvers and Theory Combination by Dejan Jovanovi´c

Add to Reading List

Source URL: csl.sri.com

Language: English - Date: 2014-06-28 01:48:55
6Theoretical computer science / Mathematics / Computational complexity theory / Formal methods / Electronic design automation / Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / DPLL / Phase-locked loop / Satisfiability

Abstract DPLL and Abstract DPLL Modulo Theories Robert Nieuwenhuis1 , Albert Oliveras1 , and Cesare Tinelli2 1 Technical University of Catalonia

Add to Reading List

Source URL: www.lsi.upc.edu

Language: English - Date: 2005-03-21 16:24:36
7Theoretical computer science / Mathematical logic / Automated theorem proving / Mathematics / Logic in computer science / Propositional calculus / Constraint programming / DPLL algorithm / Logic programming / Boolean satisfiability problem / Unsatisfiable core / Maximum satisfiability problem

Efficient Generation of Unsatisfiability Proofs and Cores in SAT Roberto As´ın, Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell? Abstract. Some modern DPLL-based propositional SAT solvers now have fas

Add to Reading List

Source URL: www.lsi.upc.edu

Language: English - Date: 2008-09-01 09:50:28
8

A Concurrency Problem with Exponential DPLL(T ) Proofs Liana Hadarean1 Alex Horn1

Add to Reading List

Source URL: forsyte.at

- Date: 2015-06-25 07:24:44
    9Theoretical computer science / Computational complexity theory / Mathematics / Constraint programming / Numerical software / Automated theorem proving / DPLL algorithm / Packing problems / Solver / Constraint satisfaction / Reduction / Algorithm

    A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1

    Add to Reading List

    Source URL: ceur-ws.org

    Language: English - Date: 2008-12-04 03:03:05
    10Theoretical computer science / Logic in computer science / Mathematics / Maximum satisfiability problem / Boolean satisfiability problem / DPLL algorithm

    Solving Satisfiability Problems with Qualitative Preferences: a New Approach Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea DIST - Universit`a di Genova, Italy. email:{emanuele,enrico,marco}@dist.unige.it Abstra

    Add to Reading List

    Source URL: tmancini.di.uniroma1.it

    Language: English - Date: 2008-12-16 11:05:58
    UPDATE