| A COP Model For Graph-Constrained Coalition Formation |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| A Complexity Approach for Core-Selecting Exchange under Conditionally Lexicographic Preferences |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Core Method for the Weak Completion Semantics with Skeptical Abduction |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Review of Inference Algorithms for Hybrid Bayesian Networks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| AND/OR Search for Marginal MAP |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Actively Estimating Crowd Annotation Consensus |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| An Exhaustive DPLL Algorithm for Model Counting |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
❌ |
4 |
| Approximation and Parameterized Complexity of Minimax Approval Voting |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Axiomatic Characterization of Game-Theoretic Centrality |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Belief Integration and Source Reliability Assessment |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Belief Update within Propositional Fragments |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Bisimulations on Data Graphs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Bounds on the Cost of Stabilizing a Cooperative Game |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Column Generation Algorithms for Constrained POMDPs |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Computing Hierarchical Finite State Controllers With Classical Planning |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions |
✅ |
✅ |
✅ |
❌ |
✅ |
✅ |
✅ |
6 |
| Cooperative, Dynamics-based, and Abstraction-Guided Multi-robot Motion Planning |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Coordinating Measurements in Uncertain Participatory Sensing Settings |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Corpus-Level Fine-Grained Entity Typing |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Cycles and Intractability in a Large Class of Aggregation Rules |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Data-driven Conceptual Spaces: Creating Semantic Representations For Linguistic Descriptions Of Numerical Data |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Distributed Constraint Optimization Problems and Applications: A Survey |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Efficient Computation of Semivalues for Game-Theoretic Network Centrality |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access |
✅ |
✅ |
✅ |
❌ |
✅ |
✅ |
✅ |
6 |
| Extending Classical Planning with State Constraints: Heuristics and Search for Optimal Planning |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
✅ |
5 |
| Fact-Alternating Mutex Groups for Classical Planning |
✅ |
✅ |
✅ |
❌ |
✅ |
✅ |
✅ |
6 |
| From Feature To Paradigm: Deep Learning In Machine Translation |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| From Skills to Symbols: Learning Symbolic Representations for Abstract High-Level Planning |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| From Word To Sense Embeddings: A Survey on Vector Representations of Meaning |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Graphical Model Market Maker for Combinatorial Prediction Markets |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Grounding Language for Transfer in Deep Reinforcement Learning |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Human-Machine Collaborative Optimization via Apprenticeship Scheduling |
✅ |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
4 |
| Incentive-Compatible Mechanisms for Norm Monitoring in Open Multi-Agent Systems |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| KABouM: Knowledge-Level Action and Bounding Geometry Motion Planner |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| LTL on Finite and Process Traces: Complexity Results and a Practical Reasoner |
❌ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Learning Explanatory Rules from Noisy Data |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Lifted Relational Neural Networks: Efficient Learning of Latent Relational Structures |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Linear Satisfiability Preserving Assignments |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| MCTS-Minimax Hybrids with State Evaluations |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| On the Behavior of Convolutional Nets for Feature Extraction |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Optimal Torpedo Scheduling |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Pre-Wiring and Pre-Training: What Does a Neural Network Need to Learn Truly General Identity Rules? |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| Proximal Gradient Temporal Difference Learning: Stable Reinforcement Learning with Polynomial Sample Complexity |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Query Answering with Transitive and Linear-Ordered Data |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Querying Log Data with Metric Temporal Logic |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Rademacher Complexity Bounds for a Penalized Multi-class Semi-supervised Algorithm |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Resource-bounded Norm Monitoring In Multi-agent Systems |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Revisiting the Approximation Bound for Stochastic Submodular Cover |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Robust Text Classification under Confounding Shift |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| SMOTE for Learning from Imbalanced Data: Progress and Challenges, Marking the 15-year Anniversary |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| ScottyActivity: Mixed Discrete-Continuous Planning with Convex Optimization |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Solving Large Problems with Heuristic Search: General-Purpose Parallel External-Memory Search |
✅ |
✅ |
✅ |
✅ |
✅ |
❌ |
✅ |
6 |
| Solving Multi-agent Path Finding on Strongly Biconnected Digraphs |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| State-Space Abstractions for Probabilistic Inference: A Systematic Review |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Survey of the State of the Art in Natural Language Generation: Core tasks, applications and evaluation |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Symbol Grounding Association in Multimodal Sequences with Missing Elements |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| The Power of Verification for Greedy Mechanism Design |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Transition-Based Neural Word Segmentation Using Word-Level Features |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
5 |
| Trust as a Precursor to Belief Revision |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Verification of Distributed Epistemic Gossip Protocols |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Viewpoint: Artificial Intelligence Government (Gov. 3.0): The UAE Leading Model |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Viewpoint: When Will AI Exceed Human Performance? Evidence from AI Experts |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Visualisation and 'Diagnostic Classifiers' Reveal How Recurrent and Recursive Neural Networks Process Hierarchical Structure |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
5 |
| Watching and Acting Together: Concurrent Plan Recognition and Adaptation for Human-Robot Teams |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |