Demo Data from SIGIR 2026 / reviewers in the wild / expert
Saurabh Fadnis
dblp:332/2369
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2024
0000-0001-9307-281XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Planning, search and constraint satisfaction · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
classical planning |
0.8 | 1 | 2024 | Termination Properties of Transition Rules for Indirect Effects · ICAPS 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
indirect effects |
0.8 | 1 | 2024 | Termination Properties of Transition Rules for Indirect Effects · ICAPS 2024 |
Computational complexity › complexity classes › PSPACE
PSPACE-completeness |
0.8 | 1 | 2024 | Termination Properties of Transition Rules for Indirect Effects · ICAPS 2024 |
Methods — techniques the papers use, named apart from their topics
termination analysis · 1.5confluence analysis · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Termination Properties of Transition Rules for Indirect EffectsabstractIndirect effects of agent's actions have traditionally been formalized as condition-effect rules that always fire whenever applicable, after each action taken by the agent. In this work, we investigate a core problem of indirect effects, the possibility of arbitrarily or infinitely long sequences of rule firings. Specifically we investigate the termination of rule firings, as well as their confluence, that is, the uniqueness of the state that is ultimately reached. Both problems turn out to be PSPACE-complete. After this, we devise practically interesting syntactic and structural restrictions that guarantee polynomial-time termination and confluence tests. Finally, in the context of planning languages that support indirect effects, we propose new implementation technologies. Mojtaba Elahi, Saurabh Fadnis, Jussi Rintanen |
ICAPS | 2 |
| 2023 | Planning with Partial Observability by SAT
Saurabh Fadnis, Jussi Rintanen |
JELIA | 1 |
| 2022 | Generalized 3-Valued Belief States in Conformant Planning
Saurabh Fadnis, Jussi Rintanen |
PRICAI (1) | 1 |