A logical framework for default reasoning
Artificial Intelligence
Readings in agents
Executing suspended logic programs
Fundamenta Informaticae - Special issue on foundations of constraint programming
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Active Database Systems: Triggers and Rules for Advanced Database Processing
Active Database Systems: Triggers and Rules for Advanced Database Processing
From logic programming towards multi-agent systems
Annals of Mathematics and Artificial Intelligence
Event Calculus Planning Revisited
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Embedding Negation as Failure into a Model Generation Theorem Prover
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Production systems need negation as failure
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Indeed: Interactive Deduction on Horn Clause Theories
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Abduction in Logic Programming
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
An Abductive Logic Programming Architecture for Negotiating Agents
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On Preferring and Inspecting Abductive Models
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Ambient intelligence: A survey
ACM Computing Surveys (CSUR)
Inspecting side-effects of abduction in logic programs
Logic programming, knowledge representation, and nonmonotonic reasoning
Argumentation for access control
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Logic Programs, Norms and Action
| Hi-index | 0.00 |
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 constaints in abductive logic programs can be used to represent active rules of the kind encountered in active databases and reactive rules incorporating reactive behaviour in agents. One would expect that, in this approach, abductive proof procedures could provide the engine underlying active database management systems and the behaviour of agents. We analyse existing abductive proof procedures and argue that they are inadequate in handling these applications. The inadequacy is due to the inappropriate treatment of negative literals in integrity constraints. We propose a new abductive proof procedure and give examples of how this proof procedure can be used to achieve active behaviour in (deductive) databases and reactivity in agents. Finally, we prove some soundness and completeness results for the new proof procedure.