Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job profiles. In such open environments, the objective of a matchmaking process is to discover best available offers to a given request. We address the problem of matchmaking from a knowledge representation perspective, with a formalization based on Description Logics. We devise Concept Abduction and Concept Contraction as non-monotonic inferences in Description Logics suitable for modeling matchmaking in a logical framework, and prove some related complexity results. We also present reasonable algorithms for semantic matchmaking based on the devised inferences, and prove that they obey to some commonsense properties. Finally, we report on the implementation of the proposed matchmaking framework, which has been used both as a mediator in e-marketplaces and for semantic web services discovery.

We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it. Assuming such a structure we show that the semantics of various natural language phenomena may become nearly trivial.

In Logic and Ontology Cocchiarella (2001) convincingly argues for a view of "logic as a language" in contrast with the (now dominant) view of "logic as a calculus". In the latter, logic is viewed as an "abstract calculus that has no content of its own, and which depends on set theory as a background framework by which such a calculus might be syntactically described and semantically interpreted." In the view of "logic as a language", however, logic has content, and "ontological content in particular." Moreover, and according to Cocchiarella, a logic with ontological content necessitates the use of type theory (and predication), as opposed to set theory (and set membership), as the background framework. An obvious question that immediately comes to mind here is the following: what exactly is the nature of this strongly-typed ontological structure that will form the background framework for a new logic that has content?

The Association for the Advancement of Artificial Intelligence, in cooperation with Stanford University's Computer Science Department, was pleased to present its 2006 Spring Symposium Series held March 27-29, 2006, at Stanford University, California. The titles of the eight symposia were (1) Argumentation for Consumers of Health Care (chaired by Nancy Green); (2) Between a Rock and a Hard Place: Cognitive Science Principles Meet AI Hard Problems (chaired by Christian Lebiere); (3) Computational Approaches to Analyzing Weblogs (chaired by Nicolas Nicolov); (4) Distributed Plan and Schedule Management (chaired by Ed Durfee); (5) Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering (chaired by Chitta Baral); (6) Semantic Web Meets e-Government (chaired by Ljiljana Stojanovic); (7) To Boldly Go Where No Human-Robot Team Has Gone Before (chaired by Terry Fong); and (8) What Went Wrong and Why: Lessons from AI Research and Applications (chaired by Dan Shapiro).

In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we consider peer-to-peer inference systems in which the local theory of each peer is a set of propositional clauses defined upon a local vocabulary. An important characteristic of peer-to-peer inference systems is that the global theory (the union of all peer theories) is not known (as opposed to partition-based reasoning systems). The main contribution of this paper is to provide the first consequence finding algorithm in a peer-to-peer setting: DeCA. It is anytime and computes consequences gradually from the solicited peer to peers that are more and more distant. We exhibit a sufficient condition on the acquaintance graph of the peer-to-peer inference system for guaranteeing the completeness of this algorithm. Another important contribution is to apply this general distributed reasoning setting to the setting of the Semantic Web through the Somewhere semantic peer-to-peer data management system. The last contribution of this paper is to provide an experimental analysis of the scalability of the peer-to-peer infrastructure that we propose, on large networks of 1000 peers.

Additional initial ontologies include: search was used, queries were expanded to include (4) single part issues--relate to only one more words to search for, and thus, relevant vehicle component, such as a ding in a fender; documents could be found. Since the documents (5) multiple part issues--relate to two or more being searched were in a limited parts, especially misalignments, unsatisfactory domain, there were few problems with multiple gaps, malformations of joints between parts; senses of words introducing problems that (6) data analysis--results of analysis of measurement hurt precision. In our database, case entries are data generated by optical and mechanical similar--the textual fields do not contain long gages; and (7) plant locations--zones descriptions, and the content is limited to and stations organized topologically or functionally.

We present a novel approach to the automatic acquisition of taxonomies or concept hierarchies from a text corpus. The approach is based on Formal Concept Analysis (FCA), a method mainly used for the analysis of data, i.e. for investigating and processing explicitly given information. We follow Harris' distributional hypothesis and model the context of a certain term as a vector representing syntactic dependencies which are automatically acquired from the text corpus with a linguistic parser. On the basis of this context information, FCA produces a lattice that we convert into a special kind of partial order constituting a concept hierarchy. The approach is evaluated by comparing the resulting concept hierarchies with hand-crafted taxonomies for two domains: tourism and finance. We also directly compare our approach with hierarchical agglomerative clustering as well as with Bi-Section-KMeans as an instance of a divisive clustering algorithm. Furthermore, we investigate the impact of using different measures weighting the contribution of each attribute as well as of applying a particular smoothing technique to cope with data sparseness.

We propose the use of application semantics to enhance the process of semantic reconciliation. Application semantics involves those elements of business reasoning that affect the way concepts are presented to users: their layout, and so on. Existing matching algorithms use either syntactic means (such as term matching and domain matching) or model semantic means, the use of structural information that is provided by the specific data model to enhance the matching process. The novelty of our approach lies in proposing a class of matching techniques that takes advantage of ontological structures and application semantics.

A semantics-preserving exchange of information between two software applications requires mappings between logically equivalent concepts in the ontology of each application. The challenge of semantic integration is therefore equivalent to the problem of generating such mappings, determining that they are correct, and providing a vehicle for executing the mappings, thus translating terms from one ontology into another. This article presents an approach toward this goal using techniques that exploit the model-theoretic structures underlying ontologies. With these as inputs, semiautomated and automated components may be used to create mappings between ontologies and perform translations.

Although this is to be based on use of shared ontologies published on the semantic web, services produced and described by different developers may well use different, perhaps partly overlapping, sets of ontologies. Interoperability will depend on ontology mappings and architectures supporting the associated translation processes. This article reviews some of the processing assumptions that were made in the development of the semantic web service modeling ontology OWL-S and argues that, as a practical matter, the translation function cannot always be isolated in mediators. The translation for service discovery, service process model interpretation, task negotiation, service invocation, and response interpretation may then be distributed to various places in the architecture so that translation can be done in the specific goal-oriented informational contexts of the agents performing these processes.