## Computational Logic--CL 2000: First International Conference, London, UK, July 24-28, 2000 : Proceedings (Google eBook)These are the proceedings of the First International Conference on Compu- tional Logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. The conference was collocated with the following events: { 6th International Conference on Rules and Objects in Databases (DOOD 2000) { 10th International Workshop on Logic-based Program Synthesis and Tra- formation (LOPSTR 2000) { 10th International Conference on Inductive Logic Programming (ILP 2000). CL 2000 consisted of seven streams: { Program Development (LOPSTR 2000) { Logic Programming: Theory and Extensions { Constraints { Automated Deduction: Putting Theory into Practice { Knowledge Representation and Non-monotonic Reasoning { Database Systems (DOOD 2000) { Logic Programming: Implementations and Applications. The LOPSTR 2000 workshop constituted the program development stream and the DOOD 2000 conference constituted the database systems stream. Each stream had its own chair and program committee, which autonomously selected the papers in the area of the stream. Overall, 176 papers were submitted, of which 86 were selected to be presented at the conference and appear in these proceedings. The acceptance rate was uniform across the streams. In addition, LOPSTR 2000 accepted about 15 extended abstracts to be presented at the conference in the program development stream. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

XLVI | 718 |

XLVII | 733 |

XLVIII | 747 |

XLIX | 762 |

L | 777 |

LI | 792 |

LII | 807 |

LIII | 837 |

IX | 131 |

X | 149 |

XI | 164 |

XII | 179 |

XIII | 194 |

XIV | 209 |

XV | 223 |

XVI | 239 |

XVII | 254 |

XVIII | 269 |

XIX | 285 |

XX | 300 |

XXI | 315 |

XXII | 326 |

XXIII | 342 |

XXIV | 358 |

XXV | 373 |

XXVI | 384 |

XXVII | 399 |

XXVIII | 414 |

XXIX | 429 |

XXX | 448 |

XXXI | 463 |

XXXII | 508 |

XXXIII | 523 |

XXXIV | 538 |

XXXV | 553 |

XXXVI | 568 |

XXXVII | 583 |

XXXVIII | 598 |

XXXIX | 613 |

XL | 629 |

XLI | 644 |

XLII | 660 |

XLIII | 673 |

XLIV | 688 |

XLV | 703 |

LIV | 852 |

LV | 867 |

LVI | 882 |

LVII | 897 |

LVIII | 912 |

LIX | 926 |

LX | 942 |

LXI | 957 |

LXII | 972 |

LXIII | 987 |

LXIV | 1002 |

LXV | 1017 |

LXVI | 1033 |

LXVII | 1048 |

LXVIII | 1063 |

LXIX | 1078 |

LXX | 1094 |

LXXI | 1106 |

LXXII | 1121 |

LXXIII | 1137 |

LXXIV | 1152 |

LXXV | 1167 |

LXXVI | 1182 |

LXXVII | 1197 |

LXXVIII | 1210 |

LXXIX | 1225 |

LXXX | 1240 |

LXXXI | 1255 |

LXXXII | 1270 |

LXXXIII | 1285 |

LXXXIV | 1300 |

LXXXV | 1315 |

LXXXVI | 1330 |

LXXXVII | 1345 |

LXXXVIII | 1362 |

1377 | |

### Common terms and phrases

abduction abstract action algorithm answer set applied approach Artificial Intelligence association rules atom axioms Bayesian networks binary bisimulation Boolean Boolean circuits called clauses complete Computer Science configuration conjunction consider consistent Constraint Logic Programming constraint programming constraint solver constraint store construct contains database declarative default defeasible logic defined definition denote derivation disjunction domain equivalent example expression extended finite fluent calculus formal formula framework function given goal Horn clauses implementation induction inference initial input instantiated interpretation itemsets IV-MGTP language Lemma literals logic pro method minimal model checking module negation node nonmonotonic operational semantics operator Petri nets possible predicate problem Proc procedure Prolog proof planning propagation properties Proposition query reasoning recursive relation represent representation satisfies semantics sequence solving specific Springer-Verlag stable model strategy subset symbols Theorem theory transformation transition tree update values well-founded well-founded semantics

### Popular passages

Page 39 - Sternberg. Drug design by machine learning: The use of inductive logic programming to model the structure-activity relationships of trimethoprim analogues binding to dihydrofolate reductase.

Page 38 - In Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, Heidelberg, Germany, 1999.

Page 17 - Who of us would not be glad to lift the veil behind which the future lies hidden; to cast a glance at the next advances of our science and at the secrets of its development during future centuries?

Page 23 - ... and the question is urged upon us whether mathematics is doomed to the fate of those other sciences that have split up into separate branches, whose representatives scarcely understand one another and whose connection becomes ever more loose. I do not believe this nor wish it. Mathematical science is in my opinion an indivisible whole, an organism whose vitality is conditioned upon the connection of its parts. For with all the variety of mathematical knowledge, we are still clearly...

Page 23 - But, we ask, with the extension of mathematical knowledge will it not finally become impossible for the single investigator to embrace all departments of this knowledge? In answer let me point out how thoroughly it is ingrained in mathematical science that every real advance goes hand in hand with the invention of sharper tools and simpler methods which at the same time assist in understanding earlier theories and cast aside older more complicated developments. It is therefore possible for the individual...