Syntax
Abductive logic programs have three components, where:
- P is a logic program of exactly the same form as in Logic Programming
- A is a set of predicate names, called the abducible predicates
- IC is a set of first order classical formulae.
Normally, the logic program P does not contain any clauses whose head (or conclusion) refers to an abducible predicate. (This restriction can be made without loss of generality.) Also in practice, many times the integrity constraints in IC are often restricted to the form of denials, i.e. clauses of the form:
false:- A1,...,An, not B1, ..., not Bm.Such a constraint means that it is not possible for all A1,...,An to be true and at the same time all of B1,...,Bm to be false.
Read more about this topic: Abductive Logic Programming