default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Artificial Intelligence Research, Volume 60
Volume 60, September 2017
- Johannes Peter Wallner, Andreas Niskanen
, Matti Järvisalo:
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation. 1-40 - Martin Gebser, Marco Maratea, Francesco Ricca:
The Sixth Answer Set Programming Competition. 41-95 - Mehrdad Oveisi, James P. Delgrande, Francis Jeffry Pelletier, Fred Popowich:
Kernel Contraction and Base Dependence. 97-148 - Stéphane Airiau, Elise Bonzon, Ulle Endriss, Nicolas Maudet, Julien Rossit:
Rationalisation of Profiles of Abstract Argumentation Frameworks: Characterisation and Complexity. 149-177 - Yinfei Yang, Ani Nenkova:
Combining Lexical and Syntactic Features for Detecting Content-Dense Texts in News. 179-219 - Fábio Gagliardi Cozman, Denis Deratani Mauá:
On the Semantics and Complexity of Probabilistic Logic Programs. 221-262 - Nikolaos Kariotoglou, Maryam Kamgarpour, Tyler H. Summers, John Lygeros:
The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes. 263-284 - William Lam, Kalev Kask, Javier Larrosa, Rina Dechter:
Residual-Guided Look-Ahead in AND/OR Search for Graphical Models. 287-346 - Thomas Eiter, Antonius Weinzierl:
Preference-Based Inconsistency Management in Multi-Context Systems. 347-424 - Peng Yu, Brian Charles Williams, Cheng Fang, Jing Cui, Patrik Haslum:
Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation. 425-490 - Yuu Jinnai, Alex Fukunaga:
On Hash-Based Work Distribution Methods for Parallel Best-First Search. 491-548 - Gustavo H. Paetzold, Lucia Specia:
A Survey on Lexical Simpli cation. 549-593 - Christer Bäckström, Peter Jonsson:
Time and Space Bounds for Planning. 595-638 - John P. Dickerson, Tuomas Sandholm:
Multi-Organ Exchange. 639-679 - Daniela Inclezan, Luis Pradanos:
Viewpoint: A Critical View on Smart Cities and AI. 681-686 - Piotr Skowron, Piotr Faliszewski:
Chamberlin-Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time. 687-716 - Jesse Hostetler, Alan Fern, Thomas G. Dietterich:
Sample-Based Tree Search with Fixed and Adaptive State Abstractions. 717-777 - Martin Caminada, Claudia Schulz:
On the Equivalence between Assumption-Based Argumentation and Logic Programming. 779-825 - Mnacho Echenim, Nicolas Peltier, Sophie Tourret:
Prime Implicate Generation in Equational Logic. 827-880 - Tom Vodopivec, Spyridon Samothrakis, Branko Ster:
On Monte Carlo Tree Search and Reinforcement Learning. 881-936 - Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. 937-1002 - Douwe Kiela, Stephen Clark:
Learning Neural Audio Embeddings for Grounding Semantics in Auditory Perception. 1003-1030 - Rocco De Rosa, Nicolò Cesa-Bianchi:
Confidence Decision Trees via Online and Active Learning for Streaming Data. 1031-1055 - Marco Zaffalon, Enrique Miranda:
Axiomatising Incomplete Preferences through Sets of Desirable Gambles. 1057-1126 - Ran Ben-Basat, Moshe Tennenholtz, Oren Kurland:
A Game Theoretic Analysis of the Adversarial Retrieval Setting. 1127-1164 - James P. Delgrande:
A Knowledge Level Account of Forgetting. 1165-1213
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-12-03 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:
