scientific article; zbMATH DE number 3978351
automatic deductioncomplexitycorrectnessdatabasedebuggingdefinite clause grammarsEdinburg Prologequation solverexpert systemsgame-playing programsincomplete data structureslogic programminglogical deductionmeta-interpretersnegationnon-deterministic programmingparsingproblem solvingProlog programmingrecursive programmingsearch techniquessearch treessecond-order programmingsemanticsWisdom Prolog
It is true that in the last years appeared several books on Prolog and logic programming. Some stress the theoretical foundations, some represent introductory programming techniques. This book, expressing the authors' high competence and experience in the field, represents a new step towards the professional logic and Prolog programming, explaining how specific advanced techniques are used to design and solve more serious applications. A valuable feature met throughout the book: the emphasis on the distinction between logic programming and Prolog programming. The four parts of the book are organized as follows: Part I is a self- contained introduction to logic programming in terms of logical deduction (instead of more frequently met resolution background). Chapters 2 and 3 present, respectively, two basic styles of logic programming: database and recursive programming. Chapter 4 presents a full computaion model of logic programs: unification algoritm and example computations of logic programs are discussed. Chapter 5 briefly reviews results of more theoretical interest: semantics, correctness, complexity, search trees, and negation. Part II represents an introduction to Prolog language features. Chapter 6 discusses the computational model of Prolog as opposed to logic programming, comparing also Prolog with conventional programming languages (like Pascal). Chapter 7 identifies the differences between composing Prolog programs and logic programs, illustrated by examples from basic programming techniques. Chapters 8 to 12 present the basic (built-in) Prolog predicates: arithmetical, structure inspection, meta- logical, cuts and negation, and extra-logical. Part III describes (Chapters 14-19) advanced Prolog techniques: non- deterministic programming, incomplete data structures, parsing with definite clause grammars (DCGs), second-order programming, search techniques, meta-interpreters for expert systems and debugging. The Part IV of the book is concerned with four larger applications: game- playing programs (Mastermind, Nim, Kalah), an equation solver, a credit evaluation expert system, and a compiler for a simple Pascal-type language. The book successfully served for several courses on logic programming and Prolog in United States, Israel and Scotland. The exercises in the book range from very easy to very difficult ones, written mainly in Edinburg Prolog and run on Wisdom Prolog.
- Composing recursive logic programs with clausal join
- Explaining evidential analyses
- Derivation of logic programs by functional methods
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- A Prolog technology theorem prover: A new exposition and implementation in Prolog
- Is default logic a reinvention of inductive-statistical reasoning?
- Implementing tactics and tacticals in a higher-order logic programming language
- Probabilistic Horn abduction and Bayesian networks
- \({\mathcal Z}\)-match: An inference rule for incrementally elaborating set instantiations
- A declarative approach for first-order built-in's of Prolog
- Distributed programming with logic tuple spaces
- Grammatically biased learning: Learning logic programs using an explicit antecedent description language
- Problem solving by searching for models with a theorem prover
- Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures
- Automatic construction of accurate models of physical systems
- An efficient multiple predicate learner
- Is intractability of nonmonotonic reasoning a real drawback?
- Preference Logic Grammars: Fixed point semantics and application to data standardization
- 2D tree object representation via the slope chain code
- Agenda control for heterogeneous reasoners
- Compilation and evaluation of linear mutual recursions
- PAN: A portable, parallel Prolog: Its design, realisation and performance.
- Definite-clause grammars for 2D shape analysis
- Mixed logical-linear programming
- Logic programming: laxness and saturation
- Enigma 1225: Prolog-assisted solution of a puzzle using discrete mathematics
- Model checking multi-agent systems with logic based Petri nets
- A theoretical framework on proactive information exchange in agent teamwork
- Uniform proofs as a foundation for logic programming
- Declarative compilation for constraint logic programming
- Coalgebraic semantics for parallel derivation strategies in logic programming
- scientific article; zbMATH DE number 3900124 (Why is no real title available?)
- scientific article; zbMATH DE number 3963170 (Why is no real title available?)
- scientific article; zbMATH DE number 3967882 (Why is no real title available?)
- Logic and functional programming by retractions
- scientific article; zbMATH DE number 40567 (Why is no real title available?)
- scientific article; zbMATH DE number 48465 (Why is no real title available?)
- Kurs in Logischer Programmierung. (A course in logic programming.)
- scientific article; zbMATH DE number 52885 (Why is no real title available?)
- scientific article; zbMATH DE number 53813 (Why is no real title available?)
- Acquiring object-knowledge
- scientific article; zbMATH DE number 193950 (Why is no real title available?)
- scientific article; zbMATH DE number 194215 (Why is no real title available?)
- scientific article; zbMATH DE number 1208121 (Why is no real title available?)
- scientific article; zbMATH DE number 588034 (Why is no real title available?)
- A metalogic programming approach: language, semantics and applications
- Clause and effect. Prolog programming for the working programmer
- Knowledge representation with multiple logical theories and time
- scientific article; zbMATH DE number 1497829 (Why is no real title available?)
- scientific article; zbMATH DE number 194650 (Why is no real title available?)
- USING META-PROGRAMMING, CONSTRAINT LOGIC PROGRAMMING AND APPROXIMATE REASONING FOR EXPERT SYSTEMS DESIGN
- Patterns for Prolog programming
- scientific article; zbMATH DE number 946439 (Why is no real title available?)
- scientific article; zbMATH DE number 3992919 (Why is no real title available?)
- Set notation as a language to specify data transformation programs
- CLP(ℛ) as a general finite element model definition language
- Optimization by non-deterministic, lazy rewriting
- Logic programs with equational type specifications
- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic
- A refinement of import/export declarations in modular logic programming and its semantics
- Situation calculus specifications for event calculus logic programs
- A new proposal for debugging Datalog programs
- Singular and plural functions for functional logic programming
- Knowledge discovery and data mining in toxicology
- Calculating modules in contextual logic program refinement
- Probabilistic Inductive Logic Programming
- Basic Principles of Learning Bayesian Logic Programs
- Category theoretic semantics for theorem proving in logic programming: embracing the laxness
- Inductive logic programming
- Reasoning about nonlinear system identification
- The accepting power of unary string logic programs
- Network reification as a unified approach to represent network adaptation principles within a network
- Collaborative software infrastructure for adaptive multiple model simulation
- Precedences in specifications and implementations of programming languages
- Difference-list transformation for Prolog
- Virtual time and virtual space
- Proof methods of declarative properties of definite programs
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- The relational machine calculus
- Tony Hoare: his path to the ACM Turing Award
- A demonstrably correct compiler
- The Logiform system
- Transforming generate-and-test programs to execute under committed-choice AND-parallelism
- How to control unfolding when specializing interpreters
- Parsing and generation with static discontinuity grammars
- A mathematical treatment of defeasible reasoning and its implementation.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742689)