A text obtained by a Large Language Model (LLM) such as GPT4 usually has issues in terms of incorrectness and hallucinations. We build a fact-checking system 'Truth-O-Meter' which identifies wrong facts, comparing the generation results with the web and other sources of information, and suggests corrections. Text mining and web mining techniques are leveraged to identify correct corresponding sentences; also, the syntactic and semantic generalization procedure adopted to the content improvement task. To handle inconsistent sources while fact-checking, we rely on an argumentation analysis in the form of defeasible logic programming. We compare our fact checking engine with competitive approach based on reinforcement learning on top of LLM or token-based hallucination detection. It is observed that LLM content can be substantially improved for factual correctness and meaningfulness.

The rapid proliferation of information in the digital era underscores the importance of accurate historical representation and interpretation. While artificial intelligence (AI) has shown promise in various fields, its potential for historical fact-checking and gap-filling remains largely untapped. This study evaluates the performance of three large language models (LLMs)—GPT-3.5, GPT-4, and Google- BARD—in the context of predicting and verifying historical events based on given data. A novel metric, "Distance to Reality" (DTR), is introduced to assess the models' outputs against established historical facts. The results reveal a substantial potential for AI in historical studies, with GPT-4 demonstrating superior performance. This paper underscores the need for further research into AI's role in enriching our understanding of the past and bridging historical knowledge gaps.

Growing interest is awarded to the digitalization of the building permitting use case and many works are developed about the topic. However, the subject is very complex and many aspects are usually tackled separately, making it very hard for traditional literature reviews to grasp the actual progress in the overall topic. This paper unveils the detailed state of the art in Digital Building Permitting (DBP) by critically analyzing the literature by means of a set of coding tags (research progress, implementation, affected DBP workflow steps, ambitions addressed) assigned by a multidisciplinary team. The mainly addressed aspects of the digitalization of building permits resulted to be the technologies to check the compliance of design proposals against regulations, followed by the digitalization of regulations. Lacking aspects are instead the involvement of officers, scalability of solutions and interoperability of data, intended both as data validation and as integration of geoinformation with building models.

After industrialization and the baby boom, many houses have been left vacant in many cities worldwide due to changes in the economy, socie-ty, and urban composition. The increase in vacant houses causes social problems, like the collapse of village communities, damage to urban aes-thetics, risk of crime due to vacant houses, and decrease in the value of real estate. Accordingly, policy attempts and studies to reduce and utilize vacant houses are in progress in various countries. In South Korea, the ratio of vacant houses was 6.4% of all houses as of 2021, and in Jeolla-buk-do, it was 11.6%, which is higher than the national average. Jeollabuk-do conducted a fact-finding survey on countermeasures against va-cant houses; 17,732 vacant houses (2.4%) were surveyed. The urbanization, population, and terrain of Jeollabuk-do, consisting of 14 cities and counties, were considered. The ratios, types, grades, and spatial autocorrelations of vacant houses were analyzed after classification into city (fo-cus, small, and medium) and county (plains and mountains) areas. There were significant differences in the averages of the ratios, grades, and spatial autocorrelations between city and county areas. Therefore, policy establishment for vacant house management and countermeasures re-quires consideration of the areas and types of vacant houses.Keywords: : vacant house; spatial autocorrelation; fact-finding survey

Mutual exclusion algorithms are at the heart of concurrent, distributed/parallel, real-time and operating systems. It is well-known that such algorithms are very difficult to analyze and in the literature different conjectures about starvation-freedom and the number of by-passes (also said the overtaking factor), which in turn affects the (hopefully) bounded waiting time that a process competing for entering the critical section has to suffer before accessing the shared resource, have been formulated for specific algorithms. This paper proposes a novel modelling approach based on Timed Automata and the Uppaal toolset, which proves effective for studying all the properties of a mutual exclusion algorithm for N≥2 processes, by exhaustive model checking. Although the approach, as already confirmed by similar experiments reported in the literature, is not scalable due to state explosion problems, and can be practically applied until N≤5, it is of great value for revealing true properties of analyzed algorithms. For dimensions N>5 the statistical model checker of Uppaal can be used which, although based on simulations, can confirm properties by estimations and probabilities. The paper describes the proposed modelling and verification method and applies it to several mutual exclusion algorithms, thus retrieving known properties but also showing new results about properties often studied only by peer-review and intuitive reasoning.

