Journal of Artificial Intelligence Research（JAIR ）的ISSUE 74论文列表

卷期号： Issue 74

发布时间：

卷期年份： 2021

卷期官网：

A Theoretical Perspective on Hyperdimensional Computing.

A Survey of Algorithms for Black-Box Safety Validation of Cyber-Physical Systems.

A Word Selection Method for Producing Interpretable Distributional Semantic Word Vectors.

Task-Aware Verifiable RNN-Based Policies for Partially Observable Markov Decision Processes.

NLP Methods for Extraction of Symptoms from Unstructured Data for Use in Prognostic COVID-19 Analytic Models.

Multi-Label Classification Neural Networks with Hard Logical Constraints.

Constraint-based Diversification of JOP Gadgets.

Reasoning with PCP-Nets.

Relevance in Belief Update.

Learning from Disagreement: A Survey.

Multilabel Classification with Partial Abstention: Bayes-Optimal Prediction under Label Independence.

Experimental Comparison and Survey of Twelve Time Series Anomaly Detection Algorithms.

Optimal Any-Angle Pathfinding on a Sphere.

Output Space Entropy Search Framework for Multi-Objective Bayesian Optimization.

Graph Kernels: A Survey.

sunny-as2: Enhancing SUNNY for Algorithm Selection.

Teaching People by Justifying Tree Search Decisions: An Empirical Study in Curling.

Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation.

On the Online Coalition Structure Generation Problem.

Optimizing for Interpretability in Deep Neural Networks with Tree Regularization.

Pure Nash Equilibria in Resource Graph Games.

Steady-State Planning in Expected Reward Multichain MDPs.

On the Computational Complexity of Non-Dictatorial Aggregation.

Learning Realistic Patterns from Visually Unrealistic Stimuli: Generalization and Data Anonymization.

On Quantifying Literals in Boolean Logic and its Applications to Explainable AI.

Quantum Mathematics in Artificial Intelligence.

Learning Optimal Decision Sets and Lists with SAT.

Flexible Bayesian Nonlinear Model Configuration.

Optimally Deceiving a Learning Leader in Stackelberg Games.

Finding the Hardest Formulas for Resolution.

Analysis of the Impact of Randomization of Search-Control Parameters in Monte-Carlo Tree Search.

A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs.

Contrastive Explanations of Plans through Model Restrictions.

The Rediscovery Hypothesis: Language Models Need to Meet Linguistics.