An abductive proof procedure handling active rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2829, Issue , 2003, Pages 105-117

  Mancarella, Paolo ^a   Terreni, Giacomo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; FORMAL LOGIC;

ABDUCTIVE LOGIC PROGRAMMING; ACTIVE RULES; BACKWARD REASONING; FORWARD REASONING; INTEGRITY CONSTRAINTS; PROOF PROCEDURES;

ARTIFICIAL INTELLIGENCE; DATA HANDLING;

ABDUCTIVE LOGIC PROGRAMMING; ABDUCTIVE PROOF PROCEDURE; ACTIVE RULES; LOGIC EXTENSION;

EID: 7444260676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39853-0_9     Document Type: Conference Paper

References (15)

1. [1] A. Bondarenko, P.M. Dung, R.A. Kowalski, F. Toni. An abstract, argumentationtheoretic approach to default reasoning. Artificial Intelligence 93(1-2), pp. 63-101. 1997.
2. [2] M. Denecker and D. De Schreye. SLDNFA: an abductive procedure for normal abductive programs. In K. Apt, editor, Proc. International Conference and Symposium on Logic Programming, pp. 686–700, MIT press, 1992.
3. [3] K. Eshghi, R. A. Kowalski. Abduction compared with negation by failure. Proc. 6th International Conference on Logic Programming, pp. 234-254. MIT Press, 1989.
4. [4] T. H Fung and R.A. Kowalski. The iff procedure for abductive logic programming. Journal of logic programming 33(2), pp. 151-165. Elsevier, 1990.
5. [5] M. Gelfond and V. Lifschitz. The stable model semantics for logic programs. In K. Bowen and R. A. Kowalski, editors, Proc. International Conference and Symposium on Logic Programming, pp. 1070–1080, MIT press, 1988.
6. [6] A.C. Kakas, R.A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719–770, 1993.
7. [7] A. C. Kakas, R.A. Kowalski, F. Toni. The role of abduction in Logic Programming. Handbook of Logic in AI and Logic Programming 5, pp. 235-324. OUP, 1998.
8. [8] A. C. Kakas and P. Mancarella. Generalised stable models: a semantics for abduction. Proceedings 9th European Conference on AI, pp. 385-391. Pitman, 1990.
9. [9] A. C. Kakas, P. Mancarella. Abductive Logic Programming. Proceedings NACLP Workshop on Non-Monotonic Reasoning and Logic Programming. Austin, 1990.
10. [10] A. C. Kakas, A. Michael, and C. Mourlas. Aclp: Abductive constraint logic programming. Journal of Logic Programming, 44(1-3):129–177, July-August 2000.
11. [11] P. Mancarella, D. Pedreschi, and S. Ruggieri. Negation as failure through abduction: reasoning about termination. Computational Logic: Logic Programming and Beyond, Springer-Verlag LNAI 2407, pp. 240-272, 2002.
12. [12] F. Sadri, F. Toni, and P. Torroni. An abductive logic programming architecture for negotiating agents. Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA’02), Springer-Verlag LNAI 2424, pp. 419-431, 2002.
13. [13] F. Sadri and F. Toni. Abduction with Negation As Failure for Active and Reactive Rules. Department of Computing, Imperial College, London.
14. [14] G. Terreni. Estensione di procedure abduttive al trattamento di vincoli attivi. (in Italian), Laurea Degree Thesis, Dipartimento di Informatica, Univ. di Pisa, 2002.
15. [15] F. Toni. Abductive logic programming. PhD Thesis, Department of Computing, Imperial College, London. 1995.