#J1 Compact and Efficient Encodings for Planning in Factored State and Action Spaces with Learned Binarized Neural Network Transition Models
#J2 Planning-based knowing how: a unified approach
#J3 Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
#J5 Show or Suppress? Managing Input Uncertainty in Machine Learning Model Explanations
#J6 Improved High Dimensional Discrete Bayesian Network Inference using Triplet Region Construction
#J7 Efficient Retrieval of Matrix Factorization-Based Top-k Recommendations
#J8 SCCWalk: An Efficient Local Search Algorithm and Its Improvements for Maximum Weight Clique Problem (Extended Abstract)
#J9 Toward Personalized XAI: A Case Study in Intelligent Tutoring Systems
#J10 Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability
#J13 Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games
#J15 Interestingness Elements for Explainable Reinforcement Learning: Understanding Agents’ Capabilities and Limitations
#J16 Explaining individual predictions when features are dependent: More accurate approximations to Shapley values
#J17 Sliding-Window Thompson Sampling for Non-Stationary Settings
#J18 A Differential Privacy Mechanism that Accounts for Network Effects for Crowdsourcing System
#J19 Lifted Bayesian Filtering in Multiset Rewriting Systems
#J20 X*: Anytime Multi-Agent Path Finding for Sparse Domains using Window-Based Iterative Repairs
#J21 Time-scale Differences will Influence the Regulation Required in an Idealised AI Race Game
#J22 Learning Temporal Causal Sequence Relationships from Real-Time Time-Series
#J24 Expecting the unexpected: Goal recognition for rational and irrational agents
#J25 Acceptance in Incomplete Argumentation Frameworks
#J26 Probabilistic Reasoning About Epistemic Action Narratives
#J27 Properties of Switch-List Representations of Boolean Functions
#J28 Integrated Offline and Online Decision Making Under Uncertainty
#J29 Letter to the Program Committee of the IJCAI 2021 Journal Track AIJ 2021 paper “A Lightweight Epistemic Logic and its Application to Planning”
#J30 Differential Privacy of Hierarchical Census Data: An Optimization Approach
#J31 Jointly Improving Parsing and Perception for Natural Language Commands through Human-Robot Dialog
#J33 Belief change and 3-valued logics: Characterization of 19,683 belief change operators
#J34 Acyclic Orders, Partition Schemes and CSPs: Unified Hardness Proofs and Improved Algorithms
#J35 Boolean algebras of conditionals, probability and logic
#J36 How do fairness definitions fare? Testing public attitudes towards three algorithmic definitions of fairness in loan allocations
#J37 DEL-based Epistemic Planning: Decidability and Complexity
#J38 Intrinsic Approaches to Prioritizing Diagnoses in Multi-Context Systems
#J39 Deep Reinforcement Learning: A State-of-the-Art Walkthrough
#J40 Explaining Black-Box Classifiers Using Post-Hoc Explanations-by-Example
#J41 Automated Conjecturing II: Chomp and Reasoned Game Play
#J42 Computational Complexity of Flat and Generic Assumption-Based Argumentation, With and Without Probabilities
#J43 Evaluating Local Explanation Methods on Ground Truth
#J44 A reconstruction of multipreference closure
#J45 Induction and Exploitation of Subgoal Automata for Reinforcement Learning
#J46 Confident Learning: Estimating Uncertainty in Dataset Labels
#J47 Dashed Strings for String Constraint Solving
#J48 Hybrid-Order Network Consensus for Distributed Multi-agent Systems
#J49 Definability for Model Counting
#J50 Designing Normative Theories for Ethical and Legal Reasoning: LogiKEy Framework, Methodology, and Tool Support
#J51 The Societal Implications of Deep Reinforcement Learning
#J52 A Semantics for Hybrid Probabilistic Logic Programs with Function Symbols
#J53 On the Complexity of Reasoning about Opinion Diffusion under Majority Dynamics
#J54 Real-time reasoning in OWL2 for GDPR compliance
#J55 Lilotane: A Lifted SAT-based Approach to Hierarchical Planning
#J56 Reviewing Autoencoders for Missing Data Imputation: Technical Trends, Applications and Outcomes
#J57 Using Ontologies to Enhance Human Understandability of Global Post-hoc Explanations of Black-box Models
#J58 The AI Liability Puzzle and a Fund-Based Work-Around
#J59 AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms
#J60 Regarding Goal Bounding and Jump Point Search
#J61 Adapting Behavior via Intrinsic Reward: A Survey and Empirical Study
#J62 On the Evolvability of Monotone Conjunctions with an Evolutionary Mutation Mechanism
#J63 Weakly-Supervised Sensor-based Activity Segmentation and Recognition via Learning from Distributions
#J64 Rethinking Epistemic Logic with Belief Bases
#J66 What Do We Want From Explainable Artificial Intelligence (XAI)? – A Stakeholder Perspective on XAI and a Conceptual Model Guiding Interdisciplinary XAI Research
#J67 Credibility Dynamics: A belief-revision-based trust model with pairwise comparisons
#J68 Autoepistemic Equilibrium Logic and Epistemic Specifications
#J69 On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
#J70 On pruning search trees of impartial games
#J71 Zone pAth Construction (ZAC) based Approaches for Effective Real-Time Ridesharing
#J72 Understanding the Power of Max-SAT Resolution Through UP-Resilience
#J74 Adaptive Stress Testing: Finding Likely Failure Events with Reinforcement Learning
#J75 Learning the Language of Software Errors
#J76 Combining Experts’ Causal Judgments
#J77 How to do Things with Words: A Bayesian Approach
#J78 Towards Knowledgeable Supervised Lifelong Learning Systems
#J79 Verification of Multi-Agent Systems with Public Actions against Strategy Logic
#J80 Metamodeling and metaquerying in OWL 2 QL
#J81 Using Machine Learning for Decreasing State Uncertainty in Planning
#J82 Possible effects of cognitive biases on interpretation of rule-based machine learning models
#J83 Epistemic Graphs for Representing and Reasoning with Positive and Negative Influences of Arguments
#J85 Computational Complexity of Computing Symmetries in Finite-Domain Planning
#J86 Regret Bounds for Reinforcement Learning via Markov Chain Concentration
#J87 Benchmark and Survey of Automated Machine Learning Frameworks
#J88 A Survey on the Explainability of Supervised Machine Learning
#J91 Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification
#J92 On the Equivalence of Optimal Recommendation Sets and Myopically Optimal Query Sets
#J93 So, what exactly is a qualitative calculus?
#J94 The Force Awakens: Artificial Intelligence for Consumer Law
#J96 Structure from Randomness in Halfspace Learning with the Zero-One Loss
#J97 GLocalX – From Local to Global Explanations of Black Box AI Models
#J98 Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers
#J99 Properties and Interrelationships of Skeptical, Weakly Skeptical, and Credulous Inference Induced by Classes of Minimal Models
#J100 Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search
#J101 Automated Temporal Equilibrium Analysis: Verification and Synthesis of Multi-Player Games
#J102 Qualitative Numerical Planning: Reductions and Complexity