Improvements to SAT-Based Conformant Planning
暂无分享,去创建一个
[1] Drew McDermott,et al. A critique of pure reason 1 , 1987, The Philosophy of Artificial Intelligence.
[2] Patrick Prosser,et al. HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..
[3] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.
[4] Hudson Turner,et al. Satisfiability planning with Causal Theories , 1998, KR.
[5] Armando Tacchella,et al. Benefits of Bounded Model Checking at an Industrial Setting , 2001, CAV.
[6] David E. Smith,et al. Conformant Graphplan , 1998, AAAI/IAAI.
[7] Marco Roveri,et al. Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..
[8] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[9] Jussi Rintanen,et al. Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..
[10] Armando Tacchella,et al. Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability , 2001, IJCAR.
[11] Blai Bonet,et al. Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.
[12] Armando Tacchella,et al. SAT-based planning in complex domains: Concurrency, constraints and nondeterminism , 2003, Artif. Intell..
[13] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[14] Patrik Haslum,et al. Admissible Heuristics for Optimal Planning , 2000, AIPS.
[15] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[16] Tomás E. Uribe,et al. Ordered Binary Decision Diagrams and the Davis-Putnam Procedure , 1994, CCL.
[17] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[18] Enrico Giunchiglia,et al. Planning as Satisfiability in Nondeterministic Domains , 2000, AAAI/IAAI.
[19] Enrico Giunchiglia,et al. An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.
[20] Enrico Giunchiglia,et al. Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism , 2000, KR.
[21] Marco Roveri,et al. Recent Advances in AI Planning , 1999, Lecture Notes in Computer Science.
[22] Marco Pistore,et al. NuSMV Version 2: BDD-based + SAT-based Symbolic Model Checking , 2001 .
[23] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[24] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.