JAIR

869 papers1,338 directions
The Journal of Artificial Intelligence Research (JAIR) is a venue covering a broad spectrum of artificial intelligence and machine learning research. Active since 2003, the journal publishes work that spans theoretical foundations and practical applications. Its scope includes multi-agent interactions, reinforcement learning, and the integration of symbolic logic with neural architectures. Research published in JAIR frequently addresses complex decision-making and strategic depth. Key areas of focus include modeling strategic depth in multi-agent systems, security games involving boundedly rational adversaries, and deceptive rationalization in large reasoning models. The venue also features work on decision-focused learning using differentiable optimization layers and neuro-symbolic architectures designed for sample-efficient learning. Beyond algorithmic development, the journal explores formalisms for quantifying contexts and temporality, as well as procedural and causal fairness in machine learning. Methodological contributions often involve pseudo-likelihood estimation for large graphical models and inconsistency-tolerant reasoning for knowledge bases. Prolific contributors to the venue include researchers such as Jeffrey S. Rosenschein, Joseph M. Barnby, and Alvaro Velasquez, reflecting a community focused on both formal rigor and the evolving challenges of modern AI systems.

Papers by Year

2026 43
2025 63
2024 54
2023 52
2022 75
2021 67
2020 43
2019 31
2018 42
2017 34
2016 37
2015 25
2014 38
2013 24
2012 21
2011 23
2010 18
2009 28
2008 25
2007 20
2006 16
2005 18
2004 16
2003 14
2002 17
2001 6
2000 7
1999 11
1998 4
1997 6
1996 5
1995 11
1994 4
1993 1

Top Research Directions

Research directions most represented by papers from this venue.

Strategyproof Resource Allocation Without Money 12
Managing Combinatorial Explosion in Automated Planning 11
Scaling State Space Search Under Memory Constraints 10
Parameterized Complexity in Computational Social Choice 9
Balancing Logical Expressivity and Computational Tractability 9
Computational Complexity as a Barrier to Election Manipulation 9
The Computational Intractability of Exact Probabilistic Inference 9
Fair Division of Indivisible Resources 8
Sample Efficient Reinforcement Learning 8
Taming the Complexity of Decentralized Multiagent Planning 8
Compressing Belief Spaces for Tractable Partially Observable Planning 8
Point Based Value Iteration for Partially Observable MDPs 7
Balancing Heuristic Accuracy and Computational Cost in Search 7
Scaling Symbolic Reasoning to Large Knowledge Bases 7
Decentralized Coordination Under Partial Observability 7

Top Authors

AuthorPapers
Joseph Halpern18
Moshe Tennenholtz16
Ian Horrocks10
Piotr Faliszewski10
Adnan Darwiche9
Alan Fern9
Bernardo Cuenca Grau9
Frank Hutter9
Milind Tambe9
Mirella Lapata8
Regina Barzilay8
Subbarao Kambhampati8
Carsten Lutz7
Joelle Pineau7
Kai Ming Ting7
Matthijs T. J. Spaan7
Michael J. Wooldridge7
Michael P. Wellman7
Thomas Eiter7
William Yeoh7

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Efficient Reinforcement Learning Using Recursive Least-Squares Methods2002
Fusions of Description Logics and Abstract Description Systems2002
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs2002
Inducing Interpretable Voting Classifiers without Trading Accuracy for Simplicity: Theoretical Results, Approximation Algorithms, and Experiments2002
Inferring Strategies for Sentence Ordering in Multidocument News Summarization2002
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap2002
Monitoring Teams by Overhearing: A Multi-Agent Plan-Recognition Approach2002
Policy Recognition in the Abstract Hidden Markov Model2002
SMOTE: Synthetic Minority Over-sampling Technique2002
Specific-to-General Learning for Temporal Events with Application to Learning Event Definitions from Video2002
Specific-to-General Learning for Temporal Events with Application to Learning Event Definitions from Video.2002
The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models2002
Towards Adjustable Autonomy for the Real World2002
When do Numbers Really Matter?2002
Conditional Plausibility Measures and Bayesian Networks2001
Grounding the Lexical Semantics of Verbs in Visual Perception using Force Dynamics and Event Logic2001
Mean Field Methods for a Special Class of Belief Networks2001
Partial-Order Planning with Concurrent Interacting Actions2001
Speeding Up the Convergence of Value Iteration in Partially Observable Markov Decision Processes2001
Technical Paper Recommendation: A Study in Combining Multiple Information Sources2001
Axiomatizing Causal Reasoning2000
Conformant Planning via Symbolic Model Checking2000
Exact Phase Transitions in Random Constraint Satisfaction Problems2000
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains2000
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan2000
Robust Agent Teams via Socially-Attentive Monitoring2000
The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics2000
A Counterexample to Theorems of Cox and Fine1999
Cox's Theorem Revisited (technical addendum)1999
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage1999
Identifying Mislabeled Training Data1999
Issues in Stacked Generalization1999
Learning to Order Things1999
Markov Localization for Mobile Robots in Dynamic Environments1999
Modeling Belief in Dynamic Systems, Part II: Revision and Update1999
Probabilistic Deduction with Conditional Constraints over Basic Events1999
Variational Cumulant Expansions for Intractable Distributions1999
Variational Probabilistic Inference and the QMR-DT Network1999
Incremental Recompilation of Knowledge1998
Model-Based Diagnosis using Structured System Descriptions1998
Synthesizing Customized Planners from Specifications1998
The Computational Complexity of Probabilistic Planning1998
Defining Relative Likelihood in Partially-Ordered Structures1997
Dynamic Non-Bayesian Decision Making1997
Query DAGs: A Practical Paradigm for Implementing Belief-Network Inference1997
SCREEN: Learning a Flat Syntactic and Semantic Spoken Language Analysis Using Artificial Neural Networks1997
Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures1997
Towards Flexible Teamwork1997
Active Learning with Statistical Models1996
A Formal Framework for Speedup Learning from Problems and Solutions1996

« prev Page 17/18 next »