Answer set programs with external source access may introduce new constants that are not present in the program, which is known as value invention. As naive value invention leads to programs with infinite grounding and answer sets, syntactic safety criteria are imposed on programs. However, traditional criteria are in many cases unnecessarily strong and limit expressiveness. We present liberal domain-expansion (de-) safe programs, a novel generic class of answer set programs with external source access that has a finite grounding and allows for value invention. De-safe programs use so-called term bounding functions as a parameter for modular instantiation with concrete—e.g., syntactic or semantic or both—safety criteria. This ensures extensibility of the approach in the future. We provide concrete instances of the framework and develop an operator that can be used for computing a finite grounding. Finally, we discuss related notions of safety from the literature, and show that our approach is strictly more expressive.

In many logic-based BDI agent programming languages, plan selection involves inferencing over some underlying knowledge representation. While context-sensitive plan selection facilitates the development of flexible, declarative programs, the overhead of evaluating repeated queries to the agent's beliefs and goals can result in poor run time performance. In this paper we present an approach to multi-cycle query caching for logic-based BDI agent programming languages. We extend the abstract performance model presented in (Alechina et al. 2012) to quantify the costs and benefits of caching query results over multiple deliberation cycles. We also present results of experiments with prototype implementations of both single- and multi-cycle caching in three logic-based BDI agent platforms, which demonstrate that significant performance improvements are achievable in practice.

In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. These cost vectors can be partially or completely ordered using a preference relation compatible with Pareto dominance. In this context, multiobjective preference-based search (MOPBS) aims at computing the preferred feasible solutions according to a predefined preference model, these preferred solutions being a subset (possibly the entire set) of Pareto optima. Standard algorithms for MOPBS perform a unidirectional search developing the search tree forward from the initial state to a goal state. Instead, in this paper, we focus on bidirectional search algorithms developing simultaneously one forward and one backward search tree. Although bi-directional search has been tested in various single objective problems, its efficiency in a multiobjective setting has never been studied. In this paper, we present several implementations of bidirectional preference-based search convenient for the multiobjective case and investigate their efficiency.

Games have played a prominent role as a test-bed for advancements in the field of Artificial Intelligence ever since its foundation over half a century ago, resulting in highly specialized world-class game-playing systems being developed for various games. The establishment of the International General Game Playing Competition in 2005, however, resulted in a renewed interest in more general problem solving approaches to game playing. In general game playing (GGP) the goal is to create game-playing systems that autonomously learn how to skillfully play a wide variety of games, given only the descriptions of the game rules. In this paper we review the history of the competition, discuss progress made so far, and list outstanding research challenges.

Publications that have influenced the growth of artificial intelligence are often difficult to obtain.  We first collected titles of several thousand publications from many well-known sources and then selected about 1850 titles considered to be especially influential.  We have identified, and in a few cases created, online versions of about half of these “classics in AI.”  Searchable text of the documents enables additional analysis of trends and influences.  Integration into the rest of the AITopics information portal contextualizes the classic publications.

We position a narrative-centred computational model for high-level knowledge representation and reasoning in the context of a range of assistive technologies concerned with "visuo-spatial perception and cognition" tasks. Our proposed narrative model encompasses aspects such as \emph{space, events, actions, change, and interaction} from the viewpoint of commonsense reasoning and learning in large-scale cognitive systems. The broad focus of this paper is on the domain of "human-activity interpretation" in smart environments, ambient intelligence etc. In the backdrop of a "smart meeting cinematography" domain, we position the proposed narrative model, preliminary work on perceptual narrativisation, and the immediate outlook on constructing general-purpose open-source tools for perceptual narrativisation. ACM Classification: I.2 Artificial Intelligence: I.2.0 General -- Cognitive Simulation, I.2.4 Knowledge Representation Formalisms and Methods, I.2.10 Vision and Scene Understanding: Architecture and control structures, Motion, Perceptual reasoning, Shape, Video analysis General keywords: cognitive systems; human-computer interaction; spatial cognition and computation; commonsense reasoning; spatial and temporal reasoning; assistive technologies

Many machine learning (ML) approaches are widely used to generate bioclimatic models for prediction of geographic range of organism as a function of climate. Applications such as prediction of range shift in organism, range of invasive species influenced by climate change are important parameters in understanding the impact of climate change. However, success of machine learning-based approaches depends on a number of factors. While it can be safely said that no particular ML technique can be effective in all applications and success of a technique is predominantly dependent on the application or the type of the problem, it is useful to understand their behaviour to ensure informed choice of techniques. This paper presents a comprehensive review of machine learning-based bioclimatic model generation and analyses the factors influencing success of such models. Considering the wide use of statistical techniques, in our discussion we also include conventional statistical techniques used in bioclimatic modelling.

She has (which includes a human user), while planning determines equipped the apartment with a series of service robots, the concrete actions that should be carried out in order to sensors and actuators which help her manage some of best support the perceived context. The domain description the physical and cognitive difficulties she has due to formalism used by SAM is based on metric temporal constraints; her age. Her home alerts her if she appears to be overcooking such domains model both the criteria for context inference her meals, and autonomously organizes when and the planning operators used for plan synthesis. The of the user and to contextually synthesize action plans for home recognizes when Malin is sleeping, eating and actuators in the intelligent environment. The knowledge representation scheme used in SAM is based State of the art robotic and sensor systems can be leveraged on Allen's Interval Relations (Allen 1984), augmented with to achieve intelligent functionalities that are useful in a number temporal bounds.

She has (which includes a human user), while planning determines equipped the apartment with a series of service robots, the concrete actions that should be carried out in order to sensors and actuators which help her manage some of best support the perceived context. The domain description the physical and cognitive difficulties she has due to formalism used by SAM is based on metric temporal constraints; her age. Her home alerts her if she appears to be overcooking such domains model both the criteria for context inference her meals, and autonomously organizes when and the planning operators used for plan synthesis. The of the user and to contextually synthesize action plans for home recognizes when Malin is sleeping, eating and actuators in the intelligent environment. The knowledge representation scheme used in SAM is based State of the art robotic and sensor systems can be leveraged on Allen's Interval Relations (Allen 1984), augmented with to achieve intelligent functionalities that are useful in a number temporal bounds.

She has (which includes a human user), while planning determines equipped the apartment with a series of service robots, the concrete actions that should be carried out in order to sensors and actuators which help her manage some of best support the perceived context. The domain description the physical and cognitive difficulties she has due to formalism used by SAM is based on metric temporal constraints; her age. Her home alerts her if she appears to be overcooking such domains model both the criteria for context inference her meals, and autonomously organizes when and the planning operators used for plan synthesis. The of the user and to contextually synthesize action plans for home recognizes when Malin is sleeping, eating and actuators in the intelligent environment. The knowledge representation scheme used in SAM is based State of the art robotic and sensor systems can be leveraged on Allen's Interval Relations (Allen 1984), augmented with to achieve intelligent functionalities that are useful in a number temporal bounds.