Causal inference from observational data is a subject of active research and development in statistics and computer science. Many toolkits have been developed for this purpose that depends on statistical software. However, these toolkits do not scale to large datasets. In this paper we describe a suite of techniques for expressing causal inference tasks from observational data in SQL. This suit...

Dependency-based Compositional Semantics (DCS) is a framework of natural language semantics with easy-to-process structures as well as strict semantics. In this paper, we equip the DCS framework with logical inference, by defining abstract denotations as an abstraction of the computing process of denotations in original DCS. An inference engine is built to achieve inference on abstract denotati...

HEVA is a 3D animated character developed with Blender that evaluates the knowledge of a user in a particular subject using an adaptive test. The avatar was built with the Game Engine of Blender 2.25 and Python. Our adaptive test is based on XML as data manager and CLIPS as inference engine. Both are connected with a new library in Python that we had to develop for this purpose. Some characteri...

This paper focuses on building a spatio-temporal AI inference engine for estimating hard disk reliability. Most electronic systems such as disks routinely collect reliability parameters in the field to monitor health of system. Changes function time are monitored and any observed changes compared with known failure signatures. If trajectory measured data matches that signature, operators alerte...

The proposed mechanism for jamming attack detection for wireless sensor networks is novel in three respects: firstly, it upgrades the jammer to include versatile military jammers; secondly, it graduates from the existing node-centric detection system to the network-centric system making it robust and economical at the nodes, and thirdly, it tackles the problem through fuzzy inference system, as...

We give a general goal directed method for solving the E-uniication problem. Our inference system is a generalization of the inference rules for Syntactic Theories, except that our inference system is proved complete for any equational theory. We also show how to easily modify our inference system into a more restricted inference system for Syntactic Theories, and show that our completeness tec...