Computational logic–CL 2000 : First International Conference, London, UK, July 24-28, 2000 : proceedings

Computational Logic — CL 2000: First International Conference London, UK, July 24–28, 2000 Proceedings
Author: John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, Peter J. Stuckey
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67797-0
DOI: 10.1007/3-540-44957-4

Table of Contents:

• Computational Logic: Memories of the Past and Challenges for the Future
• ILP: Just Do It
• Databases and Higher Types
• A Denotational Semantics for First-Order Logic
• Logic, Knowledge Representation, and Bayesian Decision Theory
• Logic Program Synthesis in a Higher-Order Setting
• Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
• Binary Speed Up for Logic Programs
• A New Module System for Prolog
• Partial Models of Extended Generalized Logic Programs
• Alternating Fixpoint Theory for Logic Programs with Priority
• Proving Failure in Functional Logic Programs
• Semantics of Input-Consuming Logic Programs
• A Denotational Semantics of Defeasible Logic
• Isoinitial Semantics for Logic Programs
• Abstract Syntax for Variable Binders: An Overview
• Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic
• Efficient EM Learning with Tabulation for Parameterized Logic Programs
• Model Generation Theorem Proving with Finite Interval Constraints
• Combining Mobile Processes and Declarative Programming

Includes bibliographical references and index