Parsing Circuit Topology in a Deductive System
Abstract
As a step toward automatic circuit understanding, we have developed a method for parsing circuit topology in a deductive system called Duck. A circuit is viewed as a sentence and its elements as words. Generating circuits with specific functions is represented by deductive rules analogous to definite clause grammars. Using those rules, an object circuit is decomposed into a parse tree of functional blocks in terms of logic programming.
Cite
Text
Tanaka. "Parsing Circuit Topology in a Deductive System." International Joint Conference on Artificial Intelligence, 1985.Markdown
[Tanaka. "Parsing Circuit Topology in a Deductive System." International Joint Conference on Artificial Intelligence, 1985.](https://mlanthology.org/ijcai/1985/tanaka1985ijcai-parsing/)BibTeX
@inproceedings{tanaka1985ijcai-parsing,
title = {{Parsing Circuit Topology in a Deductive System}},
author = {Tanaka, Takushi},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1985},
pages = {407-410},
url = {https://mlanthology.org/ijcai/1985/tanaka1985ijcai-parsing/}
}