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

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

zbMATH Keywords

modocpanning problem

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• A deductive solution for plan generation
• Knowledge-based proof planning
• On the nature and role of modal truth criteria in planning
• Generating plans from proofs. The interpolation-based approach to query reformulation
• Complexity analysis of propositional resolution with autarky pruning
• Title not available (Why is that?)

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)