Document - eBookmela
Loading...

Computational logic CL 2000 : First International Conference, London, UK, July 24 28, 2000 : proceedings | CL 2000 (2000 : London, England), Lloyd, J. W. (John Wylie), 1947-, SpringerLink (Online service)

Likes0
Telegram icon Share on Telegram

Computational logic CL 2000 : First International Conference, London, UK, July 24 28, 2000 : proceedings

User Rating: Be the first one!

Author: CL 2000 (2000 : London, England), Lloyd, J. W. (John Wylie), 1947-, SpringerLink (Online service)

Added by: sketch

Added Date: 2015-12-30

Publication Date: 2000

Language: eng

Subjects: Computer logic

Publishers: Berlin ; New York : Springer

Collections: folkscanomy miscellaneous, folkscanomy, additional collections

ISBN Number: 3540677976

Pages Count: 300

PPI Count: 300

PDF Count: 1

Total Size: 705.21 MB

PDF Size: 15.47 MB

Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc

Edition: [Elektronische Ressource]

Archive Url

Downloads: 632

Views: 682

Total Files: 18

Media Type: texts

Description

Computational Logic — CL 2000: First International Conference London, UK, July 24–28, 2000 Proceedings
Author: John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, Peter J. Stuckey
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67797-0
DOI: 10.1007/3-540-44957-4

Table of Contents:

  • Computational Logic: Memories of the Past and Challenges for the Future
  • ILP: Just Do It
  • Databases and Higher Types
  • A Denotational Semantics for First-Order Logic
  • Logic, Knowledge Representation, and Bayesian Decision Theory
  • Logic Program Synthesis in a Higher-Order Setting
  • Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
  • Binary Speed Up for Logic Programs
  • A New Module System for Prolog
  • Partial Models of Extended Generalized Logic Programs
  • Alternating Fixpoint Theory for Logic Programs with Priority
  • Proving Failure in Functional Logic Programs
  • Semantics of Input-Consuming Logic Programs
  • A Denotational Semantics of Defeasible Logic
  • Isoinitial Semantics for Logic Programs
  • Abstract Syntax for Variable Binders: An Overview
  • Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic
  • Efficient EM Learning with Tabulation for Parameterized Logic Programs
  • Model Generation Theorem Proving with Finite Interval Constraints
  • Combining Mobile Processes and Declarative Programming

Includes bibliographical references and index
eBookmela
Logo
Register New Account