Logic Programming
Operational Semantics and Proof Theory
Versandkostenfrei!
Versandfertig in 1-2 Wochen
47,99 €
inkl. MwSt.
PAYBACK Punkte
24 °P sammeln!
A homogeneous treatment of the semantics of both theoretical and practical logic programming languages.Dr Andrews here provides a homogeneous treatment of the semantics (operational and logical) of both theoretical and practical logic programming languages. He shows how the rift between theory and practice in logic programming can be bridged. This is achieved by precisely characterizing the way in which 'depth-first' search for solutions to a logical formula - the usual strategy in most practical languages - is incomplete. Languages that perform 'breadth-first' searches reflect more closely th...
A homogeneous treatment of the semantics of both theoretical and practical logic programming languages.
Dr Andrews here provides a homogeneous treatment of the semantics (operational and logical) of both theoretical and practical logic programming languages. He shows how the rift between theory and practice in logic programming can be bridged. This is achieved by precisely characterizing the way in which 'depth-first' search for solutions to a logical formula - the usual strategy in most practical languages - is incomplete. Languages that perform 'breadth-first' searches reflect more closely the theory underlying logic programming languages. Researchers interested in logic programming or semantics, as well as artificial intelligence search strategies, will want to consult this book as the only source for some essential and new ideas in the area.
Table of content:
1. Introduction; 2. Operational semantics; 3. Characterizing parallel systems; 4. Characterizing sequential systems; 5. Approaches to incompleteness; 6. Summary and future directions; Examples; Index of definitions; Index.
Dr Andrews here provides a homogeneous treatment of the semantics (operational and logical) of both theoretical and practical logic programming languages. He shows how the rift between theory and practice in logic programming can be bridged. This is achieved by precisely characterizing the way in which 'depth-first' search for solutions to a logical formula - the usual strategy in most practical languages - is incomplete. Languages that perform 'breadth-first' searches reflect more closely the theory underlying logic programming languages. Researchers interested in logic programming or semantics, as well as artificial intelligence search strategies, will want to consult this book as the only source for some essential and new ideas in the area.
Table of content:
1. Introduction; 2. Operational semantics; 3. Characterizing parallel systems; 4. Characterizing sequential systems; 5. Approaches to incompleteness; 6. Summary and future directions; Examples; Index of definitions; Index.
Andere Kunden interessierten sich für
