1. CL 2000: London, UK

@proceedings{DBLP:conf/cl/2000,
  editor    = {John W. Lloyd and
               Ver{\'o}nica Dahl and
               Ulrich Furbach and
               Manfred Kerber and
               Kung-Kiu Lau and
               Catuscia Palamidessi and
               Lu\'{\i}s Moniz Pereira and
               Yehoshua Sagiv and
               Peter J. Stuckey},
  title     = {Computational Logic - CL 2000, First International Conference,
               London, UK, 24-28 July, 2000, Proceedings},
  booktitle = {CL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1861},
  year      = {2000},
  isbn      = {3-540-67797-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Papers

• John Alan Robinson:
  Computational Logic: Memories of the Past and Challenges for the Future. 1-24
  
• David Page:
  ILP: Just Do It. 25-40
  
• Melvin Fitting:
  Databases and Higher Types. 41-52
  
• Krzysztof R. Apt:
  A Denotational Semantics for First-Order Logic. 53-69
  
• David Poole:
  Logic, Knowledge Representation, and Bayesian Decision Theory. 70-86
  

Program Development (LOPSTR)

• David Lacey, Julian Richardson, Alan Smaill:
  Logic Program Synthesis in a Higher-Order Setting. 87-100
  
• Michael Leuschel, Helko Lehmann:
  Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction. 101-115
  
• Jan Hruza, Petr Stepánek:
  Binary Speed Up for Logic Programs. 116-130
  
• Daniel Cabeza Gras, Manuel V. Hermenegildo:
  A New Module System for Prolog. 131-148
  

Logic Programming: Theory and Extensions

• José Júlio Alferes, Heinrich Herre, Luís Moniz Pereira:
  Partial Models of Extended Generalized Logic Programs. 149-163
  
• Kewen Wang, Lizhu Zhou, Fangzhen Lin:
  Alternating Fixpoint Theory for Logic Programs with Priority. 164-178
  
• Francisco Javier López-Fraguas, Jaime Sánchez-Hernández:
  Proving Failure in Functional Logic Programs. 179-193
  
• Annalisa Bossi, Sandro Etalle, Sabina Rossi:
  Semantics of Input-Consuming Logic Programs. 194-208
  
• Michael J. Maher:
  A Denotational Semantics of Defeasible Logic. 209-222
  
• Kung-Kiu Lau, Mario Ornaghi:
  Isoinitial Semantics for Logic Programs. 223-238
  
• Dale Miller:
  Abstract Syntax for Variable Binders: An Overview. 239-253
  
• James Harland, Tatjana Lutovac, Michael Winikoff:
  Goal-Directed Proof Search in Multiple-Conclusions Intuitionistic Logic. 254-268
  
• Yoshitaka Kameya, Taisuke Sato:
  Efficient EM Learning with Tabulation for Parameterized Logic Programs. 269-284
  
• Reiner Hähnle, Ryuzo Hasegawa, Yasuyuki Shirai:
  Moder Generation Theorem Proving with Finite Interval Constraints. 285-299
  
• Rachid Echahed, Wendelin Serwe:
  Combining Mobile Processes and Declarative Programming. 300-314
  

Constraints

• Ben Curry, Geraint A. Wiggins, Gillian Hayes:
  Representing Trees with Constraints. 315-325
  
• Denys Duchier, Joachim Niehren:
  Dominance Constraints with Set Operators. 326-341
  
• Petra Hofstedt:
  Better Communication for Tighter Cooperation. 342-358
  
• Rosella Gennari:
  Arc Consistency Algorithms via Iterations of Subsumed Functions. 358-372
  
• Gilles Audemard, Belaid Benhamou, Pierre Siegel:
  AVAL: An Enumerative Method for SAT. 373-383
  
• Ulf Nilsson, Johan Lübcke:
  Constraint Logic Programming for Local and Symbolic Model-Checking. 384-398
  
• Arnaud Gotlieb, Bernard Botella, Michel Rueher:
  A CLP Framework for Computing Structural Test Data. 399-413
  
• Francisco Azevedo, Pedro Barahona:
  Modelling Digital Circuits Problems with Set Constraints. 414-428
  
• Tobias Müller:
  Promoting Constraints to First-Class Status. 429-447
  
• Kit-ying Hui, Peter M. D. Gray:
  Developing Finite Domain Constraints - A Data Model Approach. 448-462
  
• David Gilbert, Catuscia Palamidessi:
  Concurrent Constraint Programming with Process Mobility. 463-477
  
• Baoqiu Cui, David Scott Warren:
  A System for Tabled Constraint Logic Programming. 478-492
  

Automated Deduction: Putting Theory into Practice

• Edgar Altamirano, Gonzalo Escalada-Imaz:
  Finding Tractable Formulas in NNF. 493-507
  
• Peter Baumgartner, Fabio Massacci:
  The Taming of the (X)OR. 508-522
  
• Regimantas Pliuskevicius:
  On an omega-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL. 523-537
  
• Marco Benini:
  Representing Object Code. 538-552
  
• Tommi A. Junttila, Ilkka Niemelä:
  Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking. 553-567
  
• Dexter Kozen, Maria-Christina Patron:
  Certification of Compiler Optimizations Using Kleene Algebra with Tests. 568-582
  
• Michael Dierkes:
  An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas. 583-597
  
• Supratik Mukhopadhyay, Andreas Podelski:
  Model Checking for Timed Logic Processes. 598-612
  
• Alberto Pettorossi, Maurizio Proietti:
  Perfect Model Checking via Unfold/Fold Transformations. 613-628
  
• Richard J. Boulton, Konrad Slind:
  Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions. 629-643
  
• Erica Melis, Andreas Meier:
  Proof Planning with Multiple Strategies. 644-659
  
• Paliath Narendran, Michaël Rusinowitch:
  The Theory of Total Unary RPO Is Decidable. 660-672
  

Knowledge Representation and Non-monotonic Reasoning

• Zbigniew Lonc, Miroslaw Truszczynski:
  On the Problem of Computing the Well-Founded Semantics. 673-687
  
• David Pearce, Inman P. de Guzmán, Agustín Valverde:
  Computing Equilibrium Models Using Signed Formulas. 688-702
  
• Marc Denecker:
  Extending Classical Logic with Inductive Definitions. 703-717
  
• Katsumi Inoue:
  A Simple Characterization of Extended Abduction. 718-732
  
• Hans-Peter Störr, Michael Thielscher:
  A New Equational Foundation for the Fluent Calculus. 733-746
  
• Steffen Hölldobler, Hans-Peter Störr:
  Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams. 747-761
  
• Helko Lehmann, Michael Leuschel:
  Decidability Results for the Propositional Fluent Calculus. 762-776
  
• Vincenzo Pallotta:
  A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs. 777-791
  
• Phan Minh Dung, Tran Cao Son:
  Default Reasoning with Specificity. 792-806
  
• Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres:
  Planning under Incomplete Knowledge. 807-821
  
• Esra Erdem, Vladimir Lifschitz, Martin D. F. Wong:
  Wire Routing and Satisfiability Planning. 822-836
  
• Tommi Syrjänen:
  Including Diagnostic Information in Configuration Models. 837-851
  
• Tomi Janhunen:
  Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs. 852-866
  
• Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey Dudakov:
  On Complexity of Updates through Integrity Constraints. 867-881
  
• Chitta Baral, Le-Chi Tuan, Raul Trejo, Vladik Kreinovich:
  Computational Complexity of Planning Based on Partial Information about the System's Present and Past States. 882-896
  
• Yves Moinard, Raymond Rolland:
  Smallest Equivalent Sets for Finite Propositional Formula Circumscription. 897-911
  
• Jan Broersen, Roel Wieringa, John-Jules Ch. Meyer:
  A Semantics for Persistency in Propositional Dynamic Logic. 912-925
  

Database Systems (DOOD)

• Marcelo Arenas, Leopoldo E. Bertossi, Michael Kifer:
  Applications of Annotated Predicate Calculus to Querying Inconsistent Databases. 926-941
  
• Alexander Celle, Leopoldo E. Bertossi:
  Querying Inconsistent Databases: Algorithms and Implementation. 942-956
  
• Francesco Bonchi, Fosca Giannotti, Dino Pedreschi:
  On Verification in Logic Database Languages. 957-971
  
• Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal:
  Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. 972-986
  
• Rada Chirkova, Michael R. Genesereth:
  Linearly Bounded Reformulations of Conjunctive Databases. 987-1001
  
• Paolo Mancarella, Gianluca Nerbini, Alessandra Raffaetà, Franco Turini:
  MuTACLP: A Language for Declarative GIS Analysis. 1002-1016
  
• Vitaliy L. Khizder, David Toman, Grant E. Weddell:
  Reasoning about Duplicate Elimination with Description Logic. 1017-1032
  
• Sébastien Ferré, Olivier Ridoux:
  A File System Based on Concept Analysis. 1033-1047
  
• Enrico Franconi, Fabio Grandi, Federica Mandreoli:
  A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases. 1048-1062
  
• Stefan Brass:
  SLDMagic - The Real Magic (With Applications to Web Queries). 1063-1077
  
• Guizhen Yang, Michael Kifer:
  FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine. 1078-1093
  
• Hasan Davulcu, Guizhen Yang, Michael Kifer, I. V. Ramakrishnan:
  Design and Implementation of the Physical Layer in WebBases: The XRover Experience. 1094-1105
  
• James Bailey, Alexandra Poulovassilis, Peter Newson:
  A Dynamic Approach to Termination Analysis for Active Database Rules. 1106-1120
  
• Saumya K. Debray, Timothy J. Hickey:
  Constraint-Based Termination Analysis for Cyclic Active Database Rules. 1121-1136
  
• Geert Jan Bex, Sebastian Maneth, Frank Neven:
  A Formal Model for an Expressive Fragment of XSLT. 1137-1151
  
• Peter T. Wood:
  On the Equivalence of XML Patterns. 1152-1166
  
• Barbara Oliboni, Letizia Tanca:
  Querying XML Specified WWW Sites: Links and Recursion in XML-GL. 1167-1181
  
• Seung Jin Lim, Yiu-Kai Ng:
  A Heuristic Approach for Converting HTML Documents to XML Documents. 1182-1196
  
• Laurent Allain, Pascal Yim:
  Specification of an Active Database System Application Using Dynamic Relation Nets. 1197-1209
  
• Mutsumi Nakamura, Chitta Baral:
  Invariance, Maintenance, and Other Declarative Objectives of Triggers - A Formal Characterization of Active Databases. 1210-1224
  

Logic Programming: Implementations and Applications

• Paul Tarau:
  Fluents: A Refactoring of Prolog for Uniform Reflection an Interoperation with External Objects. 1225-1239
  
• Bart Demoen, Phuong-Lan Nguyen:
  So Many WAM Variations, So Little Time. 1240-1254
  
• Nancy Mazur, Gerda Janssens, Maurice Bruynooghe:
  A Module Based Analysis for Memory Reuse in Mercury. 1255-1269
  
• Maria J. García de la Banda, Peter J. Stuckey, Warwick Harvey, Kim Marriott:
  Model Checking in HAL. 1270-1284
  
• Inês de Castro Dutra, Vítor Santos Costa, Ricardo Bianchini:
  The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems. 1285-1299
  
• Steve Barker:
  Data Protection by Logic Programming. 1300-1314
  
• Chuck Liang:
  A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language. 1315-1329
  
• Pablo Gervás:
  A Logic Programming Application for the Analysis of Spanish Verse. 1330-1344
  
• Manuel V. Hermenegildo:
  A Documentation Generator for (C)LP Systems. 1345-1361
  
• Joseph Gartner, Terrance Swift, Allen Tien, Carlos Viegas Damásio, Luís Moniz Pereira:
  Psychiatric Diagnosis from the Viewpoint of Computational Logic. 1362-1376