Abductive logic programming: Difference between revisions

Revision as of 16:49, 3 February 2016

Revision as of 17:56, 21 August 2016

Line 9:

* 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.