Abduction with negation as failure for active and reactive rules (Q4518912)

Suammary: Recent work has suggested abductive logic programming as a suitable formalism to represent active databases and intelligent agents. In particular, abducibles in abductive logic programs can be used to represent actions, and integrity constraints in abductive logic programs can be used to represent active rules of the kind encountered in active databases and reactive rules incorporating reactive behavior in agents. One would expect that, in this approach, abductive proof procedures could provide the engine underlying active database management systems and the behavior of agents. We analyze existing abductive proof procedures and argue that they are inadequate in handling these applications. The in adequacy is due to the inappropriate treatment of negative literals in f integrity constraints. We propose a new abductive proof procedure and s give examples of how this proof procedure can be used to achieve active behavior in (deductive) databases and reactivity in agents. Finally, we prove some soundness and completeness results for the new proof procedure. For the entire collection see [Zbl 0935.00047].