{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:04:04Z","timestamp":1762459444467,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,8,18]],"date-time":"2015-08-18T00:00:00Z","timestamp":1439856000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We develop formal foundations for notions and mechanisms needed to support\nservice-oriented computing. Our work builds on recent theoretical advancements\nin the algebraic structures that capture the way services are orchestrated and\nin the processes that formalize the discovery and binding of services to given\nclient applications by means of logical representations of required and\nprovided services. We show how the denotational and the operational semantics\nspecific to conventional logic programming can be generalized using the theory\nof institutions to address both static and dynamic aspects of service-oriented\ncomputing. Our results rely upon a strong analogy between the discovery of a\nservice that can be bound to an application and the search for a clause that\ncan be used for computing an answer to a query; they explore the manner in\nwhich requests for external services can be described as service queries, and\nexplain how the computation of their answers can be performed through\nservice-oriented derivatives of unification and resolution, which characterize\nthe binding of services and the reconfiguration of applications.<\/jats:p>","DOI":"10.2168\/lmcs-11(3:3)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:46:02Z","timestamp":1479735962000},"source":"Crossref","is-referenced-by-count":2,"title":["Service-Oriented Logic Programming"],"prefix":"10.46298","volume":"Volume 11, Issue 3","author":[{"given":"Ionut","family":"Tutu","sequence":"first","affiliation":[]},{"given":"Jose Luiz","family":"Fiadeiro","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2015,8,18]]},"reference":[{"key":"981:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1579\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1579\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:07:04Z","timestamp":1681243624000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,18]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(3:3)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1504.05797","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1504.05797","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2015,8,18]]},"article-number":"1579"}}