Proceedings of the Workshop on the lambda-Prolog Programming Language

The expressiveness of logic programs can be greatly increased over first-order Horn clauses through a stronger emphasis on logical connectives and by admitting various forms of higher-order quantification. The logic of hereditary Harrop formulas and the notion of uniform proof have been developed to provide a foundation for more expressive logic programming languages. The λ-Prolog language is actively being developed on top of these foundational considerations. The rich logical foundations of λ-Prolog provides it with declarative approaches to modular programming, hypothetical reasoning, higher-order programming, polymorphic typing, and meta-programming. These aspects of λ-Prolog have made it valuable as a higher-level language for the specification and implementation of programs in numerous areas, including natural language, automated reasoning, program transformation, and databases

Tool Support for Finding and Preventing Faults in Rule Bases

This thesis analyzes challenges for the correct creation of rule bases. Based on experiences and data from three rule base development projects, dedicated experiments and a survey of developers, ten main problem areas are identified. Four approaches in the area of Testing, Debugging, Anomaly Detection and Visualization are proposed and evaluated as remedies for these problem areas