2017•Lecture notes in computer scienceOpen access

On Tackling the Limits of Resolution in SAT Solving

Alexey Ignatiev, António Morgado, João Marques‐Silva

Open full text 0 citations

Abstract

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

Open-access reader

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: Pigeonhole principle, Conjunctive normal form, Maximum satisfiability problem, Satisfiability, Boolean satisfiability problem, Mathematical proof, Resolution (logic), True quantified Boolean formula

Back to paper search Browse research topics Original source

On Tackling the Limits of Resolution in SAT Solving — Research Paper | ScholarLens