Encoding Conformant Planning in A-Prolog
暂无分享,去创建一个
[1] Michael Gelfond,et al. Representing Action and Change by Logic Programs , 1993, J. Log. Program..
[2] Hudson Turner,et al. Causal Theories of Action and Change , 1997, AAAI/IAAI.
[3] Vladik Kreinovich,et al. Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.
[4] Victor W. Marek,et al. The Logic Programming Paradigm: A 25-Year Perspective , 2011 .
[5] Chitta Baral,et al. Reasoning agents in dynamic domains , 2000 .
[6] Piergiorgio Bertoli,et al. Heuristic Search + Symbolic Model Checking = Efficient Conformant Planning , 2001, IJCAI.
[7] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..
[8] Georg Gottlob,et al. The DLV System , 2002, JELIA.
[9] A. Polleres,et al. A logic programming approach to knowledge-state planning, II: The DLVK system , 2001, Artif. Intell..
[10] Armando Tacchella,et al. SAT-based planning in complex domains: Concurrency, constraints and nondeterminism , 2003, Artif. Intell..
[11] Chitta Baral,et al. Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .
[12] Yuliya Lierler,et al. Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs , 2004, LPNMR.
[13] Tran Cao Son,et al. Planning with Sensing Actions and Incomplete Information Using Logic Programming , 2004, LPNMR.
[14] Dov M. Gabbay,et al. Handbook of Temporal Reasoning in Artificial Intelligence , 2005, Handbook of Temporal Reasoning in Artificial Intelligence.
[15] Michael Gelfond,et al. Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.