On the Missing Link Between Frequent Pattern Discovery and Concept Formation

This paper presents a new means of selecting quality data for mining multiple data sources. Traditional data-mining strategies obtain necessary data from internal and external data sources and pool all the data into a huge homogeneous dataset for discovery. In contrast, our data-mining strategy identifies quality data from (internal and external) data sources for a mining task. A framework is advocated for generating quality data. Experimental results demonstrate that application of this new data collecting technique can not only identify quality data, but can also efficiently reduce the amount of data that must be considered during mining.

The role of games in computing science has been given some consideration in the literature. We aim to design games that can be used for teaching logic. Specifically, we build on the Minefield game used in the Stanford Intro to Logic course, and present a version, which we call MineFOL, that incorporates time constraints. We also move beyond the Stanford examples in that we provide a formalisation of the game, with a view to eventually generating game instances automatically as well as from user input, and show how MineFOL can be used as a learning tool. We also developed an online platform supporting learners in at least three ways. First, the learners can practice reasoning in First Order Logic (FOL) and proving strategies such as resolution through various MineFOL games. Second, the learners can practice formalisation in FOL, by allowing learners to build their own games. Third, the learners become aware of the need of interleaving various technologies to solve a logicbased task. In this line, MineFOL is formalised in such way to allow augmenting reasoning in FOL with search strategies.

In this paper, we present a system that translates first order logic (FOL) formulas into natural language (NL) sentences. The motivation comes from an intelligent tutoring system teaching logic as a knowledge representation language, where it is used as a means for feedback to the users. FOL to NL conversion is achieved by using a rule-based approach, where we exploit the pattern matching capabilities of rules. So, the system consists of a rule-based component and a lexicon. The rule-based unit implements the conversion process, which is based on a linguistic analysis of a FOL sentence, and the lexicon provides lexical and grammatical information that helps in producing the NL sentences. The whole system is implemented in Jess, a java-based expert system shell. The conversion process currently covers a restricted set of FOL formulas.

Approximate pattern matching and transitive closure logics

We study Sowa’s conceptual graphs (CGs) with both existential and universal quantifiers. We explore in detail the existential fragment. We extend and modify Sowa’s original graph derivation system with new rules and prove the soundness and completeness theorem with respect to Sowa’s standard interpretation of CGs into first order logic (FOL). The proof is obtained by reducing the graph derivation to a question-answering problem. The graph derivation can be equivalently obtained by querying a Definite Horn Clauses program by a conjunction of positive atoms. Moreover, the proof provides an algorithm for graph derivation in a pure proof-theoretic fashion, namely by means of a slight enhancement of the standard PROLOG interpreter. The graph derivation can be rebuilt step-by-step and constructively from the resolution-based proof. We provide a notion of CGs in normal form (the table of the conceptual graph) and show that the PROLOG interpreter also gives a projection algorithm between normal CGs. The normal forms are obtained by extending the FOL language by witnesses (new constants) and extending the graph derivation system. By applying iteratively a set of rules the reduction process terminates with the normal form of a conceptual graph. We also show that graph derivation can be reduced to a question-answering problem in propositional datalog for a subclass of simple CGs. The embedding into propositional datalog makes the complexity of the derivation polynomial.

The expressiveness of First Order Logic (FOL) languages is severely counterbalanced by the complexity of matching formulas on a universe. Matching is an instance of the class of Constraint Satisfaction Problems (CSP), which have shown to undergo a phase transition with respect to two order parameters: constraint density and constraint tightness. This paper analyzes the problem of satisfying FOL Horn clauses in the light of these recent results. By means of an extensive experimental analysis, we show how Horn clause verification exhibits a typical phase transition with respect to the number of binary (or greater arity) predicates, and with respect to the ratio between the number of constants in the universe and the cardinality of the basic predicates extension.

Software Product Line (SPL) is a new methodology that develops software products by configuring a software product from artifacts repository. Variability is one of the important issues in designing SPL. It reflects the diversity and commonality of the artifacts in a product line. The success of SPL is basically dependent on model's variability. SPL contains three main issues: variability modeling, configuration of new software and the analysis of SPL. Validation is a vital operation among all these issues. In the literature, many methods of modeling variability are proposed but none of them focuses on the validation. In this paper, an intelligent method for validating SPL is introduced. The proposed method is based on two layers. The higher layer is a graphical representation (satisfying visualization condition), and the lower layer is logical representation of the variability using first order logic (FOL). The way that the proposed method can be used to model variability, and support the analysis and validation of SPL is described. Later a new operation in SPL validation issue is presented. Finally, the implementation of the two basic operations in the analysis of SPL is illustrated.

Chapter 2 showed us how to use PolyBase to integrate SQL Server with Azure Blob Storage. In this chapter, we will integrate to the original external data source: Hadoop. In the first part of this chapter, we will take a peek at an already-built Hadoop cluster. Then, we will configure PolyBase to work with the two key variants of Hadoop (pending the release of an on-premises version of Cloudera Data Platform). Next, we will review what changes in terms of PolyBase functionality between Azure Blob Storage and Hadoop. After this review, we will create the infrastructure needed to query a Hadoop external data source. Finally, we will query this external data source and confirm that data retrieval and data insertion both work as they do in Azure Blob Storage.

