Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph

From MaRDI portal
Publication:2871457
Jump to:navigation, search

DOI10.1613/jair.4145zbMath1361.68196OpenAlexW2115926667MaRDI QIDQ2871457

Anton Nazarenko, Carmel Domshlak

Publication date: 8 January 2014

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4145



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)


Related Items (2)

A framework for analysing state-abstraction methods ⋮ Red-black planning: a new systematic approach to partial delete relaxation







This page was built for publication: The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2871457&oldid=15812001"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki