To appear in the proceedings of LPAR 21. Solving complex problems can involve non-trivial combinations of distinct knowledge bases and problem solvers. The Algebra of Modular Systems is a knowledge representation framework that provides a method for formally specifying such systems in purely semantic terms. Formally, an expression of the algebra defines a class of structures. Many expressive formalism used in practice solve the model expansion task, where a structure is given on the input and an expansion of this structure in the defined class of structures is searched (this practice overcomes the common undecidability problem for expressive logics). In this paper, we construct a solver for the model expansion task for a complex modular systems from an expression in the algebra and black-box propagators or solvers for the primitive modules. To this end, we define a general notion of propagators equipped with an explanation mechanism, an extension of the alge- bra to propagators, and a lazy conflict-driven learning algorithm. The result is a framework for seamlessly combining solving technology from different domains to produce a solver for a combined system.

AI applications have been deployed and used for industrial, government, and consumer purposes for many years. The experiences have been documented in IAAI conference proceedings since 1989. Over the years, the breadth of applications has expanded many times over and AI systems have become more commonplace. Indeed, AI has recently become a focal point in the industrial and consumer consciousness. This article focuses on changes in the world of computing over the last three decades that made building AI applications more feasible. We then examine lessons learned during this time and distill these lessons into succinct advice for future application builders.

hakey the Robot, conceived fifty years ago, was a seminal contribution to AI. Shakey perceived its world, planned how to achieve a goal, and acted to carry out that plan. This was revolutionary. At the Twenty-Ninth AAAI Conference on Artificial Intelligence, attendees gathered to celebrate Shakey, and to gain insights into how the AI revolution moves ahead. The celebration included a panel, chaired by Benjamin Kuipers and featuring AI pioneers Ed Feigenbaum, Peter Hart, and Nils Nilsson. This article includes written versions of the contributions of those panelists.

"The remedy is more speech, not enforced silence," wrote US Supreme Court justice Louis Brandeis in 1927 in his defence of freedom of speech. Ninety years on, his position is often taken as read: in the marketplace of ideas, eventually the truth will out. So it's no surprise that many were aghast when, last week, Germany's justice minister introduced a draft law that would fine social media companies, including Facebook and Twitter, up to €50 million if they failed to remove hate speech within 24 hours of a complaint.

In this paper we look into the problem of planning over hybrid domains, where change can be both discrete and instantaneous, or continuous over time. In addition, it is required that each state on the trajectory induced by the execution of plans complies with a given set of global constraints. We approach the computation of plans for such domains as the problem of searching over a deterministic state model. In this model, some of the successor states are obtained by solving numerically the so-called initial value problem over a set of ordinary differential equations (ODE) given by the current plan prefix. These equations hold over time intervals whose duration is determined dynamically, according to whether zero crossing events take place for a set of invariant conditions. The resulting planner, FS+, incorporates these features together with effective heuristic guidance. FS+ does not impose any of the syntactic restrictions on process effects often found on the existing literature on Hybrid Planning. A key concept of our approach is that a clear separation is struck between planning and simulation time steps. The former is the time allowed to observe the evolution of a given dynamical system before committing to a future course of action, whilst the later is part of the model of the environment. FS+ is shown to be a robust planner over a diverse set of hybrid domains, taken from the existing literature on hybrid planning and systems.

This paper is a tutorial on Formal Concept Analysis (FCA) and its applications. FCA is an applied branch of Lattice Theory, a mathematical discipline which enables formalisation of concepts as basic units of human thinking and analysing data in the object-attribute form. Originated in early 80s, during the last three decades, it became a popular human-centred tool for knowledge representation and data analysis with numerous applications. Since the tutorial was specially prepared for RuSSIR 2014, the covered FCA topics include Information Retrieval with a focus on visualisation aspects, Machine Learning, Data Mining and Knowledge Discovery, Text Mining and several others.

The Rubik's cube was devised by Hungarian architect Erno Rubik more than 30 years ago, but he likely never envisioned his puzzle being cracked this quickly. The machine, known as'Sub1 Reloaded' and developed by German tech company Infineon, was aided by one of the world's most powerful microcomputers, solved a Rubik's cube in 0.637 seconds at the Electronica Trade Fair in Munich, Germany earlier this year. The machine, known as'Sub1 Reloaded' and developed by German tech company Infineon, was aided by one of the world's most powerful microcomputers'Guinness World Records has spent some time carefully reviewing the evidence, including ensuring that the cube and the pre-scrambling met all WCA standards, before confirming the new record today,' the organisation said. The robot took a fraction of a second to analyse the cube and make 21 moves to solve the puzzle. Its time of 0.637 seconds beat the previous world record of 0.887 seconds, set by an earlier prototype of the same machine.

This post is the second in a series of three posts, each of which discuss the fundamental concepts of Artificial Intelligence. In our first post we discussed AI definitions, helping our readers to understand the basic concepts behind AI, giving them the tools required to sift through the many AI articles out there and form their own opinion. In this second post, we will discuss several notions which are important in understanding the limits of AI. Figure 1: How intelligent can Artificial Intelligence get? When we speak about how far AI can go, there are two "philosophies": strong AI and weak AI. The most commonly followed philosophy is that of weak AI, which means that machines can manifest certain intelligent behavior to solve specific (hard) tasks, but that they will never equal the human mind.

Computer vision is concerned with the automatic extraction, analysis and understanding of useful information from a single image or a sequence of images. Making an approach to pursue the most advanced technology takes a lot of innovation and it is exactly what Mantra Labs has been doing. If you are keen to solve real world problem using AI, Drop us a line hello@mantra.ai

In classical planning, cost partitioning is a method for admissibly combining a set of heuristic estimators by distributing operator costs among the heuristics. An optimal cost partitioning is often prohibitively expensive to compute. Saturated cost partitioning is an alternative that is much faster to compute and has been shown to offer high-quality heuristic guidance on Cartesian abstractions. However, its greedy nature makes it highly susceptible to the order in which the heuristics are considered. We show that searching in the space of orders leads to significantly better heuristic estimates than with previously considered orders. Moreover, using multiple orders leads to a heuristic that is significantly better informed than any single-order heuristic. In experiments with Cartesian abstractions, the resulting heuristic approximates the optimal cost partitioning very closely.