Relaxing non-interference requirements in parallel plans

DOI10.1093/JIGPAL/JZZ026MaRDI QIDQ5018767zbMATH OpenOpenAlexWikidataFDO

Authors Miquel Bofill, Joan Espasa, Mateu Villaret

Publication date 22 December 2021

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1093/jigpal/jzz026

zbMATH Keywords

parallel plansplanningplanning as satisfiabilityplanning modulo theoriesSMT

Mathematics Subject Classification ID

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

Recommendations

• Planning as satisfiability: parallel plans and algorithms for plan search
• Logics in Artificial Intelligence
• Planning parallel actions
• scientific article; zbMATH DE number 67473
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism

This page was built for publication: Relaxing non-interference requirements in parallel plans

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