ML Anthology

Fast Theta-Subsumption with Constraint Satisfaction Algorithms

Jérôme Maloberti, Michèle Sebag
MLJ 2004 pp. 137-174
doi:10.1023/B:MACH.0000023150.80092.40 /mlj/2004/maloberti2004mlj-fast/
PDF MLJ Semantic Scholar

Cite

Text

Maloberti and Sebag. "Fast Theta-Subsumption with Constraint Satisfaction Algorithms." Machine Learning, 2004. doi:10.1023/B:MACH.0000023150.80092.40

Markdown

[Maloberti and Sebag. "Fast Theta-Subsumption with Constraint Satisfaction Algorithms." Machine Learning, 2004.](https://mlanthology.org/mlj/2004/maloberti2004mlj-fast/) doi:10.1023/B:MACH.0000023150.80092.40

BibTeX

@article{maloberti2004mlj-fast,
  title     = {{Fast Theta-Subsumption with Constraint Satisfaction Algorithms}},
  author    = {Maloberti, Jérôme and Sebag, Michèle},
  journal   = {Machine Learning},
  year      = {2004},
  pages     = {137-174},
  doi       = {10.1023/B:MACH.0000023150.80092.40},
  volume    = {55},
  url       = {https://mlanthology.org/mlj/2004/maloberti2004mlj-fast/}
}