Pages that link to "Item:Q814472"
From MaRDI portal
The following pages link to SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472):
Displaying 32 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints (Q414857) (← links)
- Approximation of action theories and its application to conformant planning (Q543583) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- The SAT-based approach to separation logic (Q862390) (← links)
- APPSSAT: Approximate probabilistic planning using stochastic satisfiability (Q997058) (← links)
- A self-adaptive multi-engine solver for quantified Boolean formulas (Q1020496) (← links)
- Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- Understanding planning with incomplete information and sensing (Q2457676) (← links)
- Towards an efficient library for SAT: A manifesto (Q2741533) (← links)
- ITSAT: An Efficient SAT-Based Temporal Planner (Q2941742) (← links)
- Abstraction-Based Algorithm for 2QBF (Q3007686) (← links)
- Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework (Q3011967) (← links)
- Cost-constrained planning for concurrency satisfaction (Q3124689) (← links)
- Planning as satisfiability with IPC simple preferences and action costs (Q3164979) (← links)
- Complexity of Planning in Action Formalisms Based on Description Logics (Q3498484) (← links)
- Probabilistic Reasoning by SAT Solvers (Q3638188) (← links)
- Relaxing non-interference requirements in parallel plans (Q5018767) (← links)
- Planning with Incomplete Information in Quantified Answer Set Programming (Q5019607) (← links)
- Modelling Multi-Agent Epistemic Planning in ASP (Q5140002) (← links)
- Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings (Q5190260) (← links)
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming (Q5297630) (← links)
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning (Q5310682) (← links)
- Logics in Artificial Intelligence (Q5394133) (← links)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty (Q5473711) (← links)
- Mechanizing Mathematical Reasoning (Q5717457) (← links)
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (Q5958636) (← links)