Real-world semantic or knowledge-based systems, e.g., in the biomedical domain, can become large and complex. Tool support for the localization and repair of faults within knowledge bases of such systems can therefore be essential for their practical success. Correspondingly, a number of knowledge base debugging approaches, in particular for ontology-based systems, were proposed throughout recent years. Query-based debugging is a comparably recent interactive approach that localizes the true cause of an observed problem by asking knowledge engineers a series of questions. Concrete implementations of this approach exist, such as the OntoDebug plug-in for the ontology editor Prot\'eg\'e. To validate that a newly proposed method is favorable over an existing one, researchers often rely on simulation-based comparisons. Such an evaluation approach however has certain limitations and often cannot fully inform us about a method's true usefulness. We therefore conducted different user studies to assess the practical value of query-based ontology debugging. One main insight from the studies is that the considered interactive approach is indeed more efficient than an alternative algorithmic debugging based on test cases. We also observed that users frequently made errors in the process, which highlights the importance of a careful design of the queries that users need to answer.

Machine Learning is proving invaluable across disciplines. However, its success is often limited by the quality and quantity of available data, while its adoption by the level of trust that models afford users. Human vs. machine performance is commonly compared empirically to decide whether a certain task should be performed by a computer or an expert. In reality, the optimal learning strategy may involve combining the complementary strengths of man and machine. Here we present Expert-Augmented Machine Learning (EAML), an automated method that guides the extraction of expert knowledge and its integration into machine-learned models. We use a large dataset of intensive care patient data to predict mortality and show that we can extract expert knowledge using an online platform, help reveal hidden confounders, improve generalizability on a different population and learn using less data. EAML presents a novel framework for high performance and dependable machine learning in critical applications.

On a less-trafficked floor of the Whitney Museum, curators have scoured the museum's permanent collection to display art that uses "instructions, sets of rules, and code" to investigate a world "increasingly driven by automated systems." In the nineties, the game designer Frank Lantz produced such work. "I would make some marks on a page, and then I would just connect the endpoints of all the lines to the nearest unconnected endpoint, and then I would add another rule," he said. His method had a whiff of misanthropy. He wanted to render himself obsolete and let something else take over. "I was trying to understand--where does drawing come from?

Expert System is making enhancements to Cogito, its Artificial Intelligence platform that understands textual information and automatically processes natural language, delivering key updates in the areas of knowledge graphs, machine learning, and RPA. Cogito 14.4 enables users to more easily customize its Knowledge Graph of approximately 350,000 concepts connected by 2.8 Million relationships and lets them import targeted knowledge from any sources (such as company repositories Wikipedia or Geonames) in only a few clicks, enabling the platform to resolve references to real-world entities (such as people, companies, locations) and to link them to knowledge repositories by using standardized identifiers. Cogito 14.4 also extends its Natural Language Processing (NLP) extraction pipeline with a new active learning workflow that accelerates machine-learning-based analytics projects. Through an intuitive web application, Cogito 14.4's active learning workflow enables end-users to visualize the quality of extraction and provide feedback to the engine, which iteratively retrains the engine to reach the user's quality goals, thus reducing the amount of manual annotation needed Cogito 14.4 includes a Robotic Process Automation (RPA) connector that extends the use of RPA bots into process automation leveraging knowledge (and not only structured data) as well as requiring human-like judgement. The Cogito RPA Connector leverages deep contextual understanding to extract precise data from unstructured business documents.

The TriRhenaTech alliance universities and their partners presented their competences in the field of artificial intelligence and their cross-border cooperations with the industry at the tri-national conference 'Artificial Intelligence : from Research to Application' on March 13th, 2019 in Offenburg. The TriRhenaTech alliance is a network of universities in the Upper Rhine Trinational Metropolitan Region comprising of the German universities of applied sciences in Furtwangen, Kaiserslautern, Karlsruhe, and Offenburg, the Baden-Wuerttemberg Cooperative State University Loerrach, the French university network Alsace Tech (comprised of 14 'grandes \'ecoles' in the fields of engineering, architecture and management) and the University of Applied Sciences and Arts Northwestern Switzerland. The alliance's common goal is to reinforce the transfer of knowledge, research, and technology, as well as the cross-border mobility of students.

In this paper, we propose a constraint-based modeling approach for the problem of discovering frequent gradual patterns in a numerical dataset. This SAT-based declarative approach offers an additional possibility to benefit from the recent progress in satisfiability testing and to exploit the efficiency of modern SAT solvers for enumerating all frequent gradual patterns in a numerical dataset. Our approach can easily be extended with extra constraints, such as temporal constraints in order to extract more specific patterns in a broad range of gradual patterns mining applications. We show the practical feasibility of our SAT model by running experiments on two real world datasets.

In this paper we investigate two variants of association rules for preference data, Label Ranking Association Rules and Pairwise Association Rules. Label Ranking Association Rules (LRAR) are the equivalent of Class Association Rules (CAR) for the Label Ranking task. In CAR, the consequent is a single class, to which the example is expected to belong to. In LRAR, the consequent is a ranking of the labels. The generation of LRAR requires special support and confidence measures to assess the similarity of rankings. In this work, we carry out a sensitivity analysis of these similarity-based measures. We want to understand which datasets benefit more from such measures and which parameters have more influence in the accuracy of the model. Furthermore, we propose an alternative type of rules, the Pairwise Association Rules (PAR), which are defined as association rules with a set of pairwise preferences in the consequent. While PAR can be used both as descriptive and predictive models, they are essentially descriptive models. Experimental results show the potential of both approaches.

As Artificial Intelligence (AI) becomes an integral part of our life, the development of explainable AI, embodied in the decision-making process of an AI or robotic agent, becomes imperative. For a robotic teammate, the ability to generate explanations to explain its behavior is one of the key requirements of an explainable agency. Prior work on explanation generation focuses on supporting the reasoning behind the robot's behavior. These approaches, however, fail to consider the cognitive effort needed to understand the received explanation. In particular, the human teammate is expected to understand any explanation provided before the task execution, no matter how much information is presented in the explanation. In this work, we argue that an explanation, especially complex ones, should be made in an online fashion during the execution, which helps to spread out the information to be explained and thus reducing the cognitive load of humans. However, a challenge here is that the different parts of an explanation are dependent on each other, which must be taken into account when generating online explanations. To this end, a general formulation of online explanation generation is presented. We base our explanation generation method in a model reconciliation setting introduced in our prior work. Our approach is evaluated both with human subjects in a standard planning competition (IPC) domain, using NASA Task Load Index (TLX), as well as in simulation with four different problems.

His demand for a ban triggered a legal and moral quagmire, as the Pentagon faced the prospect of throwing out service members who had willingly come forward as transgender after being promised they would be protected and allowed to serve. And as legal battles blocked the ban from taking effect, the Obama-era policy continued and transgender individuals were allowed to begin enlisting in the military a little more than a year ago.

WASHINGTON – The Defense Department has approved a new policy that will largely bar most transgender troops and military recruits from transitioning to another sex, and require most individuals to serve in their birth gender. The new policy comes after a lengthy and complicated legal battle, and it falls short of the all-out transgender ban that was initially ordered by President Donald Trump. But it will likely force the military to eventually discharge transgender individuals who need hormone treatments or surgery and can't or won't serve in their birth gender. The order says the military services must implement the new policy in 30 days, giving some individuals a short window of time to qualify for gender transition if needed. And it allows service secretaries to waive the policy on a case-by-case basis.