Planning as satisfiability: heuristics (Q359984): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as satisfiability: parallel plans and algorithms for plan search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental results on the crossover point in random 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: AI 2007: Advances in artificial intelligence. 20th Australian joint conference on artificial intelligence, Gold Coast, Australia, December 2--6, 2007. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods in Computer-Aided Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as propositional CSP: From Walksat to local search techniques for action graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic analysis of propositional STRIPS planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and pruning: An optimal temporal POCL planner based on constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of restricted branching in clause learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2849590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contingent planning under uncertainty via stochastic satisfiability / rank
 
Normal rank

Latest revision as of 19:41, 6 July 2024

scientific article
Language Label Description Also known as
English
Planning as satisfiability: heuristics
scientific article

    Statements

    Planning as satisfiability: heuristics (English)
    0 references
    0 references
    23 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers