Logic programming : proceedings of the 1998 Joint International Conference and Symposium on Logic Programming
Author(s)
Bibliographic Information
Logic programming : proceedings of the 1998 Joint International Conference and Symposium on Logic Programming
（Logic programming）
MIT Press, c1998
Available at 18 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C-P||Manchester||1998.698035610
Note
"Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, June 15-19, 1998, Manchester, England" -- cover
Includes bibliographical references and index
Description and Table of Contents
Description
Includes tutorials, lectures, and refereed papers on all aspects of logic programming,
The Joint International Conference and Symposium on Logic Programming, sponsored by the Association for Logic Programming, includes tutorials, lectures, and refereed papers on all aspects of logic programming, including theoretical foundations, constraints, concurrency and parallelism, deductive databases, language design and implementation, nonmonotonic reasoning, and logic programming and the Internet.
Table of Contents
- Invited papers: the pi calculus and its applications (keynote address), R. Milner
- disjunctive linear programming - at the intersection of operations research and logic programming, K. McAloon
- inductive logic programming for relational knowledge discovery, N. Laurac. Refereed papers: co-definite set constraints with membership expressions, P. Devienne et al
- on the representation and management of finite sets in CLP languages, A. Dovier et al
- meta-linear constraints in constraint logic programming, P. Refalo
- a high-level intermediate language and the algorithms for compiling finite-domain constraints, N-F. Zhou
- distance - a new metric for controlling granularity for parallel execution, K. Shen et al
- visAll - a universal tool to visualise parallel execution of logic programs, N. Fonseca
- prof-theoretic foundation of compilation in logic programming languages, I. Cervesato
- abstract compilation of lambda-prologue, F. Malesieux et al
- efficient implementation of a linear logic programming language, J.S. Hodas et al
- normal forms for defeasible logic, G. Antoniou et al
- regular extension semantics and disjunctive Eshghi Kowalski procedure, J-H. You et al
- beyond success and failure, S. Etalle, F. van Raamsdonk
- source-to-source prologue program compression, P. Devienne et al
- program specialisation and abstract interpretation reconciled, M. Leuschel
- termination analysis - some practical properties of the norm and level mapping space, S. Decorte, D. De Schreye
- on logically justified updates, M. Dekhtyar et al
- iterated logic program updates, J.A. Leite, L.M. Pereira
- specialising the other way around, W. Vanhoof et al
- greedy algorithms in Datalog with choice and negation, S. Greco, C. Zaniolo
- on the optimality of scheduling strategies in subsumption-based tabled resolution, P. Rao et al
- admissible graph rewriting and narrowing, R. Echahed, J-C. Janodet. Poster abstracts: applications of abductive logic programming, A.C. Kakas, A. Michael
- relationships between partial consistencies over continuous domains, H. Collavizza et al
- controlling search in functional logic programs, M. Hanus, F. Steiner
- a solver collaboration in BALI, E. Monfroy
- integration of CLP and stochastic optimization strategies, A. Ruiz-Andino, J.J. Ruz
- a generic type system for CLP(X)
- implementing randomised algorithms in constraint logic programming, N. Angelopoulos et al
- Horn logic denotations, G. Gupta
- towards early projection in CLP(R), A. Fordan, R.H.C. Yap.
by "Nielsen BookData"