ISBN: 3540677976
TITLE: Computational Logic - CL 2000
AUTHOR: Lloyd, John; Dahl, Veronica; Furbach, Ulrich; Kerber, Manfred; Lau, Kung-Kiu; Palamidessi, Catuscia; Pereira, Luis M.; Sagiv, Yehoshua; Stuckey, Peter J. (Eds.)
TOC:

Invited Papers
Computational Logic: Memories of the Past and Challenges for the Future 1
John Alan Robinson
ILP: Just Do It 25
David Page
Databases and Higher Types 41
Melvin Fitting
A Denotational Semantics for First-Order Logic 53
Krzysztof R. Apt
Logic, Knowledge Representation, and Bayesian Decision Theory 70
David Poole
Program Development (LOPSTR)
Logic Program Synthesis in a Higher-Order Setting 87
David Lacey, Julian Richardson, and Alan Smaill
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction 101
Michael Leuschel and Helko Lehmann
Binary Speed Up for Logic Programs 116
Jan Hruza and Petr Stepnek
A New Module System for Prolog 131
Daniel Cabeza and Manuel Hermenegildo
Logic Programming: Theory and Extensions
Partial Models of Extended Generalized Logic Programs 149
Jos J. Alferes, Heinrich Herre, and Lus Moniz Pereira
Alternating Fixpoint Theory for Logic Programs with Priority 164
Kewen Wang, Lizhu Zhou, and Fangzhen Lin
Proving Failure in Functional Logic Programs 179
Francisco J. Lpez-Fraguas and Jaime Snchez-Hernndez
Semantics of Input-Consuming Logic Programs 194
Annalisa Bossi, Sandro Etalle, and Sabina Rossi
A Denotational Semantics of Defeasible Logic 209
Michael J. Maher
Isoinitial Semantics for Logic Programs 223
Kung-Kiu Lau and Mario Ornaghi
Abstract Syntax for Variable Binders: An Overview 239
Dale Miller
Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic 254
James Harland, Tatjana Lutovac, and Michael Winikoff
Efficient EM Learning with Tabulation for Parameterized Logic Programs 269
Yoshitaka Kameya and Taisuke Sato
Model Generation Theorem Proving with Finite Interval Constraints 285
Reiner Hhnle, Ryuzo Hasegawa, and Yasuyuki Shirai
Combining Mobile Processes and Declarative Programming 300
Rachid Echahed and Wendelin Serwe Constraints
Representing Trees with Constraints 315
Ben Curry, Geraint A. Wiggins, and Gillian Hayes
Dominance Constraints with Set Operators 326
Denys Duchier and Joachim Niehren
Better Communication for Tighter Cooperation 342
Petra Hofstedt
Arc Consistency Algorithms via Iterations of Subsumed Functions 358
Rosella Gennari
AVAL: An Enumerative Method for SAT 373
Gilles Audemard, Belaid Benhamou, and Pierre Siegel
Constraint Logic Programming for Local and Symbolic Model-Checking 384
Ulf Nilsson and Johan Lbcke
A CLP Framework for Computing Structural Test Data 399
Arnaud Gotlieb, Bernard Botella, and Michel Rueher
Modelling Digital Circuits Problems with Set Constraints 414
Francisco Azevedo and Pedro Barahona
Promoting Constraints to First-Class Status 429
Tobias Mller
Developing Finite Domain Constraints  A Data Model Approach 448
Kit-ying Hui and Peter M.D. Gray
Concurrent Constraint Programming with Process Mobility 463
David Gilbert and Catuscia Palamidessi
A System for Tabled Constraint Logic Programming 478
Baoqiu Cui and David S. Warren
Automated Deduction: Putting Theory into Practice Finding Tractable Formulas in NNF 493
Edgar Altamirano and Goncal Escalada-Imaz
The Taming of the (X)OR 508
Peter Baumgartner and Fabio Massacci
On an omega-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL 523
Regimantas Pliuskevicius
Representing Object Code 538
Marco Benini
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking 553
Tommi A. Junttila and Ilkka Niemel
Certification of Compiler Optimizations Using Kleene Algebra with Tests 568
Dexter Kozen and Maria-Cristina Patron
An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas 583
Michael Dierkes
Model Checking for Timed Logic Processes 598
Supratik Mukhopadhyay and Andreas Podelski
Perfect Model Checking via Unfold/Fold Transformations 613
Alberto Pettorossi and Maurizio Proietti
Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions 629
Richard J. Boulton and Konrad Slind
Proof Planning with Multiple Strategies 644
Erica Melis and Andreas Meier
The Theory of Total Unary RPO Is Decidable 660
Paliath Narendran and Michael Rusinowitch
Knowledge Representation and Non-monotonic Reasoning
On the Problem of Computing the Well-Founded Semantics 673
Zbigniew Lonc and Miroslaw Truszczynski
Computing Equilibrium Models Using Signed Formulas 688
David Pearce, Inmaculada P. de Guzmn, and Agustn Valverde
Extending Classical Logic with Inductive Definitions 703
Marc Denecker
A Simple Characterization of Extended Abduction 718
Katsumi Inoue
A New Equational Foundation for the Fluent Calculus 733
Hans-Peter Strr and Michael Thielscher
Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams 747
Steffen Hlldobler and Hans-Peter Strr
Decidability Results for the Propositional Fluent Calculus 762
Helko Lehmann and Michael Leuschel
A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs 777
Vincenzo Pallotta
Default Reasoning with Specificity 792
Phan Minh Dung and Tran Cao Son
Planning under Incomplete Knowledge 807
Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres
Wire Routing and Satisfiability Planning 822
Esra Erdem, Vladimir Lifschitz, and Martin D.F. Wong
Including Diagnostic Information in Configuration Models 837
Tommi Syrjnen
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs 852
Tomi Janhunen
On Complexity of Updates through Integrity Constraints 867
Michael Dekhtyar, Alexander Dikovsky, and Sergey Dudakov
Computational Complexity of Planning Based on Partial Information about the System's Present and Past States 882
Chitta Baral, Le-Chi Tuan, Ral Trejo, and Vladik Kreinovich
Smallest Equivalent Sets for Finite Propositional Formula Circumscription 897
Yves Moinard and Raymond Rolland
A Semantics for Persistency in Propositional Dynamic Logic 912
Jan Broersen, Roel Wieringa, and John-Jules Meyer
Database Systems (DOOD)
Applications of Annotated Predicate Calculus to Querying Inconsistent Databases 926
Marcelo Arenas, Leopoldo Bertossi, and Michael Kifer
Querying Inconsistent Databases: Algorithms and Implementation 942
Alexander Celle and Leopoldo Bertossi
On Verification in Logic Database Languages 957
Francesco Bonchi, Fosca Giannotti, and Dino Pedreschi
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets 972
Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, and Lotfi Lakhal
Linearly Bounded Reformulations of Conjunctive Databases 987
Rada Chirkova and Michael R. Genesereth
MuTACLP: A Language for Declarative GIS Analysis 1002
Paolo Mancarella, Gianluca Nerbini, Alessandra Raffaet, and Franco Turini
Reasoning about Duplicate Elimination with Description Logic 1017
Vitaliy L. Khizder, David Toman, and Grant Weddell
A File System Based on Concept Analysis 1033
Sbastien Ferr and Olivier Ridoux
A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases 1048
Enrico Franconi, Fabio Grandi, and Federica Mandreoli
SLDMagic - The Real Magic (With Applications to Web Queries) 1063
Stefan Brass
FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine 1078
Guizhen Yang and Michael Kifer
Design and Implementation of the Physical Layer in WebBases: The Xrover Experience 1094
Hasan Davulcu, Guizhen Yang, Michael Kifer, and I.V. Ramakrishnan
A Dynamic Approach to Termination Analysis for Active Database Rules 1106
James Bailey, Alexandra Poulovassilis, and Peter Newson
Constraint-Based Termination Analysis for Cyclic Active Database Rules 1121
Saumya Debray and Timothy Hickey
A Formal Model for an Expressive Fragment of XSLT 1137
Geert Jan Bex, Sebastian Maneth, and Frank Neven
On the Equivalence of XML Patterns 1152
Peter T. Wood
Querying XML Specified WWW Sites: Links and Recursion in XML-GL 1167
Barbara Oliboni and Letizia Tanca
A Heuristic Approach for Converting HTML Documents to XML Documents 1182
Seung-Jin Lim and Yiu-Kai Ng
Specification of an Active Database System Application Using Dynamic Relation Nets 1197
Laurent Allain and Pascal Yim
Invariance, Maintenance, and Other Declarative Objectives of Triggers  A Formal Characterization of Active Databases 1210
Mutsumi Nakamura and Chitta Baral
Logic Programming: Implementations and Applications
Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects 1225
Paul Tarau
So Many WAM Variations, So Little Time 1240
Bart Demoen and Phuong-Lan Nguyen
A Module Based Analysis for Memory Reuse in Mercury 1255
Nancy Mazur, Gerda Janssens, and Maurice Bruynooghe
Mode Checking in HAL 1270
Mara Garca de la Banda, Peter J. Stuckey, Warwick Harvey, and Kim Marriott
The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems 1285
Ins de Castro Dutra, Vtor Santos Costa, and Ricardo Bianchini
Data Protection by Logic Programming 1300
Steve Barker
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language 1315
Chuck Liang
A Logic Programming Application for the Analysis of Spanish Verse 1330
Pablo Gervs
A Documentation Generator for (C)LP Systems 1345
Manuel Hermenegildo
Psychiatric Diagnosis from the Viewpoint of Computational Logic 1362
Joseph Gartner, Terrance Swift, Allen Tien, Carlos Viegas Damsio, and Lus Moniz Pereira
Author Index 1377
END
