Listing 1 - 5 of 5 |
Sort by
|
Choose an application
Choose an application
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.
Logic programming --- Programmation logique --- 681.3*F41 --- 681.3*I23 --- Computer programming --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- Logic programming. --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- COMPUTER SCIENCE/Artificial Intelligence
Choose an application
Choose an application
Choose an application
This book gives a state-of-the-art survey of current research in logic and philosophy of science, as viewed by invited speakers selected by the most prestigious international organization in the field. In particular, it gives a coherent picture of foundational research into the various sciences, both natural and social. In addition, it has special interest items such as symposia on interfaces between logic and methodology, semantics and semiotics, as well as updates on the current state of the field in Eastern Europe and the Far East.
Logic, Symbolic and mathematical --- Science --- Congresses. --- Methodology --- Philosophy --- Philosophy and science. --- Language and languages—Philosophy. --- Ethics. --- History. --- Philosophy of Science. --- Philosophy of Language. --- History, general. --- Annals --- Auxiliary sciences of history --- Deontology --- Ethics, Primitive --- Ethology --- Moral philosophy --- Morality --- Morals --- Philosophy, Moral --- Science, Moral --- Values --- Science and philosophy --- Science - Philosophy - Congresses --- Science - Methodology - Congresses. --- Logic, Symbolic and mathematical - Congresses
Listing 1 - 5 of 5 |
Sort by
|