scispace - formally typeset
Search or ask a question

Showing papers in "Artificial Intelligence in 2015"


Journal ArticleDOI
TL;DR: A new search algorithm called Conflict Based Search (CBS), which enables CBS to examine fewer states than A* while still maintaining optimality and shows a speedup of up to a full order of magnitude over previous approaches.

433 citations


Journal ArticleDOI
TL;DR: A new framework for multirobot path planning called subdimensional expansion is introduced, which initially plans for each robot individually, and then coordinates motion among the robots as needed, and M ⁎ is proven to be complete and to find minimal cost paths.

310 citations


Journal ArticleDOI
TL;DR: The proposed approach, BiGE, is the first step towards a new way of addressing many-objective problems as well as indicating several important issues for future development of this type of algorithms.

181 citations


Journal ArticleDOI
TL;DR: This article surveys the main dynamic-programming approaches and anytime algorithms developed for coalition structure generation, and considers techniques specifically developed for a range of compact representation schemes for coalitional games.

152 citations


Journal ArticleDOI
TL;DR: This survey gives an overview on different methods for solving reasoning problems in abstract argumentation and compare their particular features, and highlights available state-of-the-art systems for Abstract argumentation, which put these methods to practice.

152 citations


Journal ArticleDOI
TL;DR: This work adopts a utilitarian perspective on social choice, assuming that agents have (possibly latent) utility functions over some space of alternatives and studies optimal social choice functions under three different models, and underscores the important role played by scoring functions.

149 citations


Journal ArticleDOI
TL;DR: This paper first considers rational closure as defined by Lehman and Magidor for propositional logic, and provides a semantic characterization based on a minimal models mechanism on rational models, then extends the whole formalism and semantics to Description Logics.

140 citations


Journal ArticleDOI
TL;DR: This work uses the stochastic dominance relation between fractional or randomized allocations to systematically define varying notions of proportionality and envy-freeness for discrete assignments and proposes fairness concepts that always suggest a non-empty set of assignments with meaningful fairness properties.

135 citations


Journal ArticleDOI
TL;DR: The experimental results have shown that the MA using both MatchFmeasure and UIR is effective to simultaneously align multiple pairs of ontologies and avoid the bias improvement caused by MatchFeasure, and the comparison with state-of-the-art ontology matching systems further indicates the effectiveness of the proposed method.

129 citations


Journal ArticleDOI
TL;DR: In this paper, the complexity of winner determination under the Monroe and Chamberlin-Courant multiwinner voting rules was studied, where the total satisfaction or dissatisfaction of the voters with their representatives is calculated either as the sum of individual (dis)satisfactions in the utilitarian case or as the (dis)-satisfaction of the worst off voter in the egalitarian case.

106 citations


Journal ArticleDOI
TL;DR: It is argued that the law is a rich test bed and important application field for logic-based AI research, and the recent trend of widening the scope of logic from deduction to information flow, argumentation and interaction is confirmed.

Journal ArticleDOI
TL;DR: This article proposes a multiple-period mean reversion, or so-called "Moving Average Reversion" (MAR), and a new on-line portfolio selection strategy named "On-Line Moving Average Reverting" (OLMAR), which exploits MAR via efficient and scalable online machine learning techniques.

Journal ArticleDOI
TL;DR: The method first leverages the structural properties of a semantic network in order to model arbitrary linguistic items through a unified probabilistic representation, and then compares the linguistic items in terms of their representations.

Journal ArticleDOI
TL;DR: This paper presents a formal basis for examining extension-based semantics in terms of the sets of extensions that these may express within a single AF and provides a number of characterization theorems which guarantee the existence of AFs whose set of extensions satisfy specific conditions and derive preliminary complexity results for decision problems that require such characterizations.

Journal ArticleDOI
TL;DR: A framework-based approach is proposed where a basis for defining different formal models of hierarchical planning is provided, and two models that comprise a large portion of HTN planners are defined, which provide a novel and comprehensive viewpoint on a core AI planning technique.

