SAT-based planning in complex domains: Concurrency, constraints and nondeterminism

DOI10.1016/S0004-3702(02)00375-2zbMath1082.68799WikidataQ62652857 ScholiaQ62652857MaRDI QIDQ814472

Enrico Giunchiglia, Claudio Castellini, Armando Tacchella

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

SatisfiabilityConcurrencyPlanning under uncertaintySAT-based planning

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) 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)

Related Items (17)

Task decomposition on abstract states, for planning under nondeterminism ⋮ Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming ⋮ The SAT-based approach to separation logic ⋮ Unnamed Item ⋮ Complexity of Planning in Action Formalisms Based on Description Logics ⋮ An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints ⋮ Modelling Multi-Agent Epistemic Planning in ASP ⋮ Strong planning under partial observability ⋮ Understanding planning with incomplete information and sensing ⋮ Abstraction-Based Algorithm for 2QBF ⋮ Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework ⋮ Approximation of action theories and its application to conformant planning ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ A self-adaptive multi-engine solver for quantified Boolean formulas ⋮ Probabilistic Reasoning by SAT Solvers ⋮ Planning with Incomplete Information in Quantified Answer Set Programming ⋮ Conformant planning via symbolic model checking and heuristic search

Uses Software

• c-sat
• STAN
• SATO
• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conformant planning via symbolic model checking and heuristic search
• A structure-preserving clause form translation
• On the logic of causal explanation
• Frames in the space of situations
• Representing action: indeterminacy and ramifications
• SAT-based decision procedures for classical modal logics
• Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
• Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
• State Constraints Revisited
• SATO: An efficient propositional prover
• A machine program for theorem-proving

This page was built for publication: SAT-based planning in complex domains: Concurrency, constraints and nondeterminism