2008•Springer eBooksRequires access

Theory and applications of satisfiability testing - SAT 2008 : 11th international conference, SAT 2008 Guangzhou, China, May 12-15, 2008 : proceedings

Hans Kleine Büning, Xishun Zhao

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Conjunctive normal form, DPLL algorithm, Boolean satisfiability problem, Satisfiability, Computer science, Maximum satisfiability problem, Propositional calculus, Theoretical computer science

Back to paper search Browse research topics Original source

Theory and applications of satisfiability testing - SAT 2008 : 11th international conference, SAT 2008 Guangzhou, China, May 12-15, 2008 : proceedings — Research Paper | ScholarLens