• DocumentCode
    2436539
  • Title

    Improvements on the evaluation of declarative specifications

  • Author

    Dietrich, Suzanne Wagner

  • Author_Institution
    Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA
  • fYear
    1989
  • fDate
    22-24 March 1989
  • Firstpage
    606
  • Lastpage
    610
  • Abstract
    ET is a complete evaluation strategy for pure logic programs. The ET algorithm is an essentially depth-first strategy that uses extension tables, which save the answers of selected predicates, to evaluate (recursive) declarative specifications. The implementation of the ET algorithm in Prolog is straightforward and easily modifiable. The author presents variations of the ET algorithm that, under certain assumptions, improve the evaluation of declarative specifications.<>
  • Keywords
    PROLOG; logic programming; specification languages; ET algorithm; Prolog; declarative specifications; depth-first strategy; extension tables; pure logic programs; Computer science; Control systems; Costs; Data structures; Educational institutions; Logic programming; Performance evaluation; Programming profession; Prototypes; Superluminescent diodes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computers and Communications, 1989. Conference Proceedings., Eighth Annual International Phoenix Conference on
  • Conference_Location
    Scottsdale, AZ, USA
  • Print_ISBN
    0-8186-1918-x
  • Type

    conf

  • DOI
    10.1109/PCCC.1989.37454
  • Filename
    37454
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2436539