Constraint Propagation as a Proof System

@inproceedings{Atserias2004ConstraintPA,
  title={Constraint Propagation as a Proof System},
  author={Albert Atserias and Phokion G. Kolaitis and Moshe Y. Vardi},
  booktitle={CP},
  year={2004}
}
Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalization lifts, in a uniform way, the concept of refutation from Boolean satisfiability problems to general constraint-satisfaction problems. On the one hand, this enables us to study and characterize basic concepts, such as refutation width, using tools from finite-model theory. On the other hand, this enables us to introduce new… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
39 Citations
46 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 39 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 46 references

On the complexity of derivation in propositional calculus , pages 115 – 125

  • G. S. Tseitin
  • 2004

Search vs

  • G. Pan, M. Y. Vardi
  • symbolic techniques in satisfiability solving. To…
  • 2004
1 Excerpt

In Computer Science Logic ’2003

  • Ph. G. Kolaitis, J. Panttaja. On the complexity of existential pebble games
  • 17th Annual Conference of the EACSL, volume 2803…
  • 2003
1 Excerpt

Ph

  • V. Dalmau
  • G. Kolaitis, and M. Y. Vardi. Constraint…
  • 2002

Satisfiability

  • M. Alekhnovich, A. Razborov
  • branch-width and Tseitin tautologies. In 43rd…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…