<p>This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic.</p>

From Logic to Logic Programming (Foundations of Computing) (FOUNDATIONS OF COMPUTING SERIES)

Computers & Technology

Doets, Kees

Computer Science

Mit Pr

<p>Model theory investigates the relationships between mathematical structures ('models') on the one hand and formal languages (in which statements about these structures can be formulated) on the other. Example structures are: the natural numbers with the usual arithmetical operations, the structures familiar from algebra, ordered sets, etc. The emphasis is on first-order languages, the model theory of which is best known. An example result is Löwenheim's theorem (the oldest in the field): a first-order sentence true of some uncountable structure must hold in some countable structure as well. Second-order languages and several of their fragments are dealt with as well. As the title indicates, this book introduces the reader to what is basic in model theory. A special feature is its use of the Ehrenfeucht game by which the reader is familiarised with the world of models.</p>

Basic Model Theory (Studies in Logic, Language, and Information)

Science & Math

Mathematics

Center for the Study of Language and Inf

Model theory investigates the relationships between mathematical structures ('models') on the one hand and formal languages (in which statements about these structures can be formulated) on the other. Example structures are: the natural numbers with the usual arithmetical operations, the structures familiar from algebra, ordered sets, etc. The emphasis is on first-order languages, the model theory of which is best known. An example result is Löwenheim's theorem (the oldest in the field): a first-order sentence true of some uncountable structure must hold in some countable structure as well. Second-order languages and several of their fragments are dealt with as well. As the title indicates, this book introduces the reader to what is basic in model theory. A special feature is its use of the Ehrenfeucht game by which the reader is familiarised with the world of models.

The Haskell Road to Logic, Maths and Programming. Second edition

Eijck, van Jan

Programming

College Publications

See the best price to sell, buy, or rent books by Doets, Kees. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Doets, Kees