Skip to main content
SpringerLink
Log in

A Mechanism for Converting Circuit Grammars to Definite Clauses

  • Conference paper
Knowledge-Based and Intelligent Information and Engineering Systems (KES 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6278))

  • 1289 Accesses

Abstract

The circuit grammar is a logic grammar developed for knowledge representation of electronic circuits. Knowledge of circuit structures and their functions are coded as grammar rules. Those grammar rules, when converted into definite clauses, form a logic program that can parse given circuits and derive their electrical behavior. This paper shows a mechanism for converting circuit grammar rules into definite clauses.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pereira, F.C.N., Warren, D.H.D.: Definite Clause Grammars for Language Analysis. Artificial Intell. 13, 231–278 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  2. Tanaka, T.: Definite Clause Set Grammars: A Formalism for Problem Solving. J. Logic Programming 10, 1–17 (1991)

    Article  MathSciNet  Google Scholar 

  3. Tanaka, T., Bartenstein, O.: DCSG-Converters in Yacc/Lex and Prolog. In: Proc. 12th Int. Conference on Applications of Prolog, pp. 44–49 (1999)

    Google Scholar 

  4. Tanaka, T.: A Logic Grammar for Circuit Analysis - Problems of Recursive Definition. In: Apolloni, et al. (eds.) KES 2007, Part II. LNCS (LNAI), vol. 4693, pp. 852–860. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Tanaka, T.: Circuit grammar: knowledge representation for structure and function of electronic circuits. Int. J. Reasoning-based Intelligent Systems 1, 56–67 (2009)

    Article  Google Scholar 

  6. Tanaka, T.: Deriving Electrical Dependencies from Circuit Topologies Using Logic Grammar. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds.) KES 2009. LNCS, vol. 5712, pp. 325–332. Springer, Heidelberg (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Fukuoka Institute of Technology, 3-30-1 Wajiro-Higashi Higashi-ku, Fukuoka, 811-0295, Japan

    Takushi Tanaka

Authors
  1. Takushi Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, Cardiff University, The Parade, CF24 3AA, Cardiff, UK

    Rossitza Setchi

  2. Dept. of Computer Science and Software Engineering, University of Portsmouth, BUckingham Building, Lion Terrace, PO1 3HE, Portsmouth, UK

    Ivan Jordanov

  3. KES International, 145-157 St. John Street, EC1V 4PY, London, UK

    Robert J. Howlett

  4. School of Electrical and Information Engineering, University of South Australia, Adelaide, Mawson Lakes Campus, 5095, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tanaka, T. (2010). A Mechanism for Converting Circuit Grammars to Definite Clauses. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15393-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15393-8_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15392-1

  • Online ISBN: 978-3-642-15393-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation