Logic Programming: Formal Methods and Practical Applications
Christoph Beierle, Lutz Plümer · Medical Entomology and Zoology · 1994
Part 1 Foundations: goal-directed forward chaining - a tuple-oriented bottom-up approach, W. Burgard from magic sets to a tuple-oriented approach comparing magic sets and goal-directed forward chaining computing relevant atoms GDFC-resolution termination of GDFC-resolution efficiency of GDFC-resolution the WAM - definition and compiler correctness, E. Borger and D. Rosenzweig evolving algebras prolog - tree and stack models predicate structure clause structure term structure. Appendices: rules for prolog tree model rules for compiled predicate structure rules for compiled clause structure rules for the WAM automatic verification of parallel logic programs - termination, L. Plumer basic notions directed programs and oriented derivations well-formed programs program transformation automatic termination proofs derivation of linear predicate inequalities for well-formed programs final remarks. Part 2 Language aspects and methodology: logic program modules for interoperable information systems, A.B. Cremers et al interoperability EPSILON building interoperable systems with links concepts, implementation, and applications of a typed logic programming language, C. Beierle concepts of PROTOS-L the PROTOS-L system planning applications further work polymorphic feature types, G. Meyer types and subtyping typed logic programming parametric polymorphism and feature types formal aspects further work efficient object-oriented programming in prolog, P. Schachte and G. Saab the objects package - a precursor to classes the second version - the classes package implementation of classes results examples future work related work. Part 3 Constraints: combinatorial problem solving in constraint logic programming with cooperating solvers, H. Beringer and B. De Backer a primer to constraint logic programming using CLP as a tool for combinatorial problem solving the domain reduction solver the real linear solver making the different solvers communicate using constraint logic programming for industrial scheduling problems, S. Breitinger and H.C.R. Lock constraints in scheduling problems disjunctive constraints heuristics - a guide to search related work. Part 4 Applications: a generic scheduling framework developed in prolog, L. Sterling and V. Srinivasan the scheduling problem - a generic solution specification of scheduler clusters schedule generation evaluation of experiments scheduling and meta-scheduling, J. Sauer the scheduling problem scheduling in PROTOS meta-scheduling dynamic and meta-scheduling knowledge representation of scheduling knowledge by heuristics META_PLAN - using dynamic scheduling knowledge robot control systems as contextual logic programs, E. Denti et al contextual logic programming systems the CARA robot programming support. (Part contents).