Property directed reachability for automated planning

DOI10.1613/JAIR.4231zbMATH Open1361.68208OpenAlexW1540013686WikidataQ129493795 ScholiaQ129493795MaRDI QIDQ4979439FDOQ4979439

Authors: Martin Suda 

Publication date: 23 June 2014

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

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

Recommendations

• scientific article; zbMATH DE number 1560491
• Software verification with PDR: an implementation of the state of the art
• Action planning for directed model checking of Petri nets
• Planning as quantified Boolean formula
• scientific article; zbMATH DE number 1560498

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (5)

• Software verification with PDR: an implementation of the state of the art
• Title not available (Why is that?)
• Exploiting adjoints in property directed reachability analysis
• Domain-independent cost-optimal planning in ASP
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning

This page was built for publication: Property directed reachability for automated planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979439)