Towards independent and-parallelism in CLP

In this paper we propose a complete scheme for automatic exploitation of independent and-parallelism in CLP programs. We first discuss the new problems involved because of the different properties of the independence notions applicable to CLP. We then show how independence can be derived from a number of standard analysis domains for CLP. Finally, we perform a preliminary evaluation of the efficiency, accuracy, and effectiveness of the approach by implementing a parallehzing compiler for CLP based on the proposed ideas and applying it on a number of CLP benchmarks.

Optimized algorithms for the incremental analysis of logic programs

Global analysis of logic programs can be performed effectively by the use of one of several existing efficient algorithms. However, the traditional global analysis scheme in which all the program code is known in advance and no previous analysis information is available is unsatisfactory in many situations. Incrementa! analysis of logic programs has been shown to be feasible and much more efficient in certain contexts than traditional (non-incremental) global analysis. However, incremental analysis poses additional requirements on the fixpoint algorithm used. In this work we identify these requirements, present an important class of strategies meeting the requirements, present sufficient a priori conditions for such strategies, and propose, implement, and evalúate experimentally a novel algorithm for incremental analysis based on these ideas. The experimental results show that the proposed algorithm performs very efficiently in the incremental case while being comparable to (and, in some cases, considerably better than) other state-of-the-art analysis algorithms even for the non-incremental case. We argüe that our discussions, results, and experiments also shed light on some of the many tradeoffs involved in the design of algorithms for logic program analysis.

Automatic optimization of dynamic scheduling in logic programs

Abstract is not available.

A Web-based Support System for Providing Effective Monitoring, Feedback and Evaluation in Project Management Education

This work introduces a web-based learning environment to facilitate learning in Project Management. The proposed web-based support system integrates methodological procedures and information systems, allowing to promote learning among geographically-dispersed students. Thus, students who are enrolled in different universities at different locations and attend their own project management courses, share a virtual experience in executing and managing projects. Specific support systems were used or developed to automatically collect information about student activities, making it possible to monitor the progress made on learning and assess learning performance as established in the defined rubric.

A Propose-and-revise System for Real-time Traffic Management

The aim of this paper is to describe an intelligent system for the problem of real time road traffic control. The purpose of the system is to help traffic engineers in the selection of the state of traffic control devices on real time, using data recorded by traffic detectors on motorways. The system follows an advanced knowledge-based approach that implements an abstract generic problem solving method, called propose-and-revise, which was proposed in Artificial Intelligence, within the knowledge engineering field, as a standard cognitive structure oriented to solve configuration design problems. The paper presents the knowledge model of such a system together with the strategy of inference and describes how it was applied for the case of the M-40 urban ring for the city of Madrid.

COST Action Urban Agriculture Europe Training School «Urban agriculture inside the city:alternatives for vacant lots and public space»

The third Training School of the Action took place in Vitoria-Gasteiz (Basque country, Spain) from 24th to 26th September 2014. Vitoria-Gateiz has experimented an important urban outgrowth in the last decade, mainly through the planning and development of two new neighborhoods, Zabalgana and Salburúa, situated at the eastern and western border of the city, by the Greenbelt. These new development are well-equipped and designed according to sustainability principles. Nevertheless, among the main problems they present is their over-dimensioned public space, which creates some areas lacking enough density and mix of uses. On the other hand it is very expensive for the municipality to maintain these public space with the high Vitorian urban standards for public space. The proposed solution for this problem is a strategy of "re-densification" through the insertion of new uses The debate has arisen about which are the most adequate uses to insert in order to get an increasing of urban vitality, specially considering that housing has reached its peak and that Vitoria-Gasteiz is well served with social and sport amenities. The main goal of the TS was to offer an opportunity for the reflection about how urban agriculture might be an optimal alternative for the re-qualifying of this over-dimensioned public space in the new neighbourhoods, especially considering it synergic potential as a tool for production, leisure and landscaping, including the possibility of energy crops within the limits of urban space. Continuity with rural and natural surrounding area through alternatives for urban fringe at the small scale is a relevant issue to be considered as well within the reflection. Taking Zabalgana neighbourhood as a practical field for experiment, the Training School is conceived as a practical and intensive design charrette to be held during a whole day after two days of local knowledge-deepening through field visits and presentations.

An Ant Colony System adaptation to deal with accessibility issues after a disaster

One of the main problems relief teams face after a natural or man-made disaster is how to plan rural road repair work tasks to take maximum advantage of the limited available financial and human resources. Previous research focused on speeding up repair work or on selecting the location of health centers to minimize transport times for injured citizens. In spite of the good results, this research does not take into account another key factor: survivor accessibility to resources. In this paper we account for the accessibility issue, that is, we maximize the number of survivors that reach the nearest regional center (cities where economic and social activity is concentrated) in a minimum time by planning which rural roads should be repaired given the available financial and human resources. This is a combinatorial problem since the number of connections between cities and regional centers grows exponentially with the problem size, and exact methods are no good for achieving an optimum solution. In order to solve the problem we propose using an Ant Colony System adaptation, which is based on ants? foraging behavior. Ants stochastically build minimal paths to regional centers and decide if damaged roads are repaired on the basis of pheromone levels, accessibility heuristic information and the available budget. The proposed algorithm is illustrated by means of an example regarding the 2010 Haiti earthquake, and its performance is compared with another metaheuristic, GRASP.