ACLP System

Abductive Constraint Logic Programming

ACLP is a system which combines abductive reasoning and constraint solving by integrating the framework of Abductive Logic Programming (ALP) with that of Constraint Logic Programming (CLP). In ACLP the role of abductive reasoning is that of providing an automatic reduction of the high-level problem representation and goals to lower level computational tasks of a general problem independent form. It thus provides a bridge between the high-level problem domain properties and domain-independent solving methods.

The ACLP framework has been applied to the problems of planning and scheduling in order to test its flexibility and computational effectiveness compared with the direct use of the (lower level) constraint solving framework of CLP on which this is built. These experiments provide evidence that the abductive framework of ACLP does not compromise significantly the computational efficiency of the solutions thus indicating the computational viability of the framework for the development of flexible solutions to complex applications.

The ACLP framework is currently implemented on top of the ECLiPSe language of ECRC as a meta-interpreter using explicitly its low-level constraint solver that handles constraints over finite domains (integer and atomic elements).

General ACLP Information

  • How to obtain the system .
  • How to start ACLP .
  • Documentation

  • How to Use the ACLP System .
  • Examples using ACLP .
  • ACLP papers
  • Related papers and technical reports
  • User Information

  • Bug Report
  • A simple Abductive Logic Programming (ALP) System

  • ALP Interpreter .
  • Examples using ALP
  • Interesting Links

  • Abduction (Under Construction)
    If you wish to set up a link with some other pages on abduction please send an e-mail to A.C. Kakas

  • Last modified November 30, 1998