ML Anthology

Counting Models Using Extension Rules

Minghao Yin, Hai Lin, Jigui Sun
AAAI 2007 pp. 1916-1917
/aaai/2007/yin2007aaai-counting/

Abstract

In recent years we have viewed tremendous improvements in the field of Propositional satisfiability (SAT). Many NPcomplete problems from a variety of domains, such as classic planning problems (Kautz 1999), have been

PDF AAAI Semantic Scholar

Cite

Text

Yin et al. "Counting Models Using Extension Rules." AAAI Conference on Artificial Intelligence, 2007.

Markdown

[Yin et al. "Counting Models Using Extension Rules." AAAI Conference on Artificial Intelligence, 2007.](https://mlanthology.org/aaai/2007/yin2007aaai-counting/)

BibTeX

@inproceedings{yin2007aaai-counting,
  title     = {{Counting Models Using Extension Rules}},
  author    = {Yin, Minghao and Lin, Hai and Sun, Jigui},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2007},
  pages     = {1916-1917},
  url       = {https://mlanthology.org/aaai/2007/yin2007aaai-counting/}
}