One approach to combining ASP and CP is to integrate There are several approaches to representing and solving theory-specific predicates into propositional formulas (motivated constraint satisfaction problems: constraint programming by SMT), and to extend the ASP solver's decision (CP; Dechter 2003, Rossi, van Beek, and Walsh 2006), answer engine with a higher level proof procedure (Baselice, set programming (ASP; Baral 2003), propositional satisfiability Bonatti, and Gelfond 2005; Mellarkod and Gelfond 2008; checking (SAT; Biere et al. 2009), its extension Gebser, Ostrowski, and Schaub 2009). However, the resulting to satisfiability modulo theories (SMT; Nieuwenhuis, Oliveras, systems have a number of limitations. First, they are and Tinelli 2006), and many more. Each has its particular tied to particular ASP and CP solvers. Second, the support strengths: for example, CP systems support global constraints, for global constraints is limited. Third, communication between ASP systems permit recursive definitions and offer the ASP and CP solver is restricted. Alternative techniques, default negation, whilst SAT solvers often exploit very such as reformulating constraints into ASP have received efficient implementations.

Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis covering positive examples and excluding negative examples, where both hypotheses and examples are expressed in first-order logic. In this paper we employ constraint satisfaction techniques to model and solve a problem known as template ILP consistency, which assumes that the structure of a hypothesis is known and the task is to find a unification of the contained variables such that no negative example is subsumed by the hypothesis and all positive examples are subsumed.

Approximation (WARA-2010), scheduled to be held on July Topics of interest for this AAAI workshop include all 12, 2010 in Atlanta, Georgia, USA in conjunction with aspects of abstraction, reformulation and approximation, AAAI-10, aims to provide a forum for intensive interaction including (but not limited to) the following: new techniques among researchers in all areas of artificial intelligence for automatically constructing and selecting appropriate and computer science with an interest in the different aspects ARA methods; frameworks that unify and classify of abstraction, reformulation, and approximation techniques. ARA techniques; empirical and theoretical studies of the The goal and scope of this workshop are similar to costs and benefits of ARA; applications of ARA to search, an independent symposium called SARA. The diverse backgrounds constraint satisfaction, deterministic and probabilistic planning, of participants of previous SARA symposia has led theorem proving, logic programming, game playing, to a rich and lively exchange of ideas, allowed the comparison parallel and distributed search, distributed data and knowledge of goals, techniques, and paradigms, and helped identify bases, internet search and navigation, knowledge compilation, important research issues and engineering hurdles. This knowledge acquisition, knowledge reformulation, workshop continues to do the same.

EMPATHICA is a computer program under development to facilitate cognitive-affective mapping using visual representations. A cognitive-affective map is a concept graph that includes information about the positive and negative emotional values of what is represented. Potential applications include conflict resolution, literary analysis, cross-cultural understanding, ethical assessment, authoring systems, and cognitive modeling.

The starting point is an ongoing effort to structure underlying intelligent behavior, whether intended reconstruct cognitive architectures from the ground up via as models of human intelligence and/or implementations of graphical models (Koller and Friedman 2009), with the artificial intelligence (Langley, Laird and Rogers 2009). A aim of understanding existing architectures better, basic cognitive architecture may comprise memories, exploring the overall space of architectures, and decision algorithms, learning mechanisms, and some developing new and improved architectures (Rosenbloom means of interacting with external environments.

Reasoning by the usage of mental images has been the subject of much debate in Cognitive Science, especially among the schools of depictive and descriptive imagistic representations. Whether or not reasoning with mental images involves a mechanism or a process different from language based reasoning is an important question. This paper proposes that any theory which aims for a cohesive whole needs to be constrained by neurophysiological data and such data can be obtained by the Clock Drawing Test. The Clock Drawing Test (CDT) is a screening tool for cognitive impairment and can be used as a tool to test resilience of certain factors of visual spatial representations. Thus, it can help to form an empirical case for which factors are prone to debility and which factors are not during the onset and progress of cognitive impairment from a mental representation point of view. This paper presents 50 CDT tests done on patients with cognitive impairment and analyses the results which support the case for a depictive rather than a descriptive theory for imagistic representations. Lastly, this paper proposes that there is some evidence for a more dynamic and distributed nature of representation in the observations which question the above dichotomy and can be partly explained by certain aspects of the connectionist school of thought.

We present an AI called Visuo that guesses quantitative visuospatial magnitudes (e.g., heights, lengths) given adjective-noun pairs as input (e.g., “big hat”). It uses a database of tagged images as memory and infers unexperienced magnitudes by analogy with semantically-related concepts in memory. We show that transferring width-height ratios from a semantically-related concept yields significantly lower error rates than using dissimilar concepts when predicting the width-height ratios of novel inputs.

Lifting can greatly reduce the cost of inference on first-order probabilistic models, but constructing the lifted network can itself be quite costly. In addition, the minimal lifted network is often very close in size to the fully propositionalized model; lifted inference yields little or no speedup in these situations. In this paper, we address both these problems. We propose a compact hypercube-based representation for the lifted network, which can greatly reduce the cost of lifted network construction. We also present two methods for approximate lifted network construction, which groups together similar but distinguishable objects and treats them as if they were identical. This can greatly reduce the size of the lifted network as well as the time required for lifted network construction, but potentially at some cost to accuracy. The coarseness of the approximation can be adjusted depending on the accuracy required, and we can bound the resulting error. Experiments on six domains show great efficiency gains with only minor loss in accuracy.

The architectural approach to AI focuses on the fixed structure underlying intelligence. Applying it to statistical relational AI should further stimulate the application of statistical relational techniques across AI, while focusing research on their commonalities, (in)compatibilities and integration. It could also yield new architectures that are simpler yet more comprehensive than today’s best.

We argue that probabilistic programming with undirected models, in order to scale up, needs to open up. That is, instead of focusing on minimal sets of generic building blocks such as universal quantification or logical connectives, languages should grow to include specific building blocks for as many uses cases as necessary. This can not only lead to more concise models, but also to more efficient inference if we use methods that can exploit building-block specific sub-routines. As embodiment of this paradigm we present , a platform for implementing probabilistic programming languages that grow.