Composition of Semantic Web services using Linear Logic theorem proving

Rao, Jinghai; Küngas, Peep; Matskin, Mihhail

doi:10.1016/j.is.2005.02.005

Cited by 121 publications

(77 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The sequence of plans can be likened to theorem proving [22]. Every subsequent plans will have their preconditions met, and will impose changes for the next plan to drive the variables to what is required by the goal.…”

Section: Planner Modulementioning

confidence: 99%

Service robot planning via solving constraint satisfaction problem

et al. 2016

View full text Add to dashboard Cite

The problem of demographic shifts towards the elderly is deteriorating, as the relative number of caregivers is insufficient to provide the support required for their wellbeing, which is further aggravated by the increasingly hectic lifestyle. Service robot is getting more prominent as a possible solution. Robot manipulation and mobility is an important field, but they also require high level planning for these minute actions in order to provide ample support. Automatic service composition, contributed significantly by web services, offers the necessary technology for the task. Robot planning problem can be solved by representing it as constraint satisfaction problem (CSP) due to it being able to support loose binding of services and variables of wider domain. This paper further extends the structure of the CSP planner to enable intelligent decision-making. Besides, standardization is made on the properties and relationships of objects such that planning rules can be easily generated from knowledge base. Services and their corresponding terms are designed for efficient planning. Case studies show that the system is able to perform tasks bounded by complex logical rules. It also provides valuable insights into future enhancements and research.

show abstract

Section: Planner Modulementioning

confidence: 99%

Service robot planning via solving constraint satisfaction problem

et al. 2016

View full text Add to dashboard Cite

show abstract

“…If the composition engine successes to find a prove, then the composite service description will be generated from that prove. Some of the research efforts within this method could be seen in [48]. The authors utilize the linear logic theorem to compose automatically semantic services.…”

Section: Specification-based Compositionmentioning

confidence: 99%

Untitled

2016

IJWSC

View full text Add to dashboard Cite

show abstract

“…For example, in [41], user requirements and Web services are both described in DAML-S [42], a semantic Web service language, and linear logic programming is used to automatically select the correct services and generate a BPEL or DAML-S process that represents the composite service. Similarly, [43] presents an extension of Golog, a logic programming language for dynamic domains, to compose and execute services described in DAML-S, based on high-level goals defined by users.…”

Section: Related Workmentioning

confidence: 99%