Skip to main content
SpringerLink
Log in

Extensions of Logic Programming

Third International Workshop, ELP '92, Bologna, Italy, February 26-28, 1992. Proceedings

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. E. Lamma
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. P. Mello
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 660)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

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

Access this book

Log in via an institution
Softcover Book USD 54.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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  2. SLWV — A theorem prover for logic programming

    • Luís Moniz Pereira, Luis Caires, José Alferes
    Pages 1-23

  3. A Correct goal-directed proof procedure for a general logic program with integrity constraints

    • Ken Satoh, Noboru Iwayama
    Pages 24-44

  4. Declarative semantics of hypothetical logic programming with negation as failure

    • Phan Minh Dung
    Pages 45-58

  5. Conditional narrowing with constructive negation

    • María José Ramírez, Moreno Falaschi
    Pages 59-79

  6. CLP\((\mathcal{A}\mathcal{D})\) as a deductive database language with updates

    • Elisa Bertino, Maurizio Martelli, Danilo Montesi
    Pages 80-99

  7. Logic programming with functions over order-sorted feature terms

    • Hassan Aïl-Kaci, Andreas Podelski
    Pages 100-119

  8. A direct semantic characterization of RELFUN

    • Harold Boley
    Pages 120-149

  9. Embedding finite sets in a logic programming language

    • Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi
    Pages 150-167

  10. A modal framework for structured logic programs

    • Laura Giordano, Alberto Martelli
    Pages 168-186

  11. Metalogic for state oriented programming

    • Antonio Brogi, Franco Turini
    Pages 187-204

  12. On the semantics of inheritance in logic programming: Compositionality and full abstraction

    • Michele Bugliesi
    Pages 205-215

  13. The abstract scheme for concurrent programming

    • António Porto, Paulo Rosado
    Pages 216-241

  14. The π-calculus as a theory in linear logic: Preliminary results

    • Dale Miller
    Pages 242-264

  15. Natural deduction proof theory for logic programming

    • Seppo Keronen
    Pages 265-281

  16. A typed foundation for directional logic programming

    • Uday S. Reddy
    Pages 282-318

  17. An architecture for Prolog extensions

    • Micha Meier, Joachim Schimpf
    Pages 319-338

  18. Techniques for implementing contexts in Logic Programming

    • Enrico Denti, Evelina Lamma, Paola Mello, Antonio Natali, Andrea Omicini
    Pages 339-358

  19. Implementing a notion of modules in the logic programming language λProlog

    • Keehang Kwon, Gopalan Nadathur, Debra Sue Wilson
    Pages 359-393

  20. Implementational issues in GCLA: A-sufficiency and the definiens operation

    • Martin Aronsson
    Pages 394-417
Back to top

Keywords

About this book

This book contains papers which investigate how to extend logic programming toward the artificial intelligence and software engineering areas, covering both theoretical and practical aspects. Some papers investigate topics such as abductive reasoning and negation. Some works discuss how to enhance the expressive power of logic programming by introducing constraints, sets, and integration with functional programming. Other papers deal with the structuring of knowledge into modules, taxonomies, and objects, withthe aim of extending logic programming toward software engineering applications. A section is devoted to papers concentrating on proof theory and inspired by Gentzen-style sequent or natural deduction systems. Topics such as concurrency are considered to enhance the expressive power of logic languages. Finally, some papers mainly concernimplementation techniques for some of these logic programming extensions.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation