Formalizing Goal Serializability for Evaluation of Planning Features

DOI10.1007/978-3-319-48758-8_33zbMATH Open1483.68368OpenAlexW2545645150MaRDI QIDQ2835895FDOQ2835895

Authors: Reza Basseda, Michael Kifer 

Publication date: 30 November 2016

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48758-8_33

Recommendations

• Publication:4488091
• scientific article; zbMATH DE number 1759374
• Width and serialization of classical planning problems

zbMATH Keywords

deductive planningSTRIPS planningtransaction logic

Mathematics Subject Classification ID

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

Cites Work

• STRIPS: A new approach to the application of theorem proving to problem solving
• An overview of transaction logic
• Title not available (Why is that?)
• Planning with regression analysis in transaction logic
• On Linear Logic Planning and Concurrency

Cited In (1)

• Planning with regression analysis in transaction logic

This page was built for publication: Formalizing Goal Serializability for Evaluation of Planning Features

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