The Logic Programming Paradigm: A 25-Year Perspective

by Apt, Krzysztof R.; Marek, V. W.; Truszczynski, Mirek; Warren, David S.

• ISBN13: 9783540654636
• ISBN10: 3540654631
• Format: Hardcover
• Copyright: 1999-06-01
• Publisher: Springer-Verlag New York Inc

Summary

Reveals the evolution of Logic programming since its inception and the impressively broad scope of current research in this paradigm. DLC: Logic programming.

Table of Contents

Part I. Computing and Programming
Concurrent and Agent Programming	3	(70)
Logic Programming and Multi-Agent Systems: A Synergic Combination for Applications and Semantics	5	(28)
Marco Bozzano
Giorgio Delzanno
Maurizio Martelli
Viviana Mascardi
Floriano Zini
Introduction	5	(1)
Why and Which LP Languages for MAS Development?	6	(4)
A General Multi-Agent System Architecture	10	(5)
A Multi-Agent System Specification Language	15	(4)
Towards a Specification Methodology	19	(8)
Conclusions and Future Work	27	(6)
Inference and Computation Mobility with Jinni	33	(20)
Paul Tarau
Introduction	33	(1)
The World of Jinni	34	(1)
Jinni as a Logic Programming Java Component	34	(1)
Basic Agent Programming with Jinni	35	(2)
What's New in Jinni	37	(7)
Jinni's Logical Engine	44	(2)
A Meta-circular Interpreter for Jinni	46	(1)
Mutual Agent/Host Security: the Bring Your Own Wine Principle	47	(1)
Application Domains	48	(1)
Conclusion	48	(5)
Concurrent Logic/Constraint Programming: The Next 10 Years	53	(20)
Kazunori Ueda
Grand Challenges	53	(3)
Two Approaches to Addressing Novel Applications	56	(1)
Logic Programming vs. Concurrent Logic Programming	57	(2)
An Application Domain: Parallel/Network Programming	59	(2)
Experiences with Guarded Horn Clauses and KL1	61	(4)
Some Failures and Problems	65	(2)
Conclusions	67	(6)
Program Analysis and Methodology	73	(120)
Formulas as Programs	75	(34)
Krzysztof R. Apt
Marc Bezem
Introduction	75	(4)
Computation Mechanism	79	(6)
Soundness and Completeness	85	(1)
Extensions	86	(4)
Relation to Other Approaches	90	(5)
Alma-O	95	(1)
Example: Partitioning a Rectangle into Squares	96	(3)
Current and Future Work	99	(3)
Appendix	102	(7)
Link-time Optimization of Multi-Language Programs	109	(18)
Saumya Debray
Introduction	109	(3)
Challenges in Link Time Optimization	112	(1)
System Organization	113	(1)
Program Optimization	114	(5)
Performance Results	119	(4)
Discussion	123	(1)
Conclusions	124	(3)
Horn Logic Denotations and Their Applications	127	(34)
Gopal Gupta
Introduction	127	(2)
Logical Denotations	129	(8)
Provably Correct Compilation	137	(3)
Program Denotation and Verification	140	(6)
Specification, Implementation and Verification of DSL Programs	146	(5)
Semantic Porting	151	(2)
Other Applications	153	(2)
Related Work	155	(1)
Conclusions	156	(5)
Global Analysis, Partial Specifications, and Assertions	161	(32)
Manuel Hermenegildo
German Puebla
Francisco Bueno
Introduction	161	(2)
Overall Framework Architecture and Operation	163	(4)
The Assertion Language	167	(3)
Defining Properties	170	(4)
A Simple Run-time Checking Scheme	174	(1)
Compile-Time Checking	175	(3)
A Sample Debugging Session with the CIAO System	178	(5)
Some Practical Hints on Debugging with Assertions	183	(2)
A Preliminary Experimental Evaluation	185	(1)
Discussion	186	(4)
Code for Run-time Checking	190	(3)
Future of Declarative Programming	193	(36)
Assessment of Some Issues in CL-Theory and Program Development	195	(14)
Danny De Schreye
Marc Denecker
Introduction: on assessment	195	(2)
Implementation, analysis and transformation	197	(3)
``Algorithm = Logic + Control'' revisited	200	(4)
Conclusions: future directions	204	(5)
How Enterprises Use Functional Languages, and Why They Don't	209	(1)
Philip Wadler
An Angry Half Dozen	209	(8)
Why No One Uses Functional Languages	217	(7)
Functional and Logic Programming	224	(5)
Continuous Mathematics	229	(50)
Continuous Models of Computation for Logic Programs	231	(26)
Howard A. Blair
Fred Dushin
David W. Jakel
Angel J. Rivera
Metin Sezgin
Orientation	231	(2)
The Contention and a Caution	233	(2)
Long-term Expectations	235	(4)
Relationship to Prior Work	239	(2)
Continualizing Propositional Connectives	241	(3)
A Continuous-Time Example	244	(4)
A Fundamental Discrete-time System	248	(2)
Emergent Phenomena from Tuning	250	(7)
The Logic Programming Paradigm in Numerical Computation	257	(22)
Maarten H. van Emden
Introduction	257	(3)
Numerical Programs Need Verification	260	(3)
From Prolog to CLP (R)	263	(3)
Sound CLP (R)	266	(1)
Proving ND/ID Formulas	267	(5)
Related Work	272	(1)
Conclusions	273	(6)
Part II. Knowledge Representation and Modeling
Constraints	279	(54)
Computational Molecular Biology: A Promising Application Using LP and its Extensions	281	(32)
Jacques Cohen
Introduction	281	(1)
A Minimalist Introduction to DNA and Protein Generation	282	(3)
Top-Down Description of Protein Generation from DNA	285	(2)
Grammars Defining DNA Components	287	(2)
Motivation for Introducing DAGs	289	(4)
Obtaining DAGs From NDFSA	293	(1)
Chromatic NDFSA and DAGs	294	(1)
Introducing ``Criteria''	294	(2)
Alternation of Introns and Exons Using NDFSA	296	(2)
Related Approaches	298	(3)
Other Problems in Computational Molecular Biology	301	(3)
Areas in CS That Are Applicable in Molecular Biology	304	(1)
Some Comments About DNA Computing	304	(2)
Final Remarks	306	(7)
Adding Constraints to Logic-based Formalisms	313	(20)
Michael J. Maher
Introduction	313	(1)
Logic Formalisms	314	(1)
Constraints	315	(3)
Adding Constraints to Logic Formalisms	318	(2)
Constraints in Logic Formalisms	320	(7)
Conclusion	327	(6)
Machine Learning	333	(22)
A Perspective on Inductive Logic Programming	335	(12)
Luc De Raedt
Introduction	335	(1)
Inductive Logic Programming	335	(2)
The Methodology of Inductive Logic Programming	337	(3)
The Relation Between Inductive Logic Programming and Logic Programming	340	(3)
Research Directions for Inductive Logic Programming	343	(4)
From Deduction to Induction: Logical Perspective	347	(8)
Koichi Furukawa
Introduction	347	(1)
Inverse Entailment	348	(2)
Subsumption and Entailment	350	(1)
Completion of the Algorithm	351	(1)
Abductive Inference in ILP	352	(1)
Conclusion and Future Reasearch Directions	353	(2)
Answer Set Programming	355	(44)
Action Languages, Answer Sets, and Planning	357
Vladimir Lifschitz
Introduction	357	(2)
Incomplete Information	359	(1)
Action Language A	360	(1)
Answer Sets and Histories	361	(1)
Computing Answer Sets	362	(1)
Causal Reasoning	363	(1)
Action Language C	364	(3)
From C to Logic Programming	367	(2)
Planing for Domains Described in C	369	(1)
Topics for Future Work	370	(1)
Conclusion	371
Stable Models and an Alternative Logic Programming Paradigm	386	(399)
Victor W. Marek
Miroslaw Truszczynski
Introduction
Horn Logic Programming
Negation in Logic Programming
Stable Logic Programming
Expressive Power of SLP
Recursion Versus Constraints
Uniform Control in SLP	392	(2)
Conclusions and Future Directions	394	(5)
Database Systems	399	(28)
Logic-Based User-Defined Aggregates for the Next Generation of Database Systems	401	(26)
Carlo Zaniolo
Haixun Wang
Introduction	401	(1)
New Applications Require New Aggregates	402	(4)
User-Defined Aggregates: the State of the Art	406	(3)
Aggregates with Early Returns	409	(2)
Formal Semantics	411	(2)
Monotonic Aggregation	413	(3)
Implementation of Extended Aggregates	416	(1)
Applications of Monotone Aggregation	417	(4)
Applications to SQL Databases	421	(3)
Conclusions	424	(3)
Natural Language Processing	427	(24)
The Logic of Language	429	(22)
Veronica Dahl
Introduction	429	(2)
Some Basic Problems in Natural Language Processing	431	(1)
The Omnipresence of Logic in Language	432	(1)
Linguistically Principled Approaches to Natural Language Processing	432	(5)
A Computational Linguist's Wishlist for Prolog	437	(2)
What Fashion of the Day Are We Losing To?	439	(1)
How Can Logic Programming Benefit from Regaining the Market?	440	(1)
Assumptive Logic Programming and Grammars	441	(1)
Controlling Virtual Worlds and Robots Through Natural Language	442	(2)
Concept Based Retrieval Through Natural Language	444	(1)
Database Initialization from Natural Language	445	(6)
Conclusion	451