Planning—in its classical sense—is the problem of finding a sequence of actions that achieves a predefined goal. As such, much of the research in AI planning has been focused on methodologies and issues related to the development of efficient planners. To date, several efficient planning systems have been developed (e.g., see [3] for a summary of planners that competed in the International Conf...

Solving algebraic word problems requires executing a series of arithmetic operations—a program—to obtain a final answer. However, since programs can be arbitrarily complicated, inducing them directly from question-answer pairs is a formidable challenge. To make this task more feasible, we solve these problems by generating answer rationales, sequences of natural language and human-readable math...

in this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. since cell formation problem is np-hard, two algorithms based on genetic and modified particle swarm optimization (mpso) algorithms are developed to solve the problem. for generating initial solutions in these algorithms, a new heuristic method is developed, which always cre...

in this paper using strongly duplexes we introduce a new class of (semi)hypergroups. the associated (semi)hypergroup from a strongly duplex is called duplex (semi)hypergroup. two computer programs written in matlab show that the two groups $z_{2n}$ and $z_{n}times z_{2}$ produce a strongly duplex and its associated hypergroup is a complementary feasible hypergroup.

this paper proposes a gait planning approach to reduce the required friction for a biped robot walking on various surfaces. to this end, a humanoid robot with 18 dof is considered to develop a dynamics model for studying various 3d manoeuvres. then, feasible trajectories are developed to alleviate the fluctuations on the upper body to resemble human-like walking. in order to generate feasible w...

Do multiple listeners to the public Twitter sample stream receive the same tweets? Due to limitations on redistribution of Twitter data, the answer to this question is important for the replicability and reproducibility of research findings. A negative answer creates barriers for different research groups to evaluate algorithms and systems on the same collection of tweets. We describe a pilot e...

We address the problem of generating complete games, rather than content for existing games. In particular, we try to answer the question which types of games it would be realistic or even feasible to generate. To begin to answer the question, we first list the different ways we see that games could be generated, and then try to discuss what characterises games that would be comparatively easy ...

Answer Set Programming has become a host for expressing knowledge representation problems, which reinforces the interest in efficient methods for computing answer sets of a logic program. While for propositional programs, the complexity of this task has been amply studied and is wellunderstood, less attention has been paid to the case of nonground programs, which is much more important from a K...