Search Sciweavers | Sciweavers

168 search results - page 2 / 34

» On Models for Quantified Boolean Formulas

click to vote

SAT
2005
Springer

123views Hardware» more SAT 2005»

Bounded Model Checking with QBF

14 years 2 months ago

Download www.cs.tau.ac.il

Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...

Nachum Dershowitz, Ziyad Hanna, Jacob Katz

claim paper

Read More »

click to vote

AAAI
2000

111views Intelligent Agents» more AAAI 2000»

Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas

13 years 10 months ago

Download www.aaai.org

We consider the compilation of different reasoning tasks into the evaluation problem of quantified boolean formulas (QBFs) as an approach to develop prototype reasoning systems us...

Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltr...

claim paper

Read More »

click to vote

JSAT
2006

126views more JSAT 2006»

Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages

13 years 8 months ago

Download jsat.ewi.tudelft.nl

Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...

Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...

claim paper

Read More »

click to vote

FROCOS
2009
Springer

123views Control Systems» more FROCOS 2009»

Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas

14 years 3 months ago