Abduction with negation as failure for active and reactive rules

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

Volumn 1792, Issue , 2000, Pages 49-60

  Sadri, Fariba ^a   Toni, Francesca ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS; DATABASE SYSTEMS; INTELLIGENT AGENTS; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

ABDUCTIVE LOGIC PROGRAMMING; ABDUCTIVE LOGIC PROGRAMS; ACTIVE BEHAVIOURS; ACTIVE DATABASE MANAGEMENT SYSTEM; INTEGRITY CONSTRAINTS; NEGATION AS FAILURES; REACTIVE BEHAVIOUR; SOUNDNESS AND COMPLETENESS;

INTELLIGENT DATABASES;

EID: 77951981488     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. Clark, K.L.; 1978. Negation as failure. Logic and Data Bases, 293–322, Plenum, NY.
2. Console, L.; Theseider Dupré, D.; Torasso, P.; 1991. On the relationship between abduction and deduction. Journal of Logic and Computation 2(5): 661–690, OUP.
3. Denecker, M.; De Schreye, D.; 1997. SLDNFA: an abductive procedure for abductive logic programs. Journal of Logic Programming 34(2): 111–167, Elsevier.
4. Dung, P.M.; Mancarella, P.; 1996. Production systems need negation as failure. Proc. 13th AAAI, AAAI Press.
5. Fung, T.H.; Kowalski, R.A.; 1997. The iff procedure for abductive logic programming. Journal of Logic Programming 33(2):151–165, Elsevier.
6. Gelfond, M.; Lifschitz, V.; 1988. The stable model semantics for logic programming. Proc. 5th ICLP 1070–1080, MIT Press.
7. Huhns, M.N.; Singh M.P. (eds); 1997. Readings in Agents, Morgan Kaufman.
8. Inoue, K.; Koshimura, M.; Hasegawa, R.; 1992. Embedding negation as failure into a model generation theorem prover. Proc. 11th CADE, LNAI 607:400–415, Springer.
9. Kakas, A.C.; Kowalski, R.A.; Toni, F.; 1998. The role of abduction in logic programming. Handbook of Logic in AI and Logic Programming 5:235–324, OUP.
10. Kakas, A.C.; Mancarella, P.; 1990. Abductive Logic Programming. Workshop on Non-Monotonic Reasoning and Logic Programming.
11. Kowalski, R.A.; Sadri, F.; 1999. From Logic Programming to Multi-agent Systems. Annals of Mathemathics and Artificial Intelligence (Forthcoming).
12. Kowalski, R.A.; Toni, F.; Wetzel, G.; 1998. Executing suspended logic programs. Fundamenta Informaticae 34(3):203–224, ISO Press.
13. Martelli, A.; Montanari, U.; 1982. An efficient unification algorithm. ACM Trans. on Prog. Lang. and Systems 4(2):258–282.
14. Poole, D.; 1988. A logical framework for default reasoning. Artificial Intelligence 36:27–47, Elsevier.
15. Rao, A.S.; Georgeff, M.P.; 1992. An abstract architecture for rational agents. Proc. 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning
16. Shanahan, M.; 1997. Event calculus planning revisited. Proc. 4th European Conference on Planning 390–402, LNAI 1348, Springer.
17. Widom, J.; Ceri, S.; 1996. Active Database Systems: Triggers and Rules for Advanced Database Processing, Morgan Kaufmann.