Learning action models from plan examples using weighted MAX-SAT
From MaRDI portal
Recommendations
- Learning partially observable non-deterministic action models
- Learning action models with minimal observability
- A constraint-based approach to learn temporal features on action models from multiple plans
- Action-model acquisition for planning via transfer learning
- Learning probabilistic action models from interpretation transitions
Cites work
- A Computing Procedure for Quantification Theory
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1114005 (Why is no real title available?)
- scientific article; zbMATH DE number 2038893 (Why is no real title available?)
- scientific article; zbMATH DE number 2038904 (Why is no real title available?)
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Markov logic networks
- SATO: An efficient propositional prover
- Solving propositional satisfiability problems
- STRIPS: A new approach to the application of theorem proving to problem solving
- Unifying logical and statistical AI
Cited in
(21)- A constraint-based approach to learn temporal features on action models from multiple plans
- Learning action models with minimal observability
- Model-lite planning: case-based vs. model-based approaches
- Action-model acquisition for planning via transfer learning
- Learning hierarchical task network domains from partially observed plan traces
- Learning partially observable non-deterministic action models
- Analysis and solving SAT and MAX-SAT problems using an L-partition approach
- Cost-sensitive action model learning
- Learning probabilistic action models from interpretation transitions
- Action knowledge acquisition with opmaker2
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- A Comprehensive Framework for Learning Declarative Action Models
- Using machine learning for decreasing state uncertainty in planning
- Robust planning with incomplete domain models
- DeepSym: Deep Symbol Generation and Rule Learning for Planning from Unsupervised Robot Interaction
- Using inductive rule learning techniques to learn planning domains
- A domain-independent agent architecture for adaptive operation in evolving open worlds
- Learning to act and observe in partially observable domains
- Lifted action models learning from partial traces
- Safe learning of multi-agent action models from concurrent joint action observations
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
This page was built for publication: Learning action models from plan examples using weighted MAX-SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028900)
