A propositional theorem prover to solve planning and other problems

DOI10.1023/A:1018998610179zbMATH Open0940.68117OpenAlexW1537720255MaRDI QIDQ1978018FDOQ1978018

Authors Fumiaki Okushi, Allen Van Gelder

Publication date 7 June 2000

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018998610179

zbMATH Keywords

modocpanning problem

Mathematics Subject Classification ID

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

Recommendations

• Complexity analysis of propositional resolution with autarky pruning
• scientific article; zbMATH DE number 1305704
• Parallel cooperative propositional theorem proving
• Autarky pruning in propositional model elimination reduces failure redundancy
• Lemma and cut strategies for propositional model elimination

Cited in

(7)

• A deductive solution for plan generation
• scientific article; zbMATH DE number 4047180 (Why is no real title available?)
• Generating plans from proofs. The interpolation-based approach to query reformulation
• scientific article; zbMATH DE number 1305704 (Why is no real title available?)
• Complexity analysis of propositional resolution with autarky pruning
• On the nature and role of modal truth criteria in planning
• Knowledge-based proof planning

Describes a project that uses

Uses Software

• Walksat
• SATO

This page was built for publication: A propositional theorem prover to solve planning and other problems

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