Computational Logic: Symposium Proceedings, Brussels, November 13/14, 1990
John Wylie Lloyd
Springer-Verlag GmbH, 1990 - Computers - 211 pages
This book contains papers presented at the Symposium on Computational Logic held during the 7th ESPRIT Conference. Ten leading researchers in computational logic were invited to contribute papers. The papers range from some on specialized research topics to some which give an overview and a glimpse into the future of computational logic. A major theme of the symposium was the likely future impact of computational logic, and there was a panel session on the topic 'Programming in 2010: the Role of Computational Logic'. The position papers of the panelists are included in the book. The book will be of interest to researchers and graduate students in logic programming, database systems, artificial intelligence, and software engineering. This volume is the first of the ESPRIT Basic Research Series. The ESPRIT Basic Research efforts aim at forging strong links between European academic and industrial teams carrying out research, often interdisciplinary, at the forefront of information technology. The quality of content of this series and its broad distribution should have a major impact in making these advances accessible to both academic and industrial researchers.
30 pages matching integrity constraints in this book
Results 1-3 of 30
What people are saying - Write a review
We haven't found any reviews in the usual places.
abduction algorithm answer argument Artificial Intelligence assumption atom autoepistemic logic Boolean circumscription computational logic concept constraints concept description concept languages consequence constants constrained clauses constraint theory construction default logic default reasoning default theory defined definition demo demo(T denote direct successor disjunctive disjunctive normal form domain equivalent example exists expresses extended concept tree extensions F-consequences finite first-order logic fixpoint FOPCE formal formula free variables function given goal ground instance Herbrand interpretation Horn clause input integrity constraints KFOPCE knowledge assimilation knowledge representation Kowalski left terminating programs Lemma level mapping Levesque Lifschitz metainterpreter metalevel metalogic modal logic mode multiset multiset ordering negation by failure node operator parameters problem procedure Prolog III Prolog programs Proposition prove query evaluation Raymond Reiter Reiter relation result semantics sequence solution solve specifications structure subset successful instance synthesise technique Th(V theorem transformation tree computed true universally satisfiable wrt Tz