ML Anthology

Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness

Thomas Ellman
IJCAI 1985 pp. 643-646
doi:10.7916/D8C254FH /ijcai/1985/ellman1985ijcai-generalizing/

Abstract

This paper presents a method of learning to solve design problems by generalizing examples. The technique has been developed in the domain of logic circuit design. It involves the use of domain knowledge to analyze examples and produce generalized circuit designs. The method utilizes proofs of design correctness to guide the process of generalization. Our approach is illustrated by showing it can generalize a circular shift register into a schema describing devices capable of computing arbitrary permutations.

PDF Semantic Scholar

Cite

Text

Ellman. "Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness." International Joint Conference on Artificial Intelligence, 1985. doi:10.7916/D8C254FH

Markdown

[Ellman. "Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness." International Joint Conference on Artificial Intelligence, 1985.](https://mlanthology.org/ijcai/1985/ellman1985ijcai-generalizing/) doi:10.7916/D8C254FH

BibTeX

@inproceedings{ellman1985ijcai-generalizing,
  title     = {{Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness}},
  author    = {Ellman, Thomas},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1985},
  pages     = {643-646},
  doi       = {10.7916/D8C254FH},
  url       = {https://mlanthology.org/ijcai/1985/ellman1985ijcai-generalizing/}
}