Software product Line (SPL) is an emerging methodology for developing software products. A successful software product is highly dependent on the validity of a SPL. Therefore, validation is a significant process within SPL. In this paper, inconsistency detection is investigated as operation for validating SPL. Intelligent rules are formulated detecting inconsistency based on deducing the results from predefined cases. First, variability is modeled using First Order Logic (FOL) predicates as a prerequisite for inconsistency detection. Later, inconsistency is categorized in three groups. For each group a general form is formulated that can coffer all possible cases. Finally, an intelligent rule (based on FOL) is illustrated for implementing each possibility. As results, all cases of inconsistency in the domain-engineering process are defined.

In this paper we will present a graph-transformation based method for the verification of heterogeneous first order logic (FOL) and Euler/Venn proofs. In previous work, it has been shown that a special collection of directed acyclic graphs (DAGs) can be used interchangeably with Euler/Venn diagrams in reasoning processes. Thus, proofs which include Euler/Venn diagrams can be thought of as proofs with DAGs where steps involving only Euler/Venn diagrams can be treated as particular DAG transformations. Here we will show how the characterization of these manipulations can be used to verify Euler/Venn proofs. Also, a method for verifying the use of heterogeneous Euler/Venn and FOL reasoning rules will be presented that is also based upon DAG transformations .

In the process of data integration using ontologies it is important to manage data from external data sources in the same way as data stored in the Knowledge Base. In previous papers [], [] the way of inference from data stored in the Knowledge Base, using Knowledge Cartography idea has been presented. However, this solution requires loading all data to the Knowledge Base. The solution presented in this paper shows how the Knowledge Cartography can be used to infer from data stored in external data sources, without loading them to the Knowledge Base. The presented solution is to enrich each data source with an additional layer that allows managing data using signatures. The paper additionally describes the results of tests comparing times of inference when data are loaded to the Knowledge Base and when data are fetched on demand.

Trends in differences between births and surviving infants reported for immunization program planning and external data sources in Eastern and Southern Africa 2000–2013

First of four chapters covering data assembly, being i) observation (predictors); ii) performance (target); iii) target definition; iv) data merge. (1) Make a plan—finalize the what, where, who and how of data, especially as regards internal and external data sources and how subject-level data will be matched. (2) Gather—identify key fields and determine what data aggregates are required, set retention rules and obtain retrospective histories from external sources. (3) Reduce—identify predictors to be dropped or ignored, especially those un- or under-populated, unpredictive, proscribed, highly correlated and … those populated after the decision was made. (4) Cleanse—individual records that are out-of-scope, underpopulated, and duplicates. Mention is also made of the treatment of outliers for continuous targets and of inconsistencies within the data {e.g. varying codes by time or source}. (5) Check—ensure file contents are consistent with expectations.

We outline a method for proving theorems in first-order logic with equality using some equational logics and their associated multiple-valued propositional logics, and describe an application of the method that makes use of the automated theorem-prover Otter to prove a range of theorems from the TPTP library of problems in first-order logic with equality.

Objective. The COVID-19 pandemic created an unprecedented strain on the health care system, and administrators had to make many critical decisions to respond appropriately. This study sought to understand how health care administrators used data and information for decision making during the first 6 mo of the COVID-19 pandemic. Materials and Methods. We conducted semistructured interviews with administrators across University of Florida (UF) Health. We performed an inductive thematic analysis of the transcripts. Results. Four themes emerged from the interviews: 1) common types of health systems or hospital operations data; 2) public health and other external data sources; 3) data interaction, integration, and exchange; and 4) novelty and evolution in data, information, or tools used over time. Participants illustrated the organizational, public health, and regional information they considered essential (e.g., hospital census, community positivity rate, etc.). Participants named specific challenges they faced due to data quality and timeliness. Participants elaborated on the necessity of data integration, validation, and coordination across different boundaries (e.g., different hospital systems in the same metro areas, public health agencies at the local, state, and federal level, etc.). Participants indicated that even within the first 6 mo of the COVID-19 pandemic, the data and tools used for making critical decisions changed. Discussion. While existing medical informatics infrastructure can facilitate decision making in pandemic response, data may not always be readily available in a usable format. Interoperable infrastructure and data standardization across multiple health systems would help provide more reliable and timely information for decision making. Conclusion. Our findings contribute to future discussions of improving data infrastructure and developing harmonized data standards needed to facilitate critical decisions at multiple health care system levels.HighlightsThe study revealed common health systems or hospital operations data and information used in decision making during the first 6 mo of the COVID-19 pandemic.Participants described commonly used internal data sources, such as resource and financial reports and dashboards, and external data sources, such as federal, state, and local public health data.Participants described challenges including poor timeliness and limited local relevance of external data as well as poor integration of data sources within and across organizational boundaries.Results suggest the need for continued integration and standardization of health data to support health care administrative decision making during pandemics or other emergencies.