John W. Lloyd

Learn More
D This paper introduces extended programs and extended goals for logic programming. A clause in an extended program can have an arbitrary first-order formula as its body. Similarly, an extended goal can have an arbitrary first-order formula as its body. The main results of the paper are the soundness of the negation as failure rule and SLDNF-resolution for(More)
Escher is a general-purpose, declarative programming language that integrates the best features of both functional and logic programming languages. It has types and modules, higher-order and meta-programming facilities, concurrency, and declarative input/output. The main design aim is to combine in a practical and comprehensive way the best ideas of(More)
This paper brings together two strands of machine learning of increasing importance: kernel methods and highly structured data. We propose a general method for constructing a kernel following the syntactic structure of the data, as defined by its type signature in a higher-order logic. Our main theoretical result is the positive definiteness of any kernel(More)
This paper continues the development of a foundation for deductive database systems begun in [6], [7], and [8]. The result of this paper is a simplification theorem for static integrity constraint checking in stratified databases. This result extends an earlier version of the theorem in [7] for definite databases. Integrity constraint checking is an(More)
Give us 5 minutes and we will show you the best book to read today. This is it, the logic for learning learning comprehensible theories from structured data 1st edition that will be your best choice for better reading book. Your five times will not spend wasted by reading this website. You can take the book as a source to make better concept. Referring the(More)