Social cognition is a key feature of human-level intelligence. However, social reasoning faculties are rarely included in cognitive systems. To encourage research in this direction, we introduce a practical, computational framework that enables socially aware inference. We demonstrate the framework's ability to model a common, complex, and under-investigated aspect of human social behavior: deception. Moreover, we show how a system implementing this framework could dynamically respond once it has detected a lie. We then discuss some of the challenges associated with deception, ending with an outline of future research directions.

In the context of cognitive architectures, memory is typically considered as a passive storage device with the sole purpose of maintaining and retrieving information relevant to ongoing cognitive processing. If memory is instead considered to be a fundamentally active aspect of cognition, as increasingly suggested by empirically-derived neurophysiological theory, this passive role must be reinterpreted. In this perspective, memory is the distributed substrate of cognition, forming the foundation for cross-modal priming, and hence soft cross-modal coordination. This paper seeks to describe what a cognitive architecture based on this perspective must involve, and initiates an exploration into how human-level cognitive competencies (namely episodic memory, word label conjunction learning, and social behaviour) can be accounted for in such a low-level framework. This proposal of a memory-centred cognitive architecture presents new insights into the nature of cognition, with benefits for computational implementations such as generality and robustness that have only begun to be exploited.

We present a system capable of automatically solving combinatorial logic puzzles given in (simplified) English. It involves translating the English descriptions of the puzzles into answer set programming(ASP) and using ASP solvers to provide solutions of the puzzles. To translate the descriptions, we use a lambda-calculus based approach using Probabilistic Combinatorial Categorial Grammars (PCCG) where the meanings of words are associated with parameters to be able to distinguish between multiple meanings of the same word. Meaning of many words and the parameters are learned. The puzzles are represented in ASP using an ontology which is applicable to a large set of logic puzzles.

Recommender systems now play an important role in online information discovery, complementing traditional approaches such as search and navigation, with a more proactive approach to discovery that is informed by the users interests and preferences. To date recommender systems have been deployed within a variety of e-commerce domains, covering a range of products such as books, music, movies, and have proven to be a successful way to convert browsers into buyers. Recommendation technologies have a potentially much greater role to play in information discovery however and in this article we consider recent research that takes a fresh look at web search as a fertile platform for recommender systems research as users demand a new generation of search engines that are less susceptible to manipulation and more responsive to searcher needs and preferences.

Recommender systems are a means of personalizing the presentation of information to ensure that users see the items most relevant to them. The social web has added new dimensions to the way people interact on the Internet, placing the emphasis on user-generated content. Users in social networks create photos, videos and other artifacts, collaborate with other users, socialize with their friends and share their opinions online. This outpouring of material has brought increased attention to recommender systems, as a means of managing this vast universe of content. At the same time, the diversity and complexity of the data has meant new challenges for researchers in recommendation. This article describes the nature of recommendation research in social web applications and provides some illustrative examples of current research directions and techniques. It is difficult to overstate the impact of the social web. This new breed of social applications is reshaping nearly every human activity from the way people watch movies to how they overthrow governments. Facebook allows its members to maintain friendships whether they live next door or on another continent. With Twitter, users from celebrities to ordinary folks can launch their 140 character messages out to a diverse horde of ‘‘followers.” Flickr and YouTube users upload their personal media to share with the world, while Wikipedia editors collaborate on the world’s largest encyclopedia.

Recommender systems are tools for interacting with large and complex information spaces. They provide a personalized view of such spaces, prioritizing items likely to be of interest to the user. The field, christened in 1995, has grown enormously in the variety of problems addressed and techniques employed, as well as in its practical applications. Recommender systems research has incorporated a wide variety of artificial intelligence techniques including machine learning, data mining, user modeling, case-based reasoning, and constraint satisfaction, among others. Personalized recommendations are an important part of many on-line e-commerce applications such as Amazon.com, Netflix, and Pandora. This wealth of practical application experience has provided inspiration to researchers to extend the reach of recommender systems into new and challenging areas. The purpose of the articles in this special issue is to take stock of the current landscape of recommender systems research and identify directions the field is now taking. This article provides an overview of the current state of the field and introduces the various articles in the special issue.

Entity resolution is the problem of reconciling database references corresponding to the same real-world entities. Given the abundance of publicly available databases that have unresolved entities, we motivate the problem of query-time entity resolution quick and accurate resolution for answering queries over such unclean databases at query-time. Since collective entity resolution approaches --- where related references are resolved jointly --- have been shown to be more accurate than independent attribute-based resolution for off-line entity resolution, we focus on developing new algorithms for collective resolution for answering entity resolution queries at query-time. For this purpose, we first formally show that, for collective resolution, precision and recall for individual entities follow a geometric progression as neighbors at increasing distances are considered. Unfolding this progression leads naturally to a two stage expand and resolve query processing strategy. In this strategy, we first extract the related records for a query using two novel expansion operators, and then resolve the extracted records collectively. We then show how the same strategy can be adapted for query-time entity resolution by identifying and resolving only those database references that are the most helpful for processing the query. We validate our approach on two large real-world publication databases where we show the usefulness of collective resolution and at the same time demonstrate the need for adaptive strategies for query processing. We then show how the same queries can be answered in real-time using our adaptive approach while preserving the gains of collective resolution. In addition to experiments on real datasets, we use synthetically generated data to empirically demonstrate the validity of the performance trends predicted by our analysis of collective entity resolution over a wide range of structural characteristics in the data.

This page includes forthcoming AAAI sponsored conferences, conferences presented by AAAI Affiliates, and conferences held in cooperation with AAAI. AI International Conference on Pattern Magazine also maintains a calendar listing that includes nonaffiliated conferences Recognition Applications and Methods. AIIDE-11 will be Flairs-2012 will be held May 23-25, HRI2012 will be held March 5-8, held October 11-14, 2011 at Stanford 2012, in Marco Island, Florida. ICEIS 2012 will be held June 28 Trinity College in Dublin, Ireland. ICINCO 2012 will be held March 26-28, 2012 at Stanford Third International Joint Conference held July 28-31, 2012 in Rome, Italy.

State of the art recommender systems support users in the selection of items from a predefined assortment (for example, movies, books, and songs). In contrast to an explicit definition of each individual item, configurable products such as computers, financial service portfolios, and cars are repre¬sented in the form of a configuration knowledge base that describes the properties of allowed instances. Although the knowledge representation used is different compared to non-confi¬gurable products, the decision support requirements remain the same: users have to be supported in finding a solution that fits their wishes and needs. In this article we show how recommendation technologies can be applied for supporting the configuration of products. In addition to existing approaches we discuss relevant issues for future research.

In recommender systems, explanations serve as an additional type of information that can help users to better understand the system's output and promote objectives such as trust, confidence in decision making or utility. This article proposes a taxonomy to categorize and review the research in the area of explanations. It provides a unified view on the different recommendation paradigms, allowing similarities and differences to be clearly identified. Finally, the authors present their view on open research issues and opportunities for future work on this topic.