scispace - formally typeset
Search or ask a question

Showing papers in "Artificial Intelligence in 2013"


Journal ArticleDOI
TL;DR: YAGO2 as mentioned in this paper is an extension of the YAGO knowledge base, in which entities, facts, and events are anchored in both time and space, and it contains 447 million facts about 9.8 million entities.

1,186 citations


Journal ArticleDOI
TL;DR: This work concludes that methods that extract global bag-level information show a clearly superior performance in general and permits us to establish guidelines in the design of new MIL methods.

561 citations


Journal ArticleDOI
TL;DR: The ER rule completes and enhances [email protected]?s rule by identifying how to combine pieces of fully reliable evidence that are highly or completely conflicting through a new reliability perturbation analysis.

508 citations


Journal ArticleDOI
TL;DR: The Wikipedia Miner toolkit is introduced, an open-source software system that allows researchers and developers to integrate Wikipedia's rich semantics into their own applications, and creates databases that contain summarized versions of Wikipedia's content and structure.

382 citations


Journal ArticleDOI
Joel Nothman1, Nicky Ringland1, Will Radford1, Tara Murphy1, James Curran1 
TL;DR: The approach outperforms other approaches to automatic ne annotation; competes with gold-standard training when tested on an evaluation corpus from a different source; and performs 10% better than newswire-trained models on manually-annotated Wikipedia text.

338 citations


Journal ArticleDOI
TL;DR: It is shown that under some assumptions, the resulting framework satisfies key properties and rationality postulates, and it is argued that ASPIC^+@?s modelling of defeasible inference rules further testifies to the generality of the framework.

310 citations


Journal ArticleDOI
TL;DR: This work reimplement three seminal nel systems and presents a detailed evaluation of search strategies, finding that coreference and acronym handling lead to substantial improvement, and search strategies account for much of the variation between systems.

277 citations


Journal ArticleDOI
David A. Ferrucci1, Anthony Levas1, Sugato Bagchi1, David C. Gondek1, Erik T. Mueller1 
TL;DR: A vision for an evidence-based clinical decision support system that affords exploration of a broad range of hypotheses and their associated evidence, as well as uncovers missing information that can be used in mixed-initiative dialog is elaborated upon.

272 citations


Journal ArticleDOI
TL;DR: This work presents a novel formalization for the problem of optimal pathfinding for multiple agents which includes a search tree called the increasing cost tree (ICT) and a corresponding search algorithm, called the increase cost tree search (ICTS) that finds optimal solutions.

196 citations


Journal ArticleDOI
TL;DR: The overall picture shows that not only are semi-structured resources enabling a renaissance of knowledge-rich AI techniques, but also that significant advances in high-end applications that require deep understanding capabilities can be achieved by synergistically exploiting large amounts of machine-readable structured knowledge in combination with sound statistical AI and NLP techniques.

176 citations


Journal ArticleDOI
TL;DR: An in-depth analysis and the key insights gained from the Second International Automated Negotiating Agents Competition (ANAC 2011) show that the most adaptive negotiation strategies, while robust across different opponents, are not necessarily the ones that win the competition.

Journal ArticleDOI
TL;DR: This paper presents several algorithms specially designed to deal with industrial or real problems based on the idea of solving MaxSAT through successive calls to a SAT solver, and shows that this SAT-based technique is efficient in solving industrial problems.

Journal ArticleDOI
TL;DR: A non-monotonic extension of the Description Logic ALC for reasoning about prototypical properties and inheritance with exceptions is proposed, and by means of ALC+T"m"i"n the authors are able to infer defeasible properties of (explicit or implicit) individuals.

Journal ArticleDOI
TL;DR: This paper defends the margin-based explanation against Breiman's doubts by proving a new generalization error bound that considers exactly the same factors as Schapire et al. (1998) but is sharper than Breiman@?s (1999) minimum margin bound.

Journal ArticleDOI
TL;DR: This paper presents a novel framework of Transfer by Collective Factorization (TCF), in which a shared latent space is constructed collectively and the data-dependent effect is captured separately to increase the overall quality of knowledge transfer.

Journal ArticleDOI
TL;DR: In this paper, decision-theoretic techniques for the problem of optimizing workflows used in crowdsourcing are presented, where AI agents that use Bayesian network learning and inference in combination with Partially-Observable Markov Decision Processes (POMDPs) for obtaining excellent cost-quality tradeoffs.

Journal ArticleDOI
TL;DR: In this paper, the authors study the data complexity of answering conjunctive queries over description logic knowledge bases, and show that the description logics of the DL-Lite family are essentially the maximal logics allowing for query answering over very large ABoxes.


Journal ArticleDOI
Hannes Strass1
TL;DR: This work provides a systematic in-depth study of the semantics of abstract dialectical frameworks (ADFs), a recent generalisation of Dung argumentation frameworks, by associating with an ADF its characteristic one-step consequence operator and defining various semantics for ADFs as different fixpoints of this operator.

Journal ArticleDOI
TL;DR: It is shown how Wikipedia's existing network of categories and articles can be built upon to automatically discover new relations and their instances, and how this is a high quality resource and beneficial to various NLP tasks.

Journal ArticleDOI
TL;DR: The analysis discloses that recombination may accelerate the filling of the Pareto front by recombining diverse solutions and thus help solve multi-objective optimization.

Journal ArticleDOI
TL;DR: This paper discusses notions of modules of a TBox based on model-theoretic inseparability and develop algorithms for extracting minimal modules from acyclic TBoxes and provides an experimental evaluation of the module extraction algorithm.

Journal ArticleDOI
Shaowei Cai1, Kaile Su1
TL;DR: A new variable property called subscore is proposed, which is utilized to break ties in the CCA heuristic when candidate variables for flipping have the same score, and the resulting algorithm CCAsubscore is very efficient for solving random k-SAT instances with k>3, and significantly outperforms other state-of-the-art ones.

Journal ArticleDOI
TL;DR: The optimal approximation ratio with the approximation ratio achieved by two-dimensional sets maximizing the hypervolume indicator are compared and it is proved that the same asymptotic approximation ratio is achieved by sets of n points that maximize thehypervolume indicator.

Journal ArticleDOI
TL;DR: A necessary and sufficient condition for the consistency of multi-label learning based on surrogate loss functions is proved and two well-known multi- label loss functions are studied, i.e., ranking loss and hamming loss.

Journal ArticleDOI
TL;DR: In this paper, the authors proposed a method for computing semantic relatedness between words or texts by using knowledge from hypertext encyclopedias such as Wikipedia, where two types of weighted links between concepts are considered: one based on hyperlinks between the texts of the articles, and another based on the lexical similarity between them.

Journal ArticleDOI
TL;DR: In this paper, the authors consider a number of solution concepts from cooperative game theory, welfare theory, and social choice theory as criteria for desirable partitions in additively separable hedonic games.

Journal ArticleDOI
TL;DR: Survey research on the analysis of multiparticipant chat finds relevant problems and how these have been addressed using AI techniques and identifies recent research trends and unresolved issues.

Journal ArticleDOI
TL;DR: A variant of the formal notion of simulation is exploited to formally capture the notion of ''mimicking'', and it is shown that the technique proposed is sound and complete, optimal with respect to computational complexity, and robust for different kind of system failures.

Journal ArticleDOI
TL;DR: This paper investigates inconsistency measurement in probabilistic conditional logic, a logic that incorporates uncertainty and focuses on the role of conditionals, i.e. if-then rules by extending inconsistency measures for classical logic to the probabilism setting and proposes novel inconsistency measures that are specifically tailored for the Probabilistic case.