Learning useful information when solving SAT or CSP problems to speed up a tree-search approaches, is one of the main explored tracks in various works. Such information are known as goods and nogoods and they aim to forbid to repetitively visit the same parts of the search space. Unfortunately and unlike nogoods, the exploitation of goods is limited to tree-search approaches based on the structural properties of the problem. In this paper, we propose to generalize and reformulate structural goods under SAT. We also propose a learning scheme of general goods and show their integration in a DPLL-like procedure.

To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we present a general approach to best-first heuristic search in a shared-memory setting. Each thread attempts to expand the most promising nodes. By using abstraction to partition the state space, we detect duplicate states while avoiding lock contention. We allow speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions. In an empirical comparison on STRIPS planning, grid pathfinding, and sliding tile puzzle problems using an 8-core machine, we show that A* implemented in our framework yields faster search performance than previous parallel search proposals. We also demonstrate that our approach extends easily to other best-first searches, such as weighted A* and anytime heuristic search.

Constraint satisfaction problems are mathematical models of real-world problems. In contrast to randomly generated artificial problems, real-world problems usually have non-random structure. Knowledge about that structure, when identified in advance, can make search to find solutions more effective. This paper introduces DrawCSP, a visualization program that can show both the original and the discovered structure of constraint satisfaction problems. DrawCSP provides insight into both search algorithm design and into the challenges real-world problems present.

Early detection of cognitive impairment can prevent or delay the progress of cognitive dysfunction. In the field of neurology, the Clock Drawing Test (CDT) is one of the most popular instruments for detecting cognitive impairment. This paper presents the development of the ClockReader system, a computerized Clock Drawing Test. The main function of the system is to automate error handling in handwriting recognition. Since the ClockReader is a screening tool for dementia, it is not desirable to ask the users to fix their input errors in the drawing of either numbers or characters. Therefore, we propose a simple machine learning technique, context-bounded refinement filter algorithm. With trial experiments, we prove that this simple algorithm improves the recognizer accuracy of handwriting in clock drawings up to 88%.

Based on a typology of five basic forms of abduction, I propose a new definition of abductive insight that empha sizes in particular the inferential structure of a belief system that is able to explain a phenomenon after a new, abductive ly created component has been added to this system or the entire system has been abductively restructured. My thesis is, first, that the argumentative structure of the pursued problem solution guides abductive creativity and, second, that diagrammatic reasoning—if conceptualized according to the requirements defined by Charles Peirce—can support this guidance. This support is mainly possible based on the normative power of the system of representation that has to be used to construct diagrams and to perform experiments with them.

Tactile maps offer access to spatial-analog information for visually impaired people. In contrast to visual maps, a tactile map has a lower resolution and can only be inspected in a sequential way, complicating the extraction of spatial relations among distant map entities. Verbal assistance can help to overcome these difficulties by substituting textual labels with verbal descriptions and offering propositional knowledge about spatial relations. Like visual maps, tactile maps are based on visual, spatial-geometric representations that need to be reasoned about in order to generate verbal assistance. We present an approach towards a verbally assisting virtual-environment tactile map (VAVETaM) realized on a computer system utilizing a haptic force-feedback device. In particular, we discuss the tasks of understanding the user's map exploration procedures (MEPs), of exploiting the spatial-analog map to anticipate the user's informational needs, of reasoning about optimal assistance by taking assumed prior knowledge of the user into account, and of generating appropriate verbal instructions and descriptions to augment the map.

The overall goal of our research is the automatic recognition of the intended message of a grouped bar chart. This paper presents our preliminary work on a system that utilizes the communicative signals in a grouped bar chart as evidence in a Bayesian network that hypothesizes the primary message conveyed by the graphic. The paper discusses the kinds of communicative signals present in grouped bar charts and an ACT-R model for computationalizing one important communicative signal, the relative effort involved in performing the perceptual tasks necessary for the recognition. It also describes our Bayesian network and its implementation on a subset of the kinds of messages that can be conveyed by grouped bar charts.

Markov logic networks (MLNs) use first-order formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extreme computational costs, and thus are unable to represent complex regularities in data. To address this problem, we present LSM, the first MLN structure learner capable of efficiently and accurately learning long clauses. LSM is based on the observation that relational data typically contains patterns that are variations of the same structural motifs. By constraining the search for clauses to occur within motifs, LSM can greatly speed up the search and thereby reduce the cost of finding long clauses. LSM uses random walks to identify densely connected objects in data, and groups them and their associated relations into a motif. Our experiments on three real-world datasets show that our approach is 2-5 orders of magnitude faster than the state-of-the-art ones, while achieving the same or better predictive performance.

Much has been achieved in the field of AI, yet much remains Gibbs sampling code in C/C . Chechetka et al. investigate relational learning for collective classification of entities to be done if we are to reach the goals we all imagine. in images. Choi et al. present a lifted inference One of the key challenges with moving ahead is closing approach for relational continuous models. Logical AI has Gogate and Domingos shows how to exploit logical structure mainly focused on complex representations, and statistical in lifted probabilistic inference. Hadiji et al. discuss AI on uncertainty.

Providing energy conservation services becomes a hot research topic because more and more people attach importance to environmental protection. This research proposes a framework that consists of four process models: appliance recognition, activity-appliances model, unattended appliances detection, and energy conservation service. Appliance recognition model can recognizes the operating states of appliances from raw sensing data of electric power. An activity-appliances model has been built to associate activities with appliances according to the data of Open Mind Common Sense Project. Using the relationship between activities can help to detect unattended appliances, which are consuming electric power but not take part in the resident’s activities. After obtain information of appliance operating states and unattended appliances, residents can receive energy conservation services for notifying the energy consumption information. Finally, the experimental results show that dynamic Baysian network approach can achieve higher than 92% accuracy for appliance recognition. Data of activity-appliances model shows most appliances are strong activity-related.