ML Anthology

Boundaries of Operationality

Michael S. Braverman, Stuart J. Russell
ICML 1988 pp. 221-234
doi:10.1016/B978-0-934613-64-4.50029-3 /icml/1988/braverman1988icml-boundaries/

Abstract

The IMEX algorithm was introduced by the authors to handle explanation-based learning (EBL) in intractable domains. A key concept for the algorithm is the boundary of operationality, which marks the most appropriate level of generalization in an explanation structure. Finding this boundary is therefore the central task in all EBL systems. We give algorithms to solve this task under several different assumptions, showing that it is crucially connected to a property of the operationality conditions that we call locality.

ICML Semantic Scholar

Cite

Text

Braverman and Russell. "Boundaries of Operationality." International Conference on Machine Learning, 1988. doi:10.1016/B978-0-934613-64-4.50029-3

Markdown

[Braverman and Russell. "Boundaries of Operationality." International Conference on Machine Learning, 1988.](https://mlanthology.org/icml/1988/braverman1988icml-boundaries/) doi:10.1016/B978-0-934613-64-4.50029-3

BibTeX

@inproceedings{braverman1988icml-boundaries,
  title     = {{Boundaries of Operationality}},
  author    = {Braverman, Michael S. and Russell, Stuart J.},
  booktitle = {International Conference on Machine Learning},
  year      = {1988},
  pages     = {221-234},
  doi       = {10.1016/B978-0-934613-64-4.50029-3},
  url       = {https://mlanthology.org/icml/1988/braverman1988icml-boundaries/}
}