Unit propagation

Known as: Unit clause 
Unit propagation (UP) or Boolean Constraint propagation or the one-literal rule (OLR) is a procedure of automated theorem proving that can simplify a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1957-2018
0204019572017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Some aspects of the result of applying unit resolution on a cnf formula can be formalized as functions with domain a set of… (More)
  • figure A.1
  • figure A.2
  • figure A.3
Is this relevant?
2011
2011
A grounding of a formulaφ over a given finite domain is a ground formula which is equivalent toφ on that domain. Very effective… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2011
2011
This work extends early work about parallel unit propagation in SAT solvers. Since CSP solvers use SAT solvers as backend… (More)
  • figure 1
  • figure 4
  • table 1
Is this relevant?
2007
2007
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Constraint reasoning involves various types of techniques to tackle the inherent intractability of the problem of satisfying a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Computational approaches to Satisfiability Checking (SAT) and Answer Set Programming (ASP) have many aspects in common. In fact… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
One of the best SAT solvers for random 3-SAT formulae, SATZ, is based on a heuristic called unit propagation lookahead (UPL… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The paper studies new unit propagation based heuristics for Davis-Putnam-Loveland (DPL) procedure. These are the novel… (More)
  • figure 4
  • figure 5
  • figure 6
  • table 2
  • table 1
Is this relevant?
Highly Cited
1986
Highly Cited
1986
An algorithm for the 3-Satissability problem is presented and a probabilistic analysis is performed. The analysis is based on an… (More)
Is this relevant?
Highly Cited
1974
Highly Cited
1974
The key concepts for this automated theorem-proving paper are those of Horn set and strictly-unit refutation. A Horn set is a set… (More)
Is this relevant?