SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
type: Item
instance of: scholarly article
title: SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
zbMATH Open document ID: 1082.68799
DOI: 10.1016/S0004-3702(02)00375-2
author: Claudio Castellini
author: Enrico Giunchiglia
author: Armando Tacchella
published in: Artificial Intelligence
publication date: 2006-02-07T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5003885
zbMATH Keywords: SAT-based planning
zbMATH Keywords: Planning under uncertainty
zbMATH Keywords: Concurrency
zbMATH Keywords: Satisfiability
describes a project that uses: c-sat
describes a project that uses: STAN
describes a project that uses: SATO
describes a project that uses: Graphplan
MaRDI profile type: Publication
Wikidata QID: Q62652857
cites work: Conformant planning via symbolic model checking and heuristic search
cites work: Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
cites work: Q4527271
cites work: Q4551177
cites work: A machine program for theorem-proving
cites work: Q2723426
cites work: Representing action: indeterminacy and ramifications
cites work: SAT-based decision procedures for classical modal logics
cites work: Q4539619
cites work: Q4954178
cites work: Frames in the space of situations
cites work: On the logic of causal explanation
cites work: State Constraints Revisited
cites work: Q4242054
cites work: Q3856120
cites work: A structure-preserving clause form translation
cites work: Q4252522
cites work: Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
cites work: Q2754108
cites work: SATO: An efficient propositional prover
description: scientific article; zbMATH DE number 5003885