Parsing Circuit Topology in a Deductive System

Tanaka, Takushi

Parsing Circuit Topology in a Deductive System

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Expert Systems. Pages 407-409.

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.

Takushi Tanaka. 1985. Parsing Circuit Topology in a Deductive System. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 407–409. https://ijcai.org/proceedings/1985/77

@inproceedings{ijcai1985p77,
  title     = {Parsing Circuit Topology in a Deductive System},
  author    = {Tanaka, Takushi},
  booktitle = {Proceedings of the Ninth International Joint Conference on
               Artificial Intelligence, {IJCAI-85}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Aravind Joshi},
  pages     = {407--409},
  year      = {1985},
  note      = {Expert Systems},
  url       = {https://ijcai.org/proceedings/1985/77},
}

TY  - CPAPER
TI  - Parsing Circuit Topology in a Deductive System
AU  - Tanaka, Takushi
T2  - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1985
SP  - 407
EP  - 409
UR  - https://ijcai.org/proceedings/1985/77
ER  -