SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62652857, #quickstatements; #temporary_batch_1710897659913
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Conformant planning via symbolic model checking and heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis on the <i>p</i>-adic superspace. I. Generalized functions: Gaussian distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing action: indeterminacy and ramifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based decision procedures for classical modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frames in the space of situations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the logic of causal explanation / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Constraints Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SATO: An efficient propositional prover / rank
 
Normal rank

Latest revision as of 11:00, 24 June 2024

scientific article
Language Label Description Also known as
English
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
scientific article

    Statements

    SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (English)
    0 references
    0 references
    0 references
    0 references
    7 February 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    SAT-based planning
    0 references
    Planning under uncertainty
    0 references
    Concurrency
    0 references
    Satisfiability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references