Volume 60 Masthead

Published: 2017-09-01

Articles

Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation

Johannes P. Wallner, Andreas Niskanen, Matti Järvisalo

1-40

PDF PS

The Sixth Answer Set Programming Competition

Martin Gebser, Marco Maratea, Francesco Ricca

41-95

PDF PS

Kernel Contraction and Base Dependence

Mehrdad Oveisi, James P. Delgrande, Francis Jeffry Pelletier, Fred Popowich

97-148

PDF PS

Rationalisation of Profiles of Abstract Argumentation Frameworks: Characterisation and Complexity

Stéphane Airiau, Elise Bonzon, Ulle Endriss, Nicolas Maudet, Julien Rossit

149-177

PDF

Combining Lexical and Syntactic Features for Detecting Content-Dense Texts in News

Yinfei Yang, Ani Nenkova

179-219

PDF

On the Semantics and Complexity of Probabilistic Logic Programs

Fabio Gagliardi Cozman, Denis Deratani Mauá

221-262

PDF

The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes

Nikolaos Kariotoglou, Maryam Kamgarpour, Tyler H. Summers, John Lygeros

263-285

PDF

Residual-Guided Look-Ahead in AND/OR Search for Graphical Models

William Lam, Kalev Kask, Javier Larrosa, Rina Dechter

287-346

PDF

Preference-Based Inconsistency Management in Multi-Context Systems

Thomas Eiter, Antonius Weinzierl

347-424

PDF

Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation

Peng Yu, Brian Williams, Cheng Fang, Jing Cui, Patrik Haslum

425-490

PDF

On Hash-Based Work Distribution Methods for Parallel Best-First Search

Yuu Jinnai, Alex Fukunaga

491-548

PDF

A Survey on Lexical Simplification

Gustavo H. Paetzold, Lucia Specia

549-593

PDF

Time and Space Bounds for Planning

Christer Bäckström, Peter Jonsson

595-638

PDF PS

Multi-Organ Exchange

John P. Dickerson, Tuomas Sandholm

639-679

PDF

Viewpoint: A Critical View on Smart Cities and AI

Daniela Inclezan, Luis I. Pradanos

681-686

PDF

Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time

Piotr Skowron, Piotr Faliszewski

687-716

PDF

Sample-Based Tree Search with Fixed and Adaptive State Abstractions

Jesse Hostetler, Alan Fern, Thomas Dietterich

717-777

PDF

On the Equivalence between Assumption-Based Argumentation and Logic Programming

Martin Caminada, Claudia Schulz

779-825

PDF PS

Prime Implicate Generation in Equational Logic

Mnacho Echenim, Nicolas Peltier, Sophie Tourret

827-880

PDF PS

On Monte Carlo Tree Search and Reinforcement Learning

Tom Vodopivec, Spyridon Samothrakis, Branko Ster

881-936

PDF

Elections with Few Voters: Candidate Control Can Be Easy

Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon

937-1002

PDF PS

Learning Neural Audio Embeddings for Grounding Semantics in Auditory Perception

Douwe Kiela, Stephen Clark

1003-1030

PDF

Confidence Decision Trees via Online and Active Learning for Streaming Data

Rocco De Rosa, Nicolò Cesa-Bianchi

1031-1055

PDF

Axiomatising Incomplete Preferences through Sets of Desirable Gambles

Marco Zaffalon, Enrique Miranda

1057-1126

PDF PS

A Game Theoretic Analysis of the Adversarial Retrieval Setting

Ran Ben Basat, Moshe Tennenholtz, Oren Kurland

1127-1164

PDF PS

A Knowledge Level Account of Forgetting

James P. Delgrande

1165-1213

PDF PS