Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace

@article{Sycara2004LarksDM,
  title={Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace},
  author={Katia P. Sycara and Seth Widoff and Matthias Klusch and Jianguo Lu},
  journal={Autonomous Agents and Multi-Agent Systems},
  year={2004},
  volume={5},
  pages={173-203}
}
Service matchmaking among heterogeneous software agents in the Internet is usually done dynamically and must be efficient. There is an obvious trade-off between the quality and efficiency of matchmaking on the Internet. We define a language called Larks for agent advertisements and requests, and present a flexible and efficient matchmaking process that uses Larks. The Larks matchmaking process performs both syntactic and semantic matching, and in addition allows the specification of concepts… Expand
Matchmaking Support for Mathematical Web Services
Matchmaking is one crucial tasks in agent-based systems and describes locating and identifying the most suitable services among all available services. This paper introduces matchmaking ofExpand
Matchmaking Framework for Mathematical Web Services
TLDR
The effect of pre- and post-conditions of mathematical service descriptions on matching, and how and why to reduce queries into Disjunctive Normal Form (DNF) before matching is considered. Expand
A constraint language approach to matchmaking
  • Chuang Liu, I. Foster
  • Computer Science
  • 14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.
  • 2004
TLDR
A new approach to symmetric matching is presented that achieves significant advances in expressivities relative to the current ClassAds - for example, allowing for multi-way matches, expression and location of resource with negotiable capability. Expand
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
TLDR
This work addresses the problem of matchmaking from a knowledge representation perspective, with a formalization based on Description Logics suitable for modeling matchmaking in a logical framework, and presents reasonable algorithms for semantic matchmaking based on the devised inferences. Expand
Matchmaking algorithms to improve dynamic service matching in ubiquitous environments
TLDR
This paper proposes a new matchmaking algorithm based on the marriage matching algorithm of ATM networks (Gusfield and Irving, 1989) to improve middle agents' performance, complementing shortcomings of existing matching algorithms. Expand
Matchmaking of Mathematical Web Services
TLDR
The problem of matchmaking for mathematical services, where the semantics play a critical role in determining the applicability or otherwise of a service and for which OpenMath descriptions of pre and post-conditions are used, is discussed. Expand
Efficient Algorithm for Service Matchmaking in Ubiquitous Environments
TLDR
This paper addresses issues of existing matching algorithms, and proposes a new matchmaking method adopting the marriage matching algorithm of the ATM network to improve middle agent performance, complementing shortcomings of theexisting matching algorithms. Expand
Ontology based agent services compatible matchmaking mechanism
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) meet a given service request. In this paper, we present ontologyExpand
A System for Principled Matchmaking in an Electronic Marketplace
TLDR
A novel knowledge representation approach is proposed, based on description logics, that is superior to both keyword- and basic subsumption-based matchmaking and shows good correspondence between users and system rankings. Expand
Discovery Process in a B2B eMarketplace: A Semantic Matchmaking Approach
TLDR
The authors extend and apply the exact, partial, and potential match algorithms developed in Di Noia et al. (2004) to show how partial and potential matches can become full matches and describe mechanisms for knowledge representation and exchange to allow partner organizations to seamlessly share information and knowledge to facilitate the discovery process in an eMarketplace context. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 65 REFERENCES
Interoperability among Heterogeneous Software Agents on the Internet
TLDR
There is an obvious need for a standardized, meaningful communication among agents to enable them to perform collaborative task execution and there is a need for some means to help requester agents find providers. Expand
Planning and matchmaking for the interoperation of information processing agents
TLDR
This paper describes a multi-agent system, DALEKS, that supports activities for the information processing domain and discusses the characteristics of planning in this domain and how information processing tools are specified for the planner. Expand
An Overview of Active Information Gathering in InfoSleuth
TLDR
InfoSleuth agents perform a number of complex query activities that require resolving ontology-based queries, including dynamically changing, distributed, heterogeneous resources, including distributed single-resource updates, event monitoring by means of subscription/ notification services, statistical or inferential data analysis, and trend discovery in complex event streams. Expand
Middle-Agents for the Internet
TLDR
A spectrum of middle-agents is identified, characterizes the behavior of three different types, and reports on initial experiments that focus on evaluating performance tradeoffs between matchmaking and brokering middle- agents, according to criteria such as load balancing, robustness, dynamic preferences or capabilities, and privacy. Expand
On Using KQML for Matchmaking
TLDR
Several problematic issues and potential solutions are discussed, including representational challenges in advertising complex databases, the need for persistent requests in information brokering, the dilemm~ between explicit vs. implicit broKQML, problems in error recovery and response timing, consistency among information providers, and efficiency. Expand
Specification matching of software components
TLDR
This work uses formal specifications to describe the behavior of software components and, hence, to determine whether two components match, and gives precise definitions of not just exact match, but, more relevantly, various flavors of relaxed match. Expand
KQML as an agent communication language
TLDR
The design of and experimentation with the Knowledge Query and Manipulation Language (KQML), a new language and protocol for exchanging information and knowledge, which is aimed at developing techniques and methodology for building large-scale knowledge bases which are sharable and reusable. Expand
Carnot and InfoSleuth: database technology and the World Wide Web
The Carnot research project [CARN, WOEL93] at MCC was initiated in 1990 with the goal of addressing the problem of logically unifying physically-distributed, enterprisewide, heterogeneousExpand
A Framework for a Scalable Agent Architecture of Cooperating Heterogeneous Knowledge Sources
TLDR
The conceptual framework underlying SCOPES (Semiotic/Semantic Coordination of Parallel Exploration Spaces), a scalable agent architecture designed to support interoperable, autonomous and heterogeneous knowledge sources, is presented and motivated. Expand
Observer: an approach for query processing in global information systems based on interoperation across pre-existing ontologies
TLDR
A scalable approach for vocabulary sharing is discussed and objects in the repositories are represented as intensional descriptions by preexisting ontologies expressed in Description Logics characterizing information in different domains. Expand
...
1
2
3
4
5
...