Foundations Equational Logic Programming by Hölldobler Steffen (6 results)

Author
Title
Refine with Advanced Search

Refine your search

  • Books (6)

to

Custom price range (£)

to

  • Language: English

    Published by Springer, 1989

    354051533X / 9783540515333

    • Softcover

    Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections

    5-star seller
    Contact seller

    Condition: New

    £ 35.44

    £ 9.37 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: Over 20 available

    Condition: New. In English.

  • Language: English

    Published by Springer, 1989

    354051533X / 9783540515333

    • Softcover

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    £ 48.78

    £ 26.15 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories.

  • Language: English

    Published by Springer, 1989

    354051533X / 9783540515333

    • Softcover

    Seller: Mispah books, Redhill, SURRE, United KingdomMispah books

    4-star seller
    Contact seller

    Condition: Used - As new

    £ 71.00

    £ 25.00 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 1 available

    Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

  • Language: English

    Published by Springer Berlin Heidelberg Okt 1989, 1989

    354051533X / 9783540515333

    • Softcover
    • Print on Demand

    Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.

    5-star seller
    Contact seller

    Condition: New

    £ 33.07

    £ 19.72 shipping 
    Ships from Germany to U.S.A.

    Quantity: 2 available

    Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories. 264 pp. Englisch.

  • Language: English

    Published by Springer Berlin Heidelberg, 1989

    354051533X / 9783540515333

    • Softcover
    • Print on Demand

    Seller: moluna, Greven, Germanymoluna

    5-star seller
    Contact seller

    Condition: New

    £ 31.09

    £ 42.01 shipping 
    Ships from Germany to U.S.A.

    Quantity: Over 20 available

    Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational l.

  • Language: English

    Published by Springer, Springer Okt 1989, 1989

    354051533X / 9783540515333

    • Softcover
    • Print on Demand

    Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

    5-star seller
    Contact seller

    Condition: New

    £ 33.07

    £ 51.45 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 264 pp. Englisch.