Meta-Programming in Logic: Third International Workshop, META-92 Uppsala, Sweden, June 10–12, 1992 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This volume contains lectures and papers delivered at Meta 92, the Third International Workshop on Metaprogramming in Logic, held in Uppsala, Sweden,June 1992. The topics covered include foundations of metaprogramming in logic, proposals for metaprogramming languages, techniques for knowledgerepresentation and belief systems, and program transformation and analysis in logic. Particular topics include belief revision systems, intensionaldeduction, belief systems and metaprogramming, principles of partial deduction, termination in logic programs, semantics of the "vanilla" metainterpreter, a complete resolution method for metaprogramming, semanticsof "demo", hierarchical metalogics, the naming relation in metalevel systems, modules, reflective agents, compiler optimizations, metalogic and object-oriented facilities, parallel logic languages, the use of metaprogramming for legal reasoning, representing objects and inheritance, transformation of normal programs, negation in automatically generated logic programs, reordering of literals in deductive databases, abstract interpretations, and interarguments in constraint logic programs.

Author(s): Peter Gärdenfors (auth.), A. Pettorossi (eds.)
Series: Lecture Notes in Computer Science 649
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1992

Language: English
Pages: 351
Tags: Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations

Belief revision: A vade-mecum....Pages 1-10
Metaprogramming through intensional deduction: Some examples....Pages 11-25
An autoepistemic analysis of metalevel reasoning in logic programming....Pages 26-48
An introduction to partial deduction....Pages 49-69
Tutorial on termination of logic programs....Pages 70-88
Definable naming relations in meta-level systems....Pages 89-104
Meta for modularising logic programming....Pages 105-119
Compiler optimizations for low-level redundancy elimination: An application of meta-level prolog primitives....Pages 120-134
Reflective agents in metalogic programming....Pages 135-147
Logic meta-programming facilities in 'LOG....Pages 148-161
The Pandora deadlock handler meta-level relation....Pages 162-176
Object-oriented programming in Gödel: An experiment....Pages 177-191
A sensible least Herbrand semantics for untyped vanilla meta-programming and its extension to a limited form of amalgamation....Pages 192-204
A complete resolution method for logical meta-programming languages....Pages 205-219
Model theoretic semantics for Demo....Pages 220-234
Hierarchical meta-logics: Intuitions, proof theory and semantics....Pages 235-249
Negation and control in automatically generated logic programs....Pages 250-264
Transforming normal programs by replacement....Pages 265-279
Meta-programming for reordering literals in deductive databases....Pages 280-293
Propagation: a new operation in a framework for abstract interpretation of logic programs....Pages 294-307
CLP({ie308-01}) for proving interargument relations....Pages 308-320
Representation of fragmentary multilayered knowledge....Pages 321-335
Metaprograms for change, assumptions, objects, and inheritance....Pages 336-351