By Topic

A Grammatical View of Logic Programming

Cover Image Copyright Year: 2003
Author(s): Deransart, P.; Maluszy¿ski, J.
Publisher: MIT Press
Content Type : Books & eBooks
Topics: Computing & Processing (Hardware/Software)
  • Print

Abstract

Within the field of logic programming there have been numerous attempts to transform grammars into logic programs. This book describes a complementary approach that views logic programs as grammars and shows how this new presentation of the foundations of logic programming, based on the notion of proof trees, can enrich the field.The authors' approach facilitates discussion of grammatical aspects of, and introduces new kinds of semantics for, definite programs. They survey relevant grammatical formalisms and provide a comprehensive introduction to the well-known attribute grammars and van Wijngaarden grammars. A formal comparison of definite programs to these grammars allows the authors to identify interesting grammatical concepts.The book also includes a presentation of verification methods for definite programs derived from verification methods for attribute grammars, and an analysis of the occur-check problem as an example of how the grammatical view of logic programming can be applied.Pierre Deransart is Research Director at INRIA-Rocquencourt, Le Chesnay Cedex, France. Jan Maluszynski is Professor in the Department of Computer and Information Science at Linköping University, Sweden.Contents: Preliminaries. Foundations. Grammatical Extensions of Logic Programs. Attribute Grammars. Attribute Grammars and Logic Programming. Proof Methods. Study of Declarative Properties. The Occur-check Problem.

  •   Click to expandTable of Contents

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Front Matter

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): i - xxxi
      Copyright Year: 2003

      MIT Press eBook Chapters

      This chapter contains sections titled: Half Title, Title, Copyright, Contents, List of Figures, List of Tables, Series Foreword, Foreword by J.H. Gallier, Preface View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Preliminaries

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 1 - 23
      Copyright Year: 2003

      MIT Press eBook Chapters

      This chapter contains sections titled: Relations, Formal languages and context-free grammars, Algebras and terms, Many-sorted algebras, Context-free grammars seen as algebras, Equations and substitutions, Algebraic structures and logical formulae View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Foundations of Logic Programming

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 25 - 108
      Copyright Year: 2003

      MIT Press eBook Chapters

      This chapter contains sections titled: Syntactic notions, Semantics of definite programs, Summary and bibliographical comments View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Grammatical Extensions of Logic Programs

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 109 - 140
      Copyright Year: 2003

      MIT Press eBook Chapters

      This chapter contains sections titled: W-grammars, Definite clause grammars, Bibliographical comments View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Attribute Grammars

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 141 - 202
      Copyright Year: 2003

      MIT Press eBook Chapters

      This chapter contains sections titled: Informal introduction, Definitions of attribute grammars, Attribute dependency schemes, Proof methods for partial correctness, Proof methods for decorated parse trees, Proof methods for completeness, Some remarks, Bibliographical comments View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Attribute Grammars and Logic Programming

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 203 - 269
      Copyright Year: 2003

      MIT Press eBook Chapters

      This chapter contains sections titled: From definite programs to attribute grammars with the declarative semantics, Attribute dependency schemes for definite programs, Modelling the operational semantics by attribute grammars, From functional attribute grammars to definite programs, Bibliographical comments View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Proof Methods for Definite Programs

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 271 - 319
      Copyright Year: 2003

      MIT Press eBook Chapters

      This chapter contains sections titled: Introduction, Verification of programs with respect to the declarative semantics, Verification of programs with respect to the unification semantics, Verification of run-time properties, Discussion and bibliographical comments View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Proof Methods for Partial Correctness of Definite Programs

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 321 - 385
      Copyright Year: 2003

      MIT Press eBook Chapters

      This chapter contains sections titled: Introduction, The inductive proof method, Proof method with annotation, An extended example, Discussion and bibliographical comments View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      The Occur-check Problem

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 387 - 430
      Copyright Year: 2003

      MIT Press eBook Chapters

      This chapter contains sections titled: The problem, The occur-check problem for a system of equations, The occur-check problem for a program, Undecidability of the occur-check problem for a program, A sufficient NSTO condition for a system of equations, Sufficient NSTO conditions for a program, Discussion View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Bibliography

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 431 - 443
      Copyright Year: 2003

      MIT Press eBook Chapters

      Within the field of logic programming there have been numerous attempts to transform grammars into logic programs. This book describes a complementary approach that views logic programs as grammars and shows how this new presentation of the foundations of logic programming, based on the notion of proof trees, can enrich the field.The authors' approach facilitates discussion of grammatical aspects of, and introduces new kinds of semantics for, definite programs. They survey relevant grammatical formalisms and provide a comprehensive introduction to the well-known attribute grammars and van Wijngaarden grammars. A formal comparison of definite programs to these grammars allows the authors to identify interesting grammatical concepts.The book also includes a presentation of verification methods for definite programs derived from verification methods for attribute grammars, and an analysis of the occur-check problem as an example of how the grammatical view of logic programming can be applied.Pierre Deransart is Research Director at INRIA-Rocquencourt, Le Chesnay Cedex, France. Jan Maluszynski is Professor in the Department of Computer and Information Science at Linköping University, Sweden.Contents: Preliminaries. Foundations. Grammatical Extensions of Logic Programs. Attribute Grammars. Attribute Grammars and Logic Programming. Proof Methods. Study of Declarative Properties. The Occur-check Problem. View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Index

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 445 - 454
      Copyright Year: 2003

      MIT Press eBook Chapters

      Within the field of logic programming there have been numerous attempts to transform grammars into logic programs. This book describes a complementary approach that views logic programs as grammars and shows how this new presentation of the foundations of logic programming, based on the notion of proof trees, can enrich the field.The authors' approach facilitates discussion of grammatical aspects of, and introduces new kinds of semantics for, definite programs. They survey relevant grammatical formalisms and provide a comprehensive introduction to the well-known attribute grammars and van Wijngaarden grammars. A formal comparison of definite programs to these grammars allows the authors to identify interesting grammatical concepts.The book also includes a presentation of verification methods for definite programs derived from verification methods for attribute grammars, and an analysis of the occur-check problem as an example of how the grammatical view of logic programming can be applied.Pierre Deransart is Research Director at INRIA-Rocquencourt, Le Chesnay Cedex, France. Jan Maluszynski is Professor in the Department of Computer and Information Science at Linköping University, Sweden.Contents: Preliminaries. Foundations. Grammatical Extensions of Logic Programs. Attribute Grammars. Attribute Grammars and Logic Programming. Proof Methods. Study of Declarative Properties. The Occur-check Problem. View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Back Matter

      Deransart, P. ; Maluszy¿ski, J.
      A Grammatical View of Logic Programming

      Page(s): 455 - 456
      Copyright Year: 2003

      MIT Press eBook Chapters

      Within the field of logic programming there have been numerous attempts to transform grammars into logic programs. This book describes a complementary approach that views logic programs as grammars and shows how this new presentation of the foundations of logic programming, based on the notion of proof trees, can enrich the field.The authors' approach facilitates discussion of grammatical aspects of, and introduces new kinds of semantics for, definite programs. They survey relevant grammatical formalisms and provide a comprehensive introduction to the well-known attribute grammars and van Wijngaarden grammars. A formal comparison of definite programs to these grammars allows the authors to identify interesting grammatical concepts.The book also includes a presentation of verification methods for definite programs derived from verification methods for attribute grammars, and an analysis of the occur-check problem as an example of how the grammatical view of logic programming can be applied.Pierre Deransart is Research Director at INRIA-Rocquencourt, Le Chesnay Cedex, France. Jan Maluszynski is Professor in the Department of Computer and Information Science at Linköping University, Sweden.Contents: Preliminaries. Foundations. Grammatical Extensions of Logic Programs. Attribute Grammars. Attribute Grammars and Logic Programming. Proof Methods. Study of Declarative Properties. The Occur-check Problem. View full abstract»