default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Artificial Intelligence Research, Volume 54
Volume 54, September 2015
- Roy Bar-Haim, Ido Dagan, Jonathan Berant:
Knowledge-Based Textual Inference via Parse-Tree Transformations. 1-57 - Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle:
Solving #SAT and MAXSAT by Dynamic Programming. 59-82 - Rubén Izquierdo, Armando Suárez
, German Rigau:
Word vs. Class-Based Word Sense Disambiguation. 83-122 - Scott Kiesel, Ethan Burns, Wheeler Ruml:
Achieving Goals Quickly Using Real-time Search: Experimental Results in Video Games. 123-158 - Lluís Formiga, Alberto Barrón-Cedeño, Lluís Màrquez, Carlos A. Henríquez Q., José B. Mariño:
Leveraging Online User Feedback to Improve Statistical Machine Translation. 159-192 - Hannes Strass:
Expressiveness of Two-Valued Semantics for Abstract Dialectical Frameworks. 193-231 - Meir Kalech, Shulamit Reches:
Decision Making with Dynamic Uncertain Events. 233-275 - Till Mossakowski, Reinhard Moratz:
Relations Between Spatial Calculi About Directions and Orientations. 277-308 - Yujiao Zhou, Bernardo Cuenca Grau, Yavor Nenov, Mark Kaminski, Ian Horrocks:
PAGOdA: Pay-As-You-Go Ontology Query Answering Using a Datalog Reasoner. 309-367 - Fazlul Hasan Siddiqui, Patrik Haslum:
Continuing Plan Quality Optimisation. 369-435 - Igor Rochlin, David Sarne:
Constraining Information Sharing to Improve Cooperative Information Gathering. 437-469 - Joseph Y. Halpern:
Weighted Regret-Based Likelihood: A New Approach to Describing Uncertainty. 471-492 - Haris Aziz, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jérôme Lang, Hans Georg Seedig:
Possible and Necessary Winners of Partial Tournaments. 493-534 - Andreas Steigmiller, Birte Glimm:
Pay-As-You-Go Description Logic Reasoning by Coupling Tableau and Saturation Procedures. 535-592 - Ben Strasser, Adi Botea, Daniel Harabor:
Compressing Optimal Paths with Run Length Encoding. 593-629 - Tatsuya Imai, Alex Fukunaga:
On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning. 631-677
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
