Verifiable agent interaction in abductive logic programming
Open Access
- 29 August 2008
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 9 (4) , 1-43
Abstract
SCIFF is a framework thought to specify and verify interaction in open agent societies. The SCIFF language is equipped with a semantics based on abductive logic programming; SCIFF's operational component is a new abductive logic programming proof procedure, also named SCIFF, for reasoning with expectations in dynamic environments. In this article we present the declarative and operational semantics of the SCIFF language, and the termination, soundness, and completeness results of the SCIFF proof procedure, and we demonstrate SCIFF's possible application in the multiagent domain.Keywords
Funding Information
- Ministero dell'Istruzione, dell'Università e della Ricerca (2005-0112932005-015491)
- European Commission (IST-2001-32530)
This publication has 45 references indexed in Scilit:
- Mapping deontic operators to abductive expectationsComputational and Mathematical Organization Theory, 2006
- Verifying Multi-agent Programs by Model CheckingAutonomous Agents and Multi-Agent Systems, 2006
- ACLP: Abductive Constraint Logic ProgrammingThe Journal of Logic Programming, 2000
- Theory and practice of constraint handling rulesThe Journal of Logic Programming, 1998
- SLDNFA: An abductive procedure for abductive logic programsThe Journal of Logic Programming, 1998
- The IFF proof procedure for abductive logic programmingThe Journal of Logic Programming, 1997
- Constraint logic programming: a surveyThe Journal of Logic Programming, 1994
- Logic programming and negation: A surveyThe Journal of Logic Programming, 1994
- Negation in logic programmingThe Journal of Logic Programming, 1987
- A different approach to deontic logic: deontic logic viewed as a variant of dynamic logic.Notre Dame Journal of Formal Logic, 1987