Integrating abductive logic programming and description logics in a dynamic contracting architecture
MetadataShow full item record
In Semantic Web technologies, searching for a service means to identify, components that can potentially satisfy the user needs in terms of outputs and effects (discovery), and that, when invoked by the customer can fruitfully interact with her (contracting). In this paper we present an application framework that encompasses both the discovery and the contracting steps, in a unified search process. In particular we accommodate service discovery by ontology-based reasoning, and contracting by automated reasoning about policies published in a formal language. To this purpose, we consider a formal approach grounded on Computational Logic, and Abductive Logic Programming in particular We propose a framework, called SCIFF Reasoning Engine, able to establish, by ontological and abductive reasoning, if a semantic web service and a requester can fruitfully inter-operate, taking as input the behavioural interfaces of both the participants, and producing as output a sort of a contract.
Showing items related by title, author, creator and subject.
Chesani, F; Mello, P; Montali, M; Torroni, P (CEUR, 2008)The Service Oriented Architecture paradigm, and its implementation based on Web Services, have been the object of an intense research and standardization activity. One of the most challenging open research issues is the ...
Alberti M; Chesani F; Gavanelli M; Lamma E; Mello P; Montali M; Torroni P (IBFI, 2007)In this article, we propose to adopt the SCIFF abductive logic language to specify business contracts, and show how its proof procedures are useful to verify contract execution and fulfilment. SCIFF is a declarative language ...
Alberti, M; Chesani, F; Gavanelli, M; Lamma, E; Mello, P; Montali, M; Torroni, P (Taylor & Francis (Routledge): SSH Titles, 2008)SCIFF is a declarative language, based on abductive logic programming, that accommodates forward rules, predicate definitions, and constraints over finite domain variables. Its abductive declarative semantics can be related ...