Marina Mongiello

Learn More
Motivated by the matchmaking problem in electronic marketplaces, we study abduction in Description Logics. We devise suitable definitions of the problem, and show how they can model commonsense reasoning usually employed in analyzing classified announcements having a standardized terminology. We then describe a system partially implementing these ideas, and(More)
More and more resources are becoming available on the Web, and there is a growing need for infrastructures that, based on advertised descriptions, are able to semantically match demands with supplies.We formalize general properties a matchmaker should have, then we present a matchmaking facilitator, compliant with desired properties.The system embeds a(More)
In this paper we present a Description Logic approach to extended matchmaking between Demands and Supplies in an Electronic Marketplace, which allows the semantic-based treatment of negotiable and strict requirements in the description.To this aim we exploit two novel non-standard Description Logic inference services, Concept Contraction -which extends(More)
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, showing that the upper bound of our approach meets the complexity lower bound. The work is motivated by the need to offer a uniform approach to reasoning services useful in(More)
This paper investigates the combined use of query by sketch and relevance feedback as techniques to ease user interaction and improve retrieval effectiveness in content-based image retrieval over the World Wide Web. To substantiate our ideas we implemented DrawSearch, a prototype image retrieval by content system that uses color, shape and texture to index(More)
Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are peers in the transaction. Peer-to-Peer (P-2-P) e-commerce calls for an infrastructure treating in a uniform way supply and demand, which should base the match on a common ontology(More)
Fast and reliable development of Web Applications (WA) calls for methods that address systematic design, and tools that cover all the aspects of the design process and complement the current implementation technologies. To ensure the reliability of WA it is important that they be validated and verified at early design phase. We focus on black-box, automated(More)
In this paper we propose a formal method for web applications verification. The verification process is carried out by checking that either the system always satisfies a model of the specifications or by producing a counter-example.We represent the system as a Kripke structure and model a web site as a graph. Model checking is reformulated as checking that(More)