Solving the entailment problem in the fluent calculus using binary decision diagrams

DOI10.1007/3-540-44957-4_50MaRDI QIDQ2767101zbMATH OpenFDO

Authors Steffen Hölldobler, Hans-Peter Störr

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44957-4_50

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Decidability results for the propositional fluent calculus
• Fast planning through planning graph analysis
• The boundary between decidable and undecidable fragments of the fluent calculus
• Solving planning problems by partial deduction
• scientific article; zbMATH DE number 1748581

Cited in

(5)

• The boundary between decidable and undecidable fragments of the fluent calculus
• Solving planning problems by partial deduction
• Decidability results for the propositional fluent calculus
• Existential Label Flow Inference Via CFL Reachability
• scientific article; zbMATH DE number 1748581 (Why is no real title available?)

Describes a project that uses

Uses Software

• Smodels
• Graphplan

This page was built for publication: Solving the entailment problem in the fluent calculus using binary decision diagrams

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