ClioPatria: A SWI-Prolog Infrastructure for the Semantic Web

ClioPatria is a comprehensive semantic web development framework based on SWI-Prolog. SWI-Prolog provides an efficient C-based main-memory RDF store that is designed to cooperate naturally and efficiently with Prolog, realizing a flexible RDF-based environment for rule based programming. ClioPatria extends this core with a SPARQL and LOD server, an extensible web frontend to manage the server, browse the data, query the data using SPARQL and Prolog and a Git-based plugin manager. The ability to query RDF using Prolog provides query composition and smooth integration with application logic. ClioPatria is primarily positioned as a prototyping platform for exploring novel ways of reasoning with RDF data. It has been used in several research projects in order to perform tasks such as data integration and enrichment and semantic search

Loki : the semantic wiki for collaborative knowledge engineering

We present Loki, a semantic wiki designed to support the collaborative knowledge engineering process with the use of software engineering methods. Designed as a set of DokuWiki plug-ins, it provides a variety of knowledge representation methods, including semantic annotations, Prolog clauses, and business processes and rules oriented to specific tasks. Knowledge stored in Loki can be retrieved via SPARQL queries, in-line Semantic MediaWiki-like queries, or Prolog goals. Loki includes a number of useful features for a group of experts and knowledge engineers developing the wiki, such as knowledge visualization, ontology storage, or code hint and completion mechanism. Reasoning unit tests are also introduced to validate knowledge quality. The paper is complemented by the formulation of the collaborative knowledge engineering process and the description of experiments performed during Loki development to evaluate its functionality. Loki is available as free software at https://loki.re

A Nature-Inspired Algorithm to Enable the E-Mobility Participation in the Ancillary Service Market

In the present paper, a tool is proposed to optimally schedule the charging requests of a fleet of carsharing Electric Vehicles (EVs) in an urban area, to enable their participation in the Ancillary Service Market. The centralized scheduler minimizes the imbalance of an EV fleet with respect to the power commitment declared in the Day-Ahead Market, providing also tertiary reserve and power balance control to the grid. The regulation is carried out by optimizing the initial charging time of each vehicle, according to a deadline set by the carsharing operator. To this purpose, a nature-inspired optimization is adopted, implementing innovative hybridizations of the Artificial Bee Colony algorithm. The e-mobility usage is simulated through a topology-aware stochastic model based on carsharing usage in Milan (Italy) and the Ancillary Services requests are modeled by real data from the Italian electricity market. The numerical simulations performed confirmed the effectiveness of the approach in identifying a suitable schedule for the charging requests of a large EV fleet (up to 3200 units), with acceptable computational effort. The benefits on the economic sustainability of the E-carsharing fleet given by the participation in the electricity market are also confirmed by an extensive sensitivity analysis

Semantic Web 0 (0) 1 1 IOS Press ClioPatria: A SWI-Prolog Infrastructure for the Semantic Web

Abstract. ClioPatria is a comprehensive semantic web development framework based on SWI-Prolog. SWI-Prolog provides an efficient C-based main-memory RDF store that is designed to cooperate naturally and efficiently with Prolog, realizing a flexible RDF-based environment for rule based programming. ClioPatria extends this core with a SPARQL and LOD server, an extensible web frontend to manage the server, browse the data, query the data using SPARQL and Prolog and a Git-based plugin manager. The ability to query RDF using Prolog provides query composition and smooth integration with application logic. ClioPatria is primarily positioned as a prototyping platform for exploring novel ways of reasoning with RDF data. It has been used in several research projects in order to perform tasks such as data integration and enrichment and semantic search

Інформаційна технологія проектування UX/UI дизайну сайту з пошуку навчальних курсів

Дипломний проект присвячений розробці інформаційної технології проектування дизайну сайту після аналізу теплових карт кліків. В роботі проведено дослідження проблеми проектування дизайну, огляд існуючих сайтів за допомогою карти кліків, створення інформаційної технології та реалізація дизайну сайту, розробка сайту за пропонованим дизайном. Представлена поетапна розробка інформаційної технології, дослідження карти кліків та створення легкого та зручного у використанні дизайну сайту. Після реалізації сайту за пропонованим дизайном проведено тестування та аналіз ефективності. Результатом проведеної роботи є інформаційна технологія проектування UX/UI дизайну сайту з пошуку навчальних курсів

Artificial Collective Intelligence Engineering: a Survey of Concepts and Perspectives

Collectiveness is an important property of many systems--both natural and artificial. By exploiting a large number of individuals, it is often possible to produce effects that go far beyond the capabilities of the smartest individuals, or even to produce intelligent collective behaviour out of not-so-intelligent individuals. Indeed, collective intelligence, namely the capability of a group to act collectively in a seemingly intelligent way, is increasingly often a design goal of engineered computational systems--motivated by recent techno-scientific trends like the Internet of Things, swarm robotics, and crowd computing, just to name a few. For several years, the collective intelligence observed in natural and artificial systems has served as a source of inspiration for engineering ideas, models, and mechanisms. Today, artificial and computational collective intelligence are recognised research topics, spanning various techniques, kinds of target systems, and application domains. However, there is still a lot of fragmentation in the research panorama of the topic within computer science, and the verticality of most communities and contributions makes it difficult to extract the core underlying ideas and frames of reference. The challenge is to identify, place in a common structure, and ultimately connect the different areas and methods addressing intelligent collectives. To address this gap, this paper considers a set of broad scoping questions providing a map of collective intelligence research, mostly by the point of view of computer scientists and engineers. Accordingly, it covers preliminary notions, fundamental concepts, and the main research perspectives, identifying opportunities and challenges for researchers on artificial and computational collective intelligence engineering.Comment: This is the author's final version of the article, accepted for publication in the Artificial Life journal. Data: 34 pages, 2 figure

at the 14th Conference of the Spanish Association for Artificial Intelligence (CAEPIA 2011)

Technical Report TR-2011/1, Department of Languages and Computation. University of Almeria November 2011. Joaquín Cañadas, Grzegorz J. Nalepa, Joachim Baumeister (Editors)The seventh workshop on Knowledge Engineering and Software Engineering (KESE7) was held at the Conference of the Spanish Association for Artificial Intelligence (CAEPIA-2011) in La Laguna (Tenerife), Spain, and brought together researchers and practitioners from both fields of software engineering and artificial intelligence. The intention was to give ample space for exchanging latest research results as well as knowledge about practical experience.University of Almería, Almería, Spain. AGH University of Science and Technology, Kraków, Poland. University of Würzburg, Würzburg, Germany

Novel Hedonic Games and Stability Notions

We present here work on matching problems, namely hedonic games, also known as coalition formation games. We introduce two classes of hedonic games, Super Altruistic Hedonic Games (SAHGs) and Anchored Team Formation Games (ATFGs), and investigate the computational complexity of finding optimal partitions of agents into coalitions, or finding - or determining the existence of - stable coalition structures. We introduce a new stability notion for hedonic games and examine its relation to core and Nash stability for several classes of hedonic games