Learning action models from plan examples using weighted MAX-SAT
From MaRDI portal
Publication:1028900
DOI10.1016/j.artint.2006.11.005zbMath1168.68555OpenAlexW2024113144WikidataQ59678813 ScholiaQ59678813MaRDI QIDQ1028900
Qiang Yang, Yunfei Jiang, Kangheng Wu
Publication date: 9 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2006.11.005
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A constraint-based approach to learn temporal features on action models from multiple plans ⋮ Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach ⋮ Model-lite planning: case-based vs. model-based approaches ⋮ A Comprehensive Framework for Learning Declarative Action Models ⋮ Using Machine Learning for Decreasing State Uncertainty in Planning ⋮ Action-model acquisition for planning via transfer learning ⋮ Learning hierarchical task network domains from partially observed plan traces ⋮ Robust planning with incomplete domain models ⋮ Learning action models with minimal observability ⋮ Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
Uses Software
Cites Work
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Solving propositional satisfiability problems
- Markov logic networks
- STRIPS: A new approach to the application of theorem proving to problem solving
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Unifying Logical and Statistical AI
- SATO: An efficient propositional prover
- A Computing Procedure for Quantification Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
