On the complexity of choosing the branching literal in DPLL
type: Item
instance of: scholarly article
title: On the complexity of choosing the branching literal in DPLL
zbMATH Open document ID: 0939.68646
DOI: 10.1016/S0004-3702(99)00097-1
author: Paolo Liberatore
published in: Artificial Intelligence
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1454128
zbMATH Keywords: Davis-Putnam
zbMATH Keywords: complexity
zbMATH Keywords: propositional satisfiability
MaRDI profile type: Publication
cites work: Q4152212
cites work: Q5687266
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Branching rules for satisfiability
cites work: Solving propositional satisfiability problems
cites work: How good are branching rules in DPLL?
cites work: Q5604434
full work available at URL: s0004-3702(99)00097-1
OpenAlex ID: W2057832617
description: scientific article; zbMATH DE number 1454128