The rapid growth of Artificial Intelligence (AI) has led to considerable progress in Automated Fact Verification (AFV). This process involves collecting evidence for a statement, assessing its relevance, and predicting its accuracy. Recently, research has begun to explore automatic explanations as an integral part of the accuracy analysis process. However, the explainability within AFV is lagging compared to the wider field of explainable AI (XAI), which aims at making AI decisions more transparent. This study looks at the notion of explainability as a topic in the field of XAI, with a focus on how it applies to the specific task of Automatic Fact Verification. It examines the explainability of AFV, taking into account architectural, methodological, and dataset-related elements, with the aim of making AI more comprehensible and acceptable to the general society. Although there is a general consensus on the need for AI systems to be explainable, there a dearth of systems and processes to achieve it. In this research, we investigate the concept of explainable AI in general and demonstrate its various aspects through the particular task of Automated Fact Verification. We explore topic of faithfulness in the context of local and global explainability and how these correspond with architectural, methodological and data-based ways of achieving it. We examine these concepts for the specific case of AFV and analyze the current datasets used for AFV and how they can be adapted to further the identified aims on XAI. The paper concludes by highlighting the gaps and limitations in current data science practices and possible recommendations for modifications in architectural and data curation processes that would further the goals of XAI.

model checking techniques are often used for the verification of software systems. Such techniques are accompanied with several advantages. However, state space explosion is one of the drawbacks to model checking. During recent years, several methods have been proposed based on evolutionary and meta-heuristic algorithms to solve this problem. In this paper, a hybrid approach is presented to cope with the SSE problem in model checking of systems modeled by GTS with an ample state space. Most of existence proposed methods that aim to verify systems are applied to detect deadlocks by graph transformations. The proposed approach is based on the fuzzy genetic algorithm and is designed to decline the safety property by verifying the reachability property and detecting deadlocks. In this solution, the state space of the system is searched by a fuzzy genetic algorithm to find the state in which the specified property is refuted/verified. To implement and evaluate the suggested approach, GROOVE is used as a powerful designing and model checking toolset in GTS. The experimental results indicate that the presented hybrid fuzzy method improves speed and performance by comparing other techniques

DNA is stored in the nucleus of a cell in a folded state; however, only the necessary genetic information is extracted from the required group of genes. The key to extracting genetic information is chromatin ambivalence. Depending on the chromosomal region, chromatin is characterized into low-density "euchromatin" and high-density "heterochromatin", with various factors being involved in its regulation. Here, we focus on chromatin regulation and gene expression by the yeast FACT complex, which functions in both euchromatin and heterochromatin. FACT is known as a histone H2A/H2B chaperone and initially reported as an elongation factor associated with RNA polymerase II. In budding yeast, FACT activates promoter chromatin by interacting with the transcriptional activators SBF/MBF via the regulation of G1/S cell cycle genes. In fission yeast, FACT plays an important role in the formation of higher-order chromatin structures and transcriptional repression by binding to Swi6, an HP1 family protein, at heterochromatin. This FACT property, which refers to the alternate chromatin-regulation depending on the binding partner, is an interesting phenomenon. Further analysis of nucleosome regulation within heterochromatin is expected in future studies.

This paper addresses the approach of fully automated intelligent control systems in production organizations, focusing on intelligent production systems research. The overview highlights a gap in control operations ahead of assembly as single-purpose control machines are frequently employed, which is precisely their drawback. Conversely, there are accurate multipurpose measurement centers that do not provide total quality control over the manufactured parts because of the cost and length of the measuring procedure. The study's primary objective was to create an intelligent modular control system, whose concept enables it to control various components. The purpose of the modular intelligent control system is to keep an eye on each module's quality during the pre-assembly phase. This system ensures exact control over the production process of modules by integrating sophisticated sensors, diagnostic tools, and intelligent control mechanisms. The technology makes it possible to monitor several parameters and important quality features. Integrated sensors and diagnostic technologies identify possible inaccuracies and disparities, guaranteeing prompt diagnosis of issues in specific modules. The system's intelligent control algorithms streamline the production process and guarantee synchronization between individual modules to achieve consistent quality and performance. One advantage of implementing the solution is that, on average, inspection time is reduced by 40 to 60% as compared to the prior manual inspection approach. In addition, full measurement data archiving was made available, and finally, the human element—which introduced a substantial error rate into this process—was removed. This system also helps to increase the project's overall efficiency, predictability, and safety while allowing for quick adjustments by standards and requirements.

