Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness

Ellman, Thomas

Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Learning and Acquisition. Pages 643-645.

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 rotational shift register into a schema describing devices capable of computing arbitrary permutations.

Thomas Ellman. 1985. Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 643–645. https://ijcai.org/proceedings/1985/125

@inproceedings{ijcai1985p125,
  title     = {Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness},
  author    = {Ellman, Thomas},
  booktitle = {Proceedings of the Ninth International Joint Conference on
               Artificial Intelligence, {IJCAI-85}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Aravind Joshi},
  pages     = {643--645},
  year      = {1985},
  note      = {Learning and Acquisition},
  url       = {https://ijcai.org/proceedings/1985/125},
}

TY  - CPAPER
TI  - Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness
AU  - Ellman, Thomas
T2  - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1985
SP  - 643
EP  - 645
UR  - https://ijcai.org/proceedings/1985/125
ER  -