Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski Part II

Paolo Baldan, Paolo Mancarella, Alessandra Raffaetà , Franco Turini (auth.), Antonis C. Kakas, Fariba Sadri (eds.)3540439609, 9783540439608

Alan Robinson This set of essays pays tribute to Bob Kowalski on his 60th birthday, an anniversary which gives his friends and colleagues an excuse to celebrate his career as an original thinker, a charismatic communicator, and a forceful intellectual leader. The logic programming community hereby and herein conveys its respect and thanks to him for his pivotal role in creating and fostering the conceptual paradigm which is its raison d’Œtre. The diversity of interests covered here reflects the variety of Bob’s concerns. Read on. It is an intellectual feast. Before you begin, permit me to send him a brief personal, but public, message: Bob, how right you were, and how wrong I was. I should explain. When Bob arrived in Edinburgh in 1967 resolution was as yet fairly new, having taken several years to become at all widely known. Research groups to investigate various aspects of resolution sprang up at several institutions, the one organized by Bernard Meltzer at Edinburgh University being among the first. For the half-dozen years that Bob was a leading member of Bernard’s group, I was a frequent visitor to it, and I saw a lot of him. We had many discussions about logic, computation, and language.

---

Table of contents :
MuTACLP: A Language for Temporal Reasoning with Multiple Theories….Pages 1-40
Description Logics for Information Integration….Pages 41-60
Search and Optimization Problems in Datalog….Pages 61-82
The Declarative Side of Magic….Pages 83-108
Key Constraints and Monotonic Aggregates in Deductive Databases….Pages 109-134
A Decidable CLDS for Some Propositional Resource Logics….Pages 135-159
A Critique of Proof Planning….Pages 160-177
A Model Generation Based Theorem Prover MGTP for First-Order Logic….Pages 178-213
A ‘Theory’ Mechanism for a Proof-Verifier Based on First-Order Set Theory….Pages 214-230
An Open Research Problem: Strong Completeness of R. Kowalski’s Connection Graph Proof Procedure….Pages 231-252
Meta-reasoning: A Survey….Pages 253-288
Argumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning….Pages 289-310
Automated Abduction….Pages 311-341
The Role of Logic in Computational Models of Legal Argument: A Critical Survey….Pages 342-381
Logic Programming Updating – A Guided Approach….Pages 382-412
Representing Knowledge in A-Prolog….Pages 413-451
Some Alternative Formulations of the Event Calculus….Pages 452-490
Issues in Learning Language in Logic….Pages 491-505
On Implicit Meanings….Pages 506-525
Data Mining as Constraint Logic Programming….Pages 526-547
DCGs: Parsing as Deduction?….Pages 548-566
Statistical Abduction with Tabulation….Pages 567-587
Logicism and the Development of Computer Science….Pages 588-604
Simply the Best: A Case for Abduction….Pages 605-625