The IFF proof procedure for abductive logic programming

The Journal of Logic Programming - Tập 33 Số 2 - Trang 151-165 - 1997
Tze Ho Fung, Robert Kowalski

Tóm tắt

Từ khóa


Tài liệu tham khảo

Console, 1991, On the relationship between abduction and deduction, J. Logic and Computation, 2, 661, 10.1093/logcom/1.5.661

Denecker, 1992, SLDNFA: An abductive procedure for normal abductive programs, 700

Denecker, 1993, Knowledge representation and reasoning in incomplete logic programming

Fung, 1994, A modified abductive framework

Fung, 1995, Abduction with Clark completion

Fung, 1996, Abduction by deduction

Kakas, 1990

Kakas, 1990, Database updates through abduction, 650

Kowalski, 1991, Logic programming in artificial intelligence

Kowalski, 1994, Towards a declarative and efficient glass-box CLP language

Kowalski, 1996

Kunen, 1987, Negation in logic programming, J. Logic Programming, 4, 231, 10.1016/0743-1066(87)90007-0

Martelli, 1982, An efficient unification algorithm, Trans. Programming Languages and Syst., 4, 258, 10.1145/357162.357169

Wetzel, 1995, A theorem-proving approach to CLP, 63

Kowalski, 1995, Using meta-logic to reconcile reactive with rational agents

Kowalski, 1996, Towards a unified agent architecture that combines rationality with reactivity

Eshghi, 1988

Kakas, 1993, Abductive logic programming, J. Logic and Computation, 2, 719, 10.1093/logcom/2.6.719