Journal ArticleDOI
TL;DR: This paper contributes to the practical support of nonmonotonic inferences in description logics by introducing a new semantics expressly designed to address knowledge engineering needs, which has appealing expressiveness, enjoys nice computational properties, and constitutes an interesting solution to an ample class of application needs.

Journal ArticleDOI
TL;DR: This paper first induces a conceptual space from the text documents, then relies on the key insight that the required semantic relations correspond to qualitative spatial relations in this conceptual space, and experimentally shows that these classifiers can outperform standard approaches, while being able to provide intuitive explanations of classification decisions.

Journal ArticleDOI
TL;DR: This article presents the RoboCup@Home competition, which is the largest worldwide competition for domestic service robots, and shows how the definition of a proper scoring system allows for desired functionalities to be related to tasks and how the resulting analysis fuels subsequent changes to achieve general and robust solutions implemented by the teams.

Journal ArticleDOI
TL;DR: This work investigates the tractability region of red-black planning, extending Chen and Gimenez' characterization theorems for regular planning to the more general red- black setting, and identifies significant islands of tractable red- Black planning, and designs practical heuristic functions that can improve significantly on the state of the art in satisficing planning.

Journal ArticleDOI
TL;DR: This paper aims to investigate the research areas in MRS algorithms that have been evolved so far and to explore promising research directions for the future by reviewing 64 solution methods and algorithms according to their application in each operation and investigating their capabilities.

Journal ArticleDOI
TL;DR: The goal of this paper is to propose and analyse a transfer learning meta-algorithm that allows the implementation of distinct methods using heuristics to accelerate a Reinforcement Learning procedure in one domain (the target) that are obtained from another domain ( the source domain).

Journal ArticleDOI
TL;DR: The primary learning algorithm introduced in this article, which is called "vi-tamer", is the first algorithm to successfully learn non-myopically from reward generated by a human trainer and empirically shows that such non- myopic valuation facilitates higher-level understanding of the task.

Journal ArticleDOI
TL;DR: This paper presents a proof framework that allows for a near-universal classification of fuzzy DLs according to the decidability of their consistency problem, and provides matchingDecidability results for most of the remaining logics.

Journal ArticleDOI
TL;DR: This paper investigates belief revision where the underlying logic is that governing Horn clauses, and shows that classical (AGM) belief revision doesn’t immediately generalise to the Horn case, and extends AGM revision to inferentially-weaker Horn theories.

Journal ArticleDOI
TL;DR: This paper proposes three challenging but accessible problems that would both change the public perception of artificial intelligence and spur substantive research to advance the science.

Journal ArticleDOI
TL;DR: It is shown that by encoding the problem into Boolean satisfiability and applying the state of the art SAT solvers, one can obtain a discrepancy 2 sequence of length 1160 and a proof of the Erd?s discrepancy conjecture for C = 2, claiming that no discrepancy2 sequence oflength 1161, or more, exists.

Journal ArticleDOI
TL;DR: An efficient algorithm that acquires representation knowledge in the form of "deep features" reduces the requirements for knowledge engineering and is integrated into a machine-learning agent, SimStudent, which learns procedural knowledge by observing a tutor solve sample problems, and by getting feedback while actively solving problems on its own.

Journal ArticleDOI
TL;DR: This article reports on the main SAT solver competition held in 2012, SAT Challenge 2012, and presents an in-depth analysis of key aspects of the results obtained during the competition.

Journal ArticleDOI
TL;DR: This study forms additional constraints on such preorders that characterise precisely Parikh's axiom (P) and shows that Dalal's belief revision operator satisfies both weak and strong (P), and it is therefore relevance-sensitive.

Journal ArticleDOI
TL;DR: The results of the competition indicate significant progress with respect to previous competitions, but they also reveal that some issues remain open and need further research, such as the coverage of temporal planners when concurrency is required and the performance in the multi-core track.