ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2006.01011
  4. Cited By
Computing Plan-Length Bounds Using Lengths of Longest Paths
v1v2 (latest)

Computing Plan-Length Bounds Using Lengths of Longest Paths

Symposium on Combinatorial Search (SoCS), 2020
1 June 2020
Mohammad Abdulaziz
Dominik Berger
ArXiv (abs)PDFHTML

Papers citing "Computing Plan-Length Bounds Using Lengths of Longest Paths"

2 / 2 papers shown
Actions You Can Handle: Dependent Types for AI Plans
Actions You Can Handle: Dependent Types for AI Plans
Alasdair Hill
Ekaterina Komendantskaya
M. Daggitt
Ronald P. A. Petrick
94
0
0
24 May 2021
Cost Optimal Planning as Satisfiability
Cost Optimal Planning as Satisfiability
Mohammad Abdulaziz
106
2
0
03 Mar 2021
1
Page 1 of 1