In verifying programs for embedded systems, it is essential to reduce the verification time because state explosion may occur in model checking. One solution is to reduce the number of interrupt handler execution. In particular, when periodic interrupts such as timer interrupts are incorporated, it is necessary to know the physical time. In this paper, we define a control flow automata (CFA) that can handle time and propose an algorithm based on interrupt handler execution reduction (IHER). The proposed method reduces the number of interrupt executions, including timer interrupts. A case study verifies the effectiveness of this algorithm.

Nowadays, model checking is applied as an accurate technique to verify software systems. The main problem of model checking techniques is the state space explosion. This problem occurs due to the exponential memory usage by the model checker. In this situation, using meta-heuristic and evolutionary algorithms to search for a state in which a property is satisfied/violated is a promising solution. Recently, different evolutionary algorithms like GA, PSO, etc. are applied to find deadlock state. Even though useful, most of them are concentrated on finding deadlock. This paper proposes a fuzzy algorithm in order to analyze reachability properties in systems specified through GTS with enormous state space. To do so, we first extend the existing PSO algorithm (for checking deadlocks) to analyze reachability properties. Then, to increase the accuracy, we employ a Fuzzy adaptive PSO algorithm to determine which state and path should be explored in each step to find the corresponding reachable state. These two approaches are implemented in an open-source toolset for designing and model checking GTS called GROOVE. Moreover, the experimental results indicate that the hybrid fuzzy approach improves speed and accuracy in comparison with other techniques based on meta-heuristic algorithms such as GA and the hybrid of PSO-GSA in analyzing reachability properties.

This paper extends our seminal paper on KnoBAB for efficient Conformance Checking computations performed on top of a customised relational model. After defining our proposed temporal algebra for temporal queries (xtLTLf ), we show that this can express existing temporal languages over finite and non-empty traces such as LTLf . This paper also proposes a parallelisation strategy for such queries thus reducing conformance checking into an embarrassingly parallel problem leading to super-linear speed up. This paper also presents how a single xtLTLf operator (or even entire sub-expressions) might be efficiently implemented via different algorithms thus paving the way to future algorithmic improvements. Finally, our benchmarks remark that our proposed implementation of xtLTLf (KnoBAB) outperforms state-of-the-art conformance checking software running on LTLf logic, be it data or dateless.

Transportation of goods is as old as human civilizations : past networks and their evolution shed light on long term trends. Transportation impact on climate change is measured as major, as well as the impact on spreading a pandemic. These two reasons motivate the importance of providing relevant and reliable historical geographic datasets of these networks. This paper focuses on reconstructing the railway network in France at its maximal extent, a century ago. The active stations and lines are well documented by the French SNCF, in open public data. However, that information ignores past stations (ante 1980), which represent probably more than what is recorded in public data. Additional open data, individual or collaborative (eg. Wikipedia) are particularly valuable, but they are not always geo-coded, and two more sources are necessary to completing that geo-coding: ancient maps and aerial photography. Therefore, remote sensing and volunteer geographic information are the two pillars of past railway reconstruction. The methods developed are adapted to the extraction of information from these sources: automated parsing of Wikipedia Infoboxes, data extraction from simple tables, even from simple text. That series of sparse procedures can be merged into a comprehensive computer-assisted process. Beyond this, a huge effort in quality control is necessary when merging these data: automated wherever possible, or finally visually controlled by observation of remote sensing information. The main output is a reliable dataset, under ODbl, of more than 9100 stations, which can be combined with the information about the 35000 communes of France, for a large variety of studies. This work demonstrates two thesis: (a) it is possible to reconstruct transport network data from the past, and generic computer assisted methods can be developed; (b) the value of remote sensing and volunteered geo info is considerable (what archeologists already know).