| A Game Theoretic Analysis of the Adversarial Retrieval Setting |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Knowledge Level Account of Forgetting |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Model-Theoretic View on Qualitative Constraint Reasoning |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Neural Probabilistic Structured-Prediction Method for Transition-Based Natural Language Processing |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| A Probabilistic Formalization of the Appraisal for the OCC Event-Based Emotions |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Survey on Lexical Simplification |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| AND/OR Branch-and-Bound on a Computational Grid |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Adopting the Cascade Model in Ad Auctions: Efficiency Bounds and Truthful Algorithmic Mechanisms |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Axiomatising Incomplete Preferences through Sets of Desirable Gambles |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Combinatorial Multi-armed Bandits for Real-Time Strategy Games |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Combining Lexical and Syntactic Features for Detecting Content-Dense Texts in News |
❌ |
❌ |
✅ |
✅ |
❌ |
✅ |
✅ |
4 |
| Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation |
✅ |
✅ |
✅ |
❌ |
✅ |
✅ |
✅ |
6 |
| Complexity of n-Queens Completion |
❌ |
✅ |
✅ |
❌ |
✅ |
✅ |
❌ |
4 |
| Computational Aspects of Nearly Single-Peaked Electorates |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Confidence Decision Trees via Online and Active Learning for Streaming Data |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Controlled School Choice with Soft Bounds and Overlapping Types |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| DESPOT: Online POMDP Planning with Regularization |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Decision-Theoretic Planning Under Anonymity in Agent Populations |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Dynamic Repositioning to Reduce Lost Demand in Bike Sharing Systems |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Elections with Few Voters: Candidate Control Can Be Easy |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Encoding Domain Transitions for Constraint-Based Planning |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Explicit Document Modeling through Weighted Multiple-Instance Learning |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
5 |
| Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Game-Theoretic Question Selection for Tests |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
4 |
| Indirect Causes in Dynamic Bayesian Networks Revisited |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
3 |
| Kernel Contraction and Base Dependence |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Learning Discrete Bayesian Networks from Continuous Data |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
5 |
| Learning Neural Audio Embeddings for Grounding Semantics in Auditory Perception |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Logical Formalizations of Commonsense Reasoning: A Survey |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Logics of Common Ground |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Managing Different Sources of Uncertainty in a BDI Framework in a Principled Way with Tractable Fragments |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
3 |
| Market Interfaces for Electric Vehicle Charging |
✅ |
✅ |
❌ |
❌ |
✅ |
❌ |
✅ |
4 |
| Multi-Organ Exchange |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| On Hash-Based Work Distribution Methods for Parallel Best-First Search |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| On Monte Carlo Tree Search and Reinforcement Learning |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| On the Equivalence between Assumption-Based Argumentation and Logic Programming |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On the Semantics and Complexity of Probabilistic Logic Programs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Perturbation Training for Human-Robot Teams |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Preference-Based Inconsistency Management in Multi-Context Systems |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Prime Implicate Generation in Equational Logic |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Probabilistic Description Logics for Subjective Uncertainty |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Probabilistic Reasoning with Abstract Argumentation Frameworks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Randomized Social Choice Functions Under Metric Preferences |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Rationalisation of Profiles of Abstract Argumentation Frameworks: Characterisation and Complexity |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Residual-Guided Look-Ahead in AND/OR Search for Graphical Models |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation |
✅ |
✅ |
✅ |
❌ |
✅ |
✅ |
✅ |
6 |
| Robots in Retirement Homes: Applying Off-the-Shelf Planning and Scheduling to a Team of Assistive Robots |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
3 |
| Sample-Based Tree Search with Fixed and Adaptive State Abstractions |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Sampling Based Approaches for Minimizing Regret in Uncertain Markov Decision Processes (MDPs) |
✅ |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
4 |
| Some Properties of Batch Value of Information in the Selection Problem |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Subset Selection Via Implicit Utilitarian Voting |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| The Computational Complexity of Structure-Based Causality |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| The Price of Anarchy in Auctions |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Sixth Answer Set Programming Competition |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Tie-Breaking Strategies for Cost-Optimal Best First Search |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Time and Space Bounds for Planning |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Uniform Random Generation and Dominance Testing for CP-Nets |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Viewpoint: A Critical View on Smart Cities and AI |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Welfare Effects of Market Making in Continuous Double Auctions |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |