No abstract

No abstract

In this paper, we present a Description Logic approach-fully compliant with the Semantic web vision and technologies to extended matchmaking between demands and supplies in a semantic-enabled Electronic Marketplace, which allows the semantic-based treatment of negotiable and strict requirements in the demand/supply descriptions. To this aim, we exploit two novel non-standard Description Logic inference services, Concept Contraction-which extends sat-isfiability-and Concept Abduction-which extends subsumption. Based on these services, we devise algorithms, which allow to find negotiation spaces and to determine the quality of a possible match, also in the presence of a distinction between strictly required and optional elements. Both the algorithms and the semantic-based approach are novel, and enable a mechanism to boost logic-based discovery and negotiation stages within an e-marketplace. A set of simple experiments confirm the validity of the approach.

No abstract

In this paper, we present a Description Logic approach -fully compliant with the Semantic web vision and technologies -to extended matchmaking between demands and supplies in a semantic-enabled Electronic Marketplace, which allows the semantic-based treatment of negotiable and strict requirements in the demand/supply descriptions. To this aim, we exploit two novel non-standard Description Logic inference services, Concept Contraction -which extends satisfiability -and Concept Abduction -which extends subsumption. Based on these services, we devise algorithms, which allow to find negotiation spaces and to determine the quality of a possible match, also in the presence of a distinction between strictly required and optional elements. Both the algorithms and the semantic-based approach are novel, and enable a mechanism to boost logic-based discovery and negotiation stages within an e-marketplace. A set of simple experiments confirm the validity of the approach.

No abstract

No abstract

We present an approach to automatic checking of the correctness of web applications structure during their lifecycle. The approach adopts the well-established symbolic model checking technique and the associated tool SMV [13]. A formalism allows the designer to describe the model of a web-based system. Computation Tree Logic (CTL) is adopted as language to define the properties to be verified.The approach has been implemented in a tool to provide automatic support in the design of web applications. The system embeds the NuSMV [1] model checker to perform verification. Verification is carried out after build-ing the finite state model of a site in the model checker input language. To this purpose the system parses the HTML source code of web pages, including code for dynamic pages. Properties are expressed using a user friendly interface for web application developers that automatically translates properties in CTL formulas.