SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
From MaRDI portal
Publication:814472
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Recommendations
Cites work
- A machine program for theorem-proving
- A structure-preserving clause form translation
- Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
- Conformant planning via symbolic model checking and heuristic search
- Frames in the space of situations
- scientific article; zbMATH DE number 1614702 (Why is no real title available?)
- scientific article; zbMATH DE number 1670796 (Why is no real title available?)
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 1285155 (Why is no real title available?)
- scientific article; zbMATH DE number 1305704 (Why is no real title available?)
- scientific article; zbMATH DE number 1560498 (Why is no real title available?)
- scientific article; zbMATH DE number 1765679 (Why is no real title available?)
- scientific article; zbMATH DE number 1796153 (Why is no real title available?)
- scientific article; zbMATH DE number 1448981 (Why is no real title available?)
- On the logic of causal explanation
- Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae
- Representing action: indeterminacy and ramifications
- SAT-based decision procedures for classical modal logics
- SATO: An efficient propositional prover
- State Constraints Revisited
Cited in
(38)- A self-adaptive multi-engine solver for quantified Boolean formulas
- Set-structured and cost-sharing heuristics for classical planning
- Planning as satisfiability: parallel plans and algorithms for plan search
- Strong planning under partial observability
- Processes and continuous change in a SAT-based planner
- Understanding planning with incomplete information and sensing
- Towards an efficient library for SAT: A manifesto
- Using satisfiability for non-optimal temporal planning
- ITSAT: An Efficient SAT-Based Temporal Planner
- Abstraction-based algorithm for 2QBF
- Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
- Cost-constrained planning for concurrency satisfaction
- Planning as satisfiability with IPC simple preferences and action costs
- Modification strategies for SAT-based plan adaptation
- Complexity of Planning in Action Formalisms Based on Description Logics
- Solving sequential planning problems via constraint satisfaction
- Planning as satisfiability: heuristics
- Probabilistic Reasoning by SAT Solvers
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
- scientific article; zbMATH DE number 1954197 (Why is no real title available?)
- Relaxing non-interference requirements in parallel plans
- Planning with Incomplete Information in Quantified Answer Set Programming
- Modelling multi-agent epistemic planning in ASP
- Friends or foes? On planning as satisfiability and abstract CNF encodings
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
- Logics in Artificial Intelligence
- Approximation of action theories and its application to conformant planning
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Mechanizing Mathematical Reasoning
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Planning with partial observability by SAT
- Answer set planning: a survey
- Contingent planning under uncertainty via stochastic satisfiability
- Conformant planning via symbolic model checking and heuristic search
- Task decomposition on abstract states, for planning under nondeterminism
- The SAT-based approach to separation logic
- APPSSAT: Approximate probabilistic planning using stochastic satisfiability
This page was built for publication: SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814472)
