Constraint Solving for Proof Planning
暂无分享,去创建一个
[1] Volker Sorge,et al. Proof Development with OMEGA , 2002, CADE.
[2] G. Gentzen. Untersuchungen über das logische Schließen. II , 1935 .
[3] Robert S. Boyer,et al. Computer Proofs of Limit Theorems , 1971, IJCAI.
[4] Uri Leron. Heuristic Presentations: The Role of Structuring. , 1985 .
[5] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[6] Michael Beeson,et al. Automatic Generation of Epsilon-Delta Proofs of Continuity , 1998, AISC.
[7] Erica Melis,et al. Proof planning with multiple strategies , 2000, Artif. Intell..
[8] Subbarao Kambhampati,et al. Refinement Planning: Status and Prospectus , 1996, AAAI/IAAI, Vol. 2.
[9] Erica Melis. The "Limit" Domain , 1998, AIPS.
[10] Fausto Giunchiglia,et al. A Theory of Abstraction , 1992, Artif. Intell..
[11] Dieter Hutter,et al. Equational proof-planning by dynamic abstraction , 1997 .
[12] Christian Schulte,et al. Programming Constraint Services , 2002, Lecture Notes in Computer Science.
[13] Mark E. Stickel,et al. Automated deduction by theory resolution , 1985, Journal of Automated Reasoning.
[14] Alan Bundy,et al. The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.
[15] Hector Geffner,et al. Heuristic Planning with Time and Resources , 2014 .
[16] Rina Dechter,et al. Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.
[17] Christophe Ringeissen,et al. SoleX: A Domain-Independent Scheme for Constraint Solver Extension , 1998, AISC.
[18] W. W. Bledsoe,et al. Challenge problems in elementary calculus , 1990, Journal of Automated Reasoning.
[19] Tobias Nipkow,et al. Term rewriting and all that , 1998 .
[20] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[21] Joxan Jaffar,et al. Constraint logic programming , 1987, POPL '87.
[22] Volker Sorge,et al. Comparing Approaches to the Exploration of the Domain of Residue Classes , 2002, J. Symb. Comput..
[23] Stephen F. Smith,et al. Integrating Planning and Scheduling through Adaptation of Resource Intensity Estimates , 2001 .
[24] William McCune. Otter 2.0 , 1990, CADE.
[25] Michael Kohlhase,et al. System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning , 2002, CADE.
[26] Daniel S. Weld,et al. Combining linear programming and satisfiability solving for resource planning , 2001, The Knowledge Engineering Review.
[27] Volker Sorge. Non-Trivial Symbolic Computations in Proof Planning , 2000, FroCoS.
[28] Michael Beeson,et al. Logic and Computation in MATHPERT: An Expert System for Learning Mathematics , 1989, Computers and Mathematics.
[29] Malik Ghallab,et al. Representation and Control in IxTeT, a Temporal Planner , 1994, AIPS.
[30] W. Böge,et al. Quantifier Elimination for Real Closed Fields , 1985, AAECC.
[31] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[32] Erica Melis,et al. Knowledge-Based Proof Planning , 1999, Artif. Intell..
[33] Gert Smolka,et al. The Oz Programming Model , 1996, Computer Science Today.
[34] Nicola Muscettola,et al. HSTS: Integrating Planning and Scheduling , 1993 .
[35] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[36] E. Melis. Island Planning and Refinement , 1996 .
[37] George E. Collins,et al. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.
[38] G. Gentzen. Untersuchungen über das logische Schließen. I , 1935 .
[39] Nicola Muscettola,et al. Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.
[40] Robert Gardner,et al. Introduction To Real Analysis , 1994 .
[41] Austin Tate,et al. Representing Plans as a Set of Constraints - the Model , 1996, AIPS.
[42] Tobias Müller. Promoting Constraints to First-Class Status , 2000, Computational Logic.
[43] Peter Baumgartner,et al. Constraint Model Elimination and a PTTP-Implementation , 1995, TABLEAUX.
[44] Philippe Laborie,et al. Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..
[45] Geoff Sutcliffe,et al. The TPTP Problem Library , 1994, Journal of Automated Reasoning.
[46] Erica Melis,et al. AI-Techniques in Proof Planning , 1998, ECAI.
[47] Hans-Jürgen Bürckert,et al. A Resolution Principle for Constrained Logics , 1994, Artif. Intell..
[48] Daniel S. Weld,et al. Temporal Planning with Continuous Change , 1994, AAAI.
[49] Toby Walsh,et al. Coloured Rippling: An Extension of a Theorem Proving Heuristic , 1994, ECAI.
[50] Henry A. Kautz,et al. State-space Planning by Integer Optimization , 1999, AAAI/IAAI.
[51] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[52] Frank van Harmelen,et al. Rippling: A Heuristic for Guiding Inductive Proofs , 1993, Artif. Intell..
[53] Stephen Wolfram,et al. The Mathematica Book , 1996 .