Front matter
1-24
Computational Logic: Memories of the Past and Challenges for the Future
John Alan Robinson
25-40
ILP: Just Do It
David Page
41-52
Databases and Higher Types
Melvin Fitting
53-69
A Denotational Semantics for First-Order Logic
Krzysztof R. Apt
70-86
Logic, Knowledge Representation, and Bayesian Decision Theory
David Poole
87-100
Logic Program Synthesis in a Higher-Order Setting
David Lacey, Julian Richardson and Alan Smail
101-115
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
Michael Leuschel and Helko Lehmann
116-130
Binary Speed Up for Logic Programs
Jan Hrůza and Petr Štěánek
131-148
A New Module System for Prolog
Daniel Cabeza and Manuel Hermenegildo
149-163
Partial Models of Extended Generalized Logic Programs
José J. Alferes, Heinrich Herre and Luís Moniz Pereira
164-178
Alternating Fixpoint Theory for Logic Programs with Priority
Kewen Wang, Lizhu Zhou and Fangzhen Lin
179-193
Proving Failure in Functional Logic Programs
Francisco J. López-Fraguas and Jaime Sánchez-Hernández
194-208
Semantics of Input-Consuming Logic Programs
Annalisa Bossi, Sandro Etalle and Sabina Rossi
209-222
A Denotational Semantics of Defeasible Logic
Michael J. Maher
223-238
Isoinitial Semantics for Logic Programs
Kung-Kiu Lau and Mario Ornaghi
239-253
Abstract Syntax for Variable Binders: An Overview
Dale Miller
254-268
Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic
James Harland, Tatjana Lutovac and Michael Winikoff
269-284
Efficient EM Learning with Tabulation for Parameterized Logic Programs
Yoshitaka Kameya and Taisuke Sato
285-299
Model Generation Theorem Proving with Finite Interval Constraints
Reiner Hähnle, Ryuzo Hasegawa and Yasuyuki Shirai
300-314
Combining Mobile Processes and Declarative Programming
Rachid Echahed and Wendelin Serwe
315-325
Representing Trees with Constraints
Ben Curry, Geraint A. Wiggins and Gillian Hayes
326-341
Dominance Constraints with Set Operators
Denys Duchier and Joachim Niehren
342-357
Better Communication for Tighter Cooperation
Petra Hofstedt
358-372
Arc Consistency Algorithms via Iterations of Subsumed Functions
Rosella Gennari
373-383
AVAL: An Enumerative Method for SAT
Gilles Audemard, Belaid Benhamou and Pierre Siegel
384-398
Constraint Logic Programming for Local and Symbolic Model-Checking
Ulf Nilsson and Johan Lübcke
399-413
A CLP Framework for Computing Structural Test Data
Arnaud Gotlieb, Bernard Botella and Michel Rueher
414-428
Modelling Digital Circuits Problems with Set Constraints
Francisco Azevedo and Pedro Barahona
429-447
Promoting Constraints to First-Class Status
Tobias Müller
448-462
Developing Finite Domain Constraints — A Data Model Approach
Kit-ying Hui and Peter M. D. Gray
463-477
Concurrent Constraint Programming with Process Mobility
David Gilbert and Catuscia Palamidessi
478-492
A System for Tabled Constraint Logic Programming
Baoqiu Cui and David S. Warren
493-507
Finding Tractable Formulas in NNF
Edgar Altamirano and Gonçal Escalada-Imaz
508-522
The Taming of the (X)OR
Peter Baumgartner and Fabio Massacci
523-537
On an
ω
-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL
Regimantas Pliuškevičius
538-552
Representing Object Code
Marco Benini
553-567
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Tommi A. Junttila and Ilkka Niemelä
568-582
Certification of Compiler Optimizations Using Kleene Algebra with Tests
Dexter Kozen and Maria-Cristina Patron
583-597
An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas
Michael Dierkes
598-612
Model Checking for Timed Logic Processes
Supratik Mukhopadhyay and Andreas Podelski
613-628
Perfect Model Checking via Unfold/Fold Transformations
Alberto Pettorossi and Maurizio Proietti
629-643
Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions
Richard J. Boulton and Konrad Slind
644-659
Proof Planning with Multiple Strategies
Erica Melis and Andreas Meier
660-672
The Theory of Total Unary RPO Is Decidable
Paliath Narendran and Michael Rusinowitch
673-687
On the Problem of Computing the Well-Founded Semantics
Zbigniew Lone and Miroslaw Truszczyński
688-702
Computing Equilibrium Models Using Signed Formulas
David Pearce, Inmaculada P. de Guzmán and Agustín Valverde
703-717
Extending Classical Logic with Inductive Definitions
Marc Denecker
718-732
A Simple Characterization of Extended Abduction
Katsumi Inoue
733-746
A New Equational Foundation for the Fluent Calculus
Hans-Peter Störr and Michael Thielscher
747-761
Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams
Steffen Hölldobler and Hans-Peter Störr
762-776
Decidability Results for the Propositional Fluent Calculus
Helko Lehmann and Michael Leuschel
777-791
A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs
Vincenzo Pallotta
792-806
Default Reasoning with Specificity
Phan Minh Dũng and Tran Cao Son
807-821
Planning under Incomplete Knowledge
Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer and Axel Polleres
822-836
Wire Routing and Satisfiability Planning
Esra Erdem, Vladimir Lifschitz and Martin D. F. Wong
837-851
Including Diagnostic Information in Configuration Models
Tommi Syrjänen
852-866
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs
Tomi Janhunen
867-881
On Complexity of Updates through Integrity Constraints
Michael Dekhtyar, Alexander Dikovsky and Sergey Dudakov
882-896
Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States
Chitta Baral, Le-Chi Tuan, Raúl Trejo and Vladik Kreinovich
897-911
Smallest Equivalent Sets for Finite Propositional Formula Circumscription
Yves Moinard and Raymond Rolland
912-925
A Semantics for Persistency in Propositional Dynamic Logic
Jan Broersen, Roel Wieringa and John-Jules Meyer
926-941
Applications of Annotated Predicate Calculus to Querying Inconsistent Databases
Marcelo Arenas, Leopoldo Bertossi and Michael Kifer
942-956
Querying Inconsistent Databases: Algorithms and Implementation
Alexander Celle and Leopoldo Bertossi
957-971
On Verification in Logic Database Languages
Francesco Bonchi, Fosca Giannotti and Dino Pedreschi
972-986
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme and Lotfi Lakhal
987-1001
Linearly Bounded Reformulations of Conjunctive Databases
Extended Abstract
Rada Chirkova and Michael R. Genesereth
1002-1016
MuTACLP: A Language for Declarative GIS Analysis
Paolo Mancarella, Gianluca Nerbini, Alessandra Raffaetà and Franco Turini
1017-1032
Reasoning about Duplicate Elimination with Description Logic
Preliminary Report
Vitaliy L. Khizder, David Toman and Grant Weddell
1033-1047
A File System Based on Concept Analysis
Sébastien Ferré and Olivier Ridoux
1048-1062
A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases
Enrico Franconi, Fabio Grandi and Federica Mandreoli
1063-1077
SLDMagic — The Real Magic (With Applications to Web Queries)
Stefan Brass
1078-1093
FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine
Guizhen Yang and Michael Kifer
1094-1105
Design and Implementation of the Physical Layer in WebBases: The XRover Experience
Hasan Davulcu, Guizhen Yang, Michael Kifer and I. V. Ramakrishnan
1106-1120
A Dynamic Approach to Termination Analysis for Active Database Rules
James Bailey, Alexandra Poulovassilis and Peter Newson
1121-1136
Constraint-Based Termination Analysis for Cyclic Active Database Rules
Saumya Debray and Timothy Hickey
1137-1151
A Formal Model for an Expressive Fragment of XSLT
Geert Jan Bex, Sebastian Maneth and Frank Neven
1152-1166
On the Equivalence of XML Patterns
Peter T. Wood
1167-1181
Querying XML Specified WWW Sites: Links and Recursion in XML-GL
Extended Abstract
Barbara Oliboni and Letizia Tanca
1182-1196
A Heuristic Approach for Converting HTML Documents to XML Documents
Seung-Jin Lim and Yiu-Kai Ng
1197-1209
Specification of an Active Database System Application Using Dynamic Relation Nets
Laurent Allain and Pascal Yim
1210-1224
Invariance, Maintenance, and Other Declarative Objectives of Triggers — A Formal Characterization of Active Databases
Mutsumi Nakamura and Chitta Baral
1225-1239
Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects
Paul Tarau
1240-1254
So Many WAM Variations, So Little Time
Bart Demoen and Phuong-Lan Nguyen
1255-1269
A Module Based Analysis for Memory Reuse in Mercury
Nancy Mazur, Gerda Janssens and Maurice Bruynooghe
1270-1284
Mode Checking in HAL
María García de la Banda, Peter J. Stuckey, Warwick Harvey and Kim Marriott
1285-1299
The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems
Inês de Castro Dutra, Vítor Santos Costa and Ricardo Bianchini
1300-1314
Data Protection by Logic Programming
Steve Barker
1315-1329
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language
Chuck Liang
1330-1344
A Logic Programming Application for the Analysis of Spanish Verse
Pablo Gervás
1345-1361
A Documentation Generator for (C)LP Systems
Manuel Hermenegildo
1362-1376
Psychiatric Diagnosis from the Viewpoint of Computational Logic
Joseph Gartner, Terrance Swift, Allen Tien, Carlos Viegas Damásio and Luís Moniz Pereira
Back matter