Abstract
We have developed a logic grammar for circuit analysis. Circuits are viewed as sentences, and their elements as words. Circuit structures are defined by logic grammar called DCSG. A set of grammar rules, when converted into Prolog clauses, forms a logic program which execute top-down parsing. When we apply our methods to fundamental circuit analysis, problems of recursive definition occur. Recursive definitions often cause looping problems in logic programming. We will discusses several problems of recursive definition in circuit analysis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Greibach, S.A.: A New Normal Form Theorem for Context-Free Phrase Structure Grammars. JACM 12, 42–52 (1965)
Pereira, F.C.N., Warren, D.H.D.: Definite Clause Grammars for Language Analysis. Artificial Intell. 13, 231–278 (1980)
Tanaka, T.: Definite Clause Set Grammars: A Formalism for Problem Solving. J. Logic Programming 10, 1–17 (1991)
Tanaka, T.: Parsing Circuit Topology in A Logic Grammar. IEEE-Trans. Knowledge and Data Eng. 5(2), 225–239 (1993)
Tanaka, T., Bartenstein, O.: DCSG-Converters in Yacc/Lex and Prolog. In: Proc. 12th International Conference on Applications of Prolog, pp. 44–49 (1999)
101 Analog IC Designs: Interdesign Inc., Sunnyvale, CA (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tanaka, T. (2007). A Logic Grammar for Circuit Analysis. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74827-4_107
Download citation
DOI: https://doi.org/10.1007/978-3-540-74827-4_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74826-7
Online ISBN: 978-3-540-74827-4
eBook Packages: Computer ScienceComputer Science (R0)