Geometry problem solving has attracted much attention in the NLP community recently. The task is challenging as it requires abstract problem understanding and symbolic reasoning with axiomatic knowledge. However, current datasets are either small in scale or not publicly available. Thus, we construct a new large-scale benchmark, Geometry3K, consisting of 3,002 geometry problems with dense annotation in formal language. We further propose a novel geometry solving approach with formal language and symbolic reasoning, called Interpretable Geometry Problem Solver (Inter-GPS). Inter-GPS first parses the problem text and diagram into formal language automatically via rule-based text parsing and neural object detecting, respectively. Unlike implicit learning in existing methods, Inter-GPS incorporates theorem knowledge as conditional rules and performs symbolic reasoning step by step. A theorem predictor is also designed to infer the theorem application sequence fed to the symbolic solver for the more efficient and reasonable searching path. Extensive experiments on the Geometry3K and GEOS datasets demonstrate Inter-GPS achieves significant improvements over existing methods.

This paper addresses the problem of proposing a model of norms and a framework for automatically computing their violation or fulfilment. The proposed T-NORM model can be used to express abstract norms able to regulate classes of actions that should or should not be performed in a temporal interval. We show how the model can be used to formalize obligations and prohibitions and for inhibiting them by introducing permissions and exemptions. The basic building blocks for norm specification consists of rules with suitably nested components. The activation condition, the regulated actions, and the temporal constrains of norms are specified using the W3C Web Ontology Language (OWL 2). Thanks to this choice, it is possible to use OWL reasoning for computing the effects that the logical implication between actions has on norms fulfilment or violation. The operational semantics of the T-NORM model is specified by providing an unambiguous procedure for translating every norm and every exception into production rules.

According to artificial intelligence statistics, the global AI market is expected to grow to $60 billion by 2025. Global GDP will grow by $15.7 trillion by 2030 due to artificial intelligence, as it will increase business productivity by 40%. Investment in artificial intelligence has grown by 6 times since 2000. In fact, 84% of businesses think that artificial intelligence can give them a competitive advantage. If you are a fan of science fiction movies, you might have seen AI in action in its full glory. With artificial intelligence leaving impressionable marks on every facet of our personal and professional lives, it is important to understand how it works and how it will evolve in the future.

Compared with previous types of networks, 5G networks are both more in need of automation and more amenable to automation. Automation tools are still evolving and machine learning is not yet common in carrier-grade networking, but rapid change is expected. Emerging standards from 3GPP, ETSI, ITU and the open source software community anticipate increased use of automation, artificial intelligence (AI) and machine learning (ML). And key suppliers' activities add credibility to the vision and promise of artificially intelligent network operations. "Growing complexity and the need to solve repetitive tasks in 5G and future radio systems necessitate new automation solutions that take advantage of state-of-the-art artificial intelligence and machine learning techniques that boost system efficiency," wrote Ericsson's chief technology officer (CTO), Erik Ekudden, recently.

For all the advances in the development of artificial intelligence algorithms and models, the majority of potential applications never make it to production because of the time and expense of labeling data to train the model. That's a problem Snorkel.ai has set out to automate. "The not-so-hidden secret about AI today is that despite all the technological and tooling enhancements, but 80 to 90%, of the cost, for many use cases, just goes into manually collecting and labeling and curating this data, this training data that the model learns from," said company co-founder and CEO Alex Ratner. Ratner concedes that this is not the first field or even the first decade in which appropriately labeled data has been considered paramount. In a contributed post to TNS last year, Vikram Bahl outlined the challenges of preparing data for machine learning and AI.

Partially Observable Monte-Carlo Planning (POMCP) is a powerful online algorithm able to generate approximate policies for large Partially Observable Markov Decision Processes. The online nature of this method supports scalability by avoiding complete policy representation. The lack of an explicit representation however hinders policy interpretability and makes policy verification very complex. In this work, we propose two contributions. The first is a method for identifying unexpected actions selected by POMCP with respect to expert prior knowledge of the task. The second is a shielding approach that prevents POMCP from selecting unexpected actions. The first method is based on Satisfiability Modulo Theory (SMT). It inspects traces (i.e., sequences of belief-action-observation triplets) generated by POMCP to compute the parameters of logical formulas about policy properties defined by the expert. The second contribution is a module that uses online the logical formulas to identify anomalous actions selected by POMCP and substitutes those actions with actions that satisfy the logical formulas fulfilling expert knowledge. We evaluate our approach on Tiger, a standard benchmark for POMDPs, and a real-world problem related to velocity regulation in mobile robot navigation. Results show that the shielded POMCP outperforms the standard POMCP in a case study in which a wrong parameter of POMCP makes it select wrong actions from time to time. Moreover, we show that the approach keeps good performance also if the parameters of the logical formula are optimized using trajectories containing some wrong actions.

Machine learning: a computer observes some data, builds a model based on the data, and uses the model as both a hypothesis about the world and a piece of software that can solve problems, According to the book'Artificial Intelligence, a modern approach'. Machine learning is a division of artificial intelligence (AI) focused on computational programs that learn from experience and improve decision-making or predictive accuracy over time. In this podcast, our focus will be to go through very basics concepts of machine learning along with the different methods of machine learning, for example, supervised learning, unsupervised learning, reinforcement learning, and Semi-supervised machine learning. Machine learning is not a'Rule-Based Approach' which was common in 1980

Artificial intelligence (AI) is becoming increasingly more popular and can be found in workplaces and homes around the world. However, how do we ensure trust in these systems? Regulation changes such as the GDPR mean that users have a right to understand how their data has been processed as well as saved. Therefore if, for example, you are denied a loan you have the right to ask why. This can be hard if the method for working this out uses "black box" machine learning techniques such as neural networks. TrustyAI is a new initiative which looks into explainable artificial intelligence (XAI) solutions to address trustworthiness in ML as well as decision services landscapes. In this paper we will look at how TrustyAI can support trust in decision services and predictive models. We investigate techniques such as LIME, SHAP and counterfactuals, benchmarking both LIME and counterfactual techniques against existing implementations. We also look into an extended version of SHAP, which supports background data selection to be evaluated based on quantitative data and allows for error bounds.

Rules embody a set of if-then statements which include one or more conditions to classify a subset of samples in a dataset. In various applications such classification rules are considered to be interpretable by the decision makers. We introduce two new algorithms for interpretability and learning. Both algorithms take advantage of linear programming, and hence, they are scalable to large data sets. The first algorithm extracts rules for interpretation of trained models that are based on tree/rule ensembles. The second algorithm generates a set of classification rules through a column generation approach. The proposed algorithms return a set of rules along with their optimal weights indicating the importance of each rule for classification. Moreover, our algorithms allow assigning cost coefficients, which could relate to different attributes of the rules, such as; rule lengths, estimator weights, number of false negatives, and so on. Thus, the decision makers can adjust these coefficients to divert the training process and obtain a set of rules that are more appealing for their needs. We have tested the performances of both algorithms on a collection of datasets and presented a case study to elaborate on optimal rule weights. Our results show that a good compromise between interpretability and accuracy can be obtained by the proposed algorithms.

It's a cold winter day in Detroit, but the sun is shining bright. Robert Williams decided to spend some quality time rolling on his house's front loan with his two daughters. Suddenly, police officers appeared from nowhere and brought to an abrupt halt a perfect family day. Robert was ripped from the arms of his crying daughters without an explanation, and cold handcuffs now gripped his hands. The police took him away in no time! His family were left shaken in disbelief at the scene which had unfolded in front of their eyes. What followed for Robert were 30 long hours in police custody.