Agenda control for heterogeneous reasoners

Journal of Logic and Algebraic Programming

Volumn 62, Issue 1, 2005, Pages 41-69

  Stolle, Reinhard ^a   Hogan, Apollo ^b   Bradley, Elizabeth ^c  

^a PALO ALTO RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of Colorado at Boulder   (United States)

Author keywords

Automated reasoning; Declarative programming; Logic programming; Meta architectures; Meta control; Meta programming; Reasoning architectures; Reasoning strategies

Indexed keywords

LARGE SCALE SYSTEMS; LOGIC PROGRAMMING; METADATA; ORDINARY DIFFERENTIAL EQUATIONS; PROBLEM SOLVING; SEMANTICS; SPECIFICATIONS;

AUTOMATED REASONING; DECLARATIVE PROGRAMMING; META ARCHITECTURES; META CONTROL; META PROGRAMMING; REASONING ARCHITECTURE; REASONING STRATEGIES;

ARTIFICIAL INTELLIGENCE;

EID: 10044219816     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2003.07.001     Document Type: Article

References (71)

1. F. Bacchus, F. Kabanza, Using temporal logics to express search control knowledge for planning, Artificial Intelligence 116 (January) (2000).
2. A. Barrett, D. Christianson, M. Friedman, C. Kwok, K. Golden, S. Penberthy, Y. Sun, D. Weld, UCPOP user's manual (version 4.0), Technical Report 93-09-06d, Department of Computer Science and Engineering, University of Washington, November 1995.
3. C. Beckstein, M. Kim, Generalized Barley deduction and its correctness, in: T. Christaller (Ed.), GWAI-91: 15th German Workshop on Artificial Intelligence, Informatik-Fachberichte, vol. 285, Springer, Berlin, Heidelberg, 1991, pp. 1-10.
4. C. Beckstein, R. Stolle, G. Tobermann, Meta-programming for generalized Horn clause logic, in: Fifth International Workshop on Metaprogramming and Metareasoning in Logic (META-96), Bonn, Germany, 1996, pp. 27-42. Available from 〈http://www.ksl.stanford.edu/people/stolle/Papers/meta96.(pdf,ps)〉.
5. C. Beckstein, G. Tobermann, Evolutionary logic programming with RISC, in: Fourth International Workshop on Logic Programming Environments, Washington, DC, November 1992, pp. 16-21, Technical Report TR 92-143, Center for Automation and Intelligent Systems Research at Case Western Reserve University.
6. C. Beckstein, G. Tobermann, Algorithmic debugging and hypothetical reasoning. Journal of Automated Software Engineering 4 (1997) 151-178.
7. C. Benzmüller, L. Cheikhrounou, D. Fehrer, A. Fiedler, X. Huang, M. Kerber, M. Kohlhase, K. Konrad, E. Melis, A. Meier, W. Schaarschmidt, J. Siekmann, V. Sorge, ΩMega: Towards a mathematical assistant, in: W. McCune (Ed.), Fourteenth Conference on Automated Deduction (CADE-14), LNAI, Townsville, Australia, Springer, Berlin, Germany, 1997.
8. K.A. Bowen, R.A. Kowalski, Amalgamating language and metalanguage in logic programming, in: K.L. Clark, S.A. Tärnlund (Eds.), Logic Programming, Academic Press, London, 1982, pp. 153-172.
9. E. Bradley, M. Easley, Reasoning about sensor data for automated system identification, Intelligent Data Analysis 2 (2) (1998) 123-138.
10. E. Bradley, M. Easley, R. Stolle, Reasoning about nonlinear system identification, Artificial Intelligence 133 (December) (2001) 139-188.
11. E. Bradley, A. O'Gallagher, J. Rogers, Global solutions for nonlinear systems using qualitative reasoning, Annals of Mathematics and Artificial Intelligence 23 (1998) 211-228.
12. E. Bradley, R. Stolle, Automatic construction of accurate models of physical systems, Annals of Mathematics and Artificial Intelligence 17 (1996) 1-28.
13. B.G. Buchanan, Creativity at the meta-level, AI Magazine 22 (3) (2001), Presidential address at the Seventeenth National Conference on Artificial Intelligence (AAAI-00), Austin, TX.
14. A. Bundy, The use of explicit plans to guide inductive proofs, Technical Report 349, Department of Artificial Intelligence, Edinburgh, 1987; Short version appeared in: R. Lusk, R. Overbeek (Eds.), Ninth Conference on Automated Deduction, Springer, 1988, pp. 111-120.
15. A. Bundy, The use of explicit plans to guide inductive proofs, Technical Report 349, Department of Artificial Intelligence, Edinburgh, 1987; Short version appeared in: R. Lusk, R. Overbeek (Eds.), Ninth Conference on Automated Deduction, Springer, 1988, pp. 111-120.
16. A. Bundy, Proof planning, in: B. Drabble (Ed.), Third International Conference on AI Planning Systems (AIPS-96), 1996, pp. 261-267.
17. J.G. Carbonell, J. Blythe, O. Etzioni, Y. Gil, R. Joseph, D. Kahn, C. Knoblock, S. Minton, A. Pérez, S. Reilly, M. Veloso, X. Wang, PRODIGY 4.0: The manual and tutorial, Technical Report CMU-CS-92-150, School of Computer Science, Carnegie Mellon University, June 1992.
18. C. Castro, P. Borovanský, The use of a strategy language for solving search problems, Annals of Mathematics and Artificial Intelligence 29 (2000) 35-64.
19. B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan, S.M. Watt, Maple V Language Reference Manual, Springer, New York, 1991.
20. M. Cherniack, S. Zdonik, Changing the rules: transformations for rule-based optimizers, in: ACM SIGMOD International Conference on Management of Data, Seattle, WA, June 1998.
21. R. Davis, Meta-rules: reasoning about control, Artificial Intelligence 15 (3) (1980).
22. J. de Kleer, An assumption-based TMS, Artificial Intelligence 28 (1986) 127-162.
23. J. Denzinger, D. Fuchs, Cooperation of heterogeneous provers, in: International Joint Conference on Artificial Intelligence (IJCAI-99), Stockholm, August 1999, pp. 10-15.
24. J. Denzinger, M. Fuchs, M. Fuchs, High performance ATP systems by combining several AI methods, in: Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), Nagoya, Japan, August 1997, pp. 102-107.
25. P. Devanbu, M. Freeland, S.A. Naqvi, A procedural approach to search control in PROLOG, in: European Conference on Artificial Intelligence (ECAI-86), 1986, pp. 53-57.
26. M. Dincbas, J.P. Le Pape, Metacontrol of logic programs in METALOG, in: International Conference on Fifth Generation Computing Systems, 1984, pp. 361-370.
27. J. Barley, An efficient context-free parsing algorithm, Communications of the ACM 13 (2) (1970) 94-102.
28. M. Easley, E. Bradley, Reasoning about input-output modeling of dynamical systems, in: Third International Symposium on Intelligent Data Analysis (IDA-99), Lecture Notes in Computer Science, vol. 1642, Springer, Amsterdam, The Netherlands, 1999, pp. 343-355.
29. J.O. Everett, K.D. Forbus, Scaling up logic-based truth maintenance systems via fact garbage collection, in: Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 614-620.
30. K.D. Forbus, J. de Kleer, Building Problem Solvers, MIT Press, Cambridge, MA, 1993.
31. D.M. Gabbay, M.J. Sergot, Negation as inconsistency I, The Journal of Logic Programming 3 (1) (1986) 1-36.
32. H. Gallaire, C. Lasserre, Controlling knowledge deduction in a declarative approach, in: International Joint Conference on Artificial Intelligence (JJCAI-79), 1979, pp. S1-S6.
33. H. Gallaire, C. Lasserre, Metalevel control for logic programs, in: K.L. Clark, S.A. Tärnlund (Eds.), Logic Programming, Academic Press, London, 1982.
34. M.R. Garey, D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
35. M. Ginsberg, D. Geddis, Is there any need for domain-dependent control information? in: Ninth National Conference on Artificial Intelligence (AAAI-91), 1991. pp. 452-457.
36. B. Gramlich, H. Kirchner, F. Pfenning (Eds.), Annals of Mathematics and Artificial Intelligence, vol. 29, Kluwer Academic Publishers, New York, 2000, Special Issue on Strategies in Automated Deduction.
37. B.N. Grosof, Courteous logic programs: prioritized conflict handling for rules, Technical Report RC 20836, IBM Research, December 1997.
38. C.T. Haynes, Logic continuations, The Journal of Logic Programming 4 (1987) 157-176.
39. P. Hill, J.W. Lloyd, The Gödel Programming Language, MIT Press, Cambridge, MA, 1994.
40. Y.-C. Huang, B. Selman, H. Kautz, Control knowledge in planning: benefits and tradeoffs, in: National Conference on Artificial Intelligence (AAAI-99), Orlando. FL, August 1999.
41. D. Hutter, Annotated reasoning, Annals of Mathematics and Artificial Intelligence 29 (2000) 183-222.
42. F. Lin, Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator, in: Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), Nagoya, Japan, August 1997, pp. 1412-1418.
43. F. Lin, Search algorithms in the situation calculus, in: H.J. Levesque, F. Pirn (Eds.), Logical Foundation for Cognitive Agents: Contributions in Honor of Ray Reiter, Springer, Berlin, 1999, pp. 213-233.
44. L. Ljung (Ed.), System Identification; Theory for the User, Prentice-Hall, Englewood Cliffs, NJ, 1987.
45. J.W. Lloyd, Foundations of Logic Programming, second extended ed., Springer, Berlin, 1987.
46. L.T. McCarty, Clausal intuitionistic logic I. Fixed-point semantics, The Journal of Logic Programming 5 (1988) 1-31.
47. L.T. McCarty, Clausal intuitionistic logic II. Tableau proof procedures, The Journal of Logic Programming 5 (1988) 93-132.
48. E. Melis, A. Meier, Proof planning with multiple strategies, in: J. Loyd, V. Dahl, U. Furbach, M. Kerber, K. Lau, C. Palamidessi, L. Pereira, Y.S.P. Stuckey (Eds.), First International Conference on Computational Logic (CL-2000), LNAI, vol. 1861, Springer, London, UK, 2000, pp. 644-659.
49. E. Melis, J. Siekmann, Knowledge-based proof planning, Artificial Intelligence 115 (1999) 65-105.
50. E. Mendelson, Introduction to Mathematical Logic, Van Nostrand, Princeton, NJ, 1964.
51. S. Minton, Quantitative results concerning the utility of explanation-based learning, Artificial Intelligence 42 (1990) 363-391.
52. S. Minton, Is there any need for domain-dependent control information? A reply, in: Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 855-862.
53. P.J. Mosterman, G. Biswas, Formal specifications for hybrid dynamical systems, in: Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), Nagoya, Japan, August 1997, pp. 568-573.
54. L. Naish, in: Negation and Control in PROLOG, Lecture Notes in Computer Sciences, vol. 238, Springer, Berlin, 1985.
55. S. Pradhan, J. Minker, V.S. Subrahmanian, Combining databases with prioritized information, Journal of Intelligent Information Systems 4 (3) (1995) 231-260.
56. D.E. Smith, M.R. Genesereth, Ordering conjunctive queries. Artificial Intelligence 26 (2) (1985) 171-215.
57. T.C. Son, C. Baral, S. McIlraith, Planning with different forms of domain-dependent control knowledge - an answer set programming approach, in: T. Eiter, W. Faber, M. Truszczyriski (Eds.), Sixth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-01), Vienna, Austria, LNAI, vol. 2173, Springer, Berlin, Heidelberg, 2001, pp. 226-239.
58. M. Stefik, Planning and meta-planning MOLGEN: Part 2, Artificial Intelligence 16 (2) (1981) 141-170.
59. L. Sterling, E. Shapiro, The Art of PROLOG, MIT Press, Cambridge, MA, 1986.
60. R. Stolle, in: Orchestrating Reasoning for Automated System Identification, Lecture Notes in Computer Science, Springer, Heidelberg, in press, Revised version of Ph.D. thesis, University of Colorado at Boulder, 1998.
61. R. Stolle, E. Bradley, A customized logic paradigm for reasoning about models, in: Y. Iwasaki, A. Farquhar (Eds.), Tenth International Workshop on Qualitative Reasoning (QR-96), Stanford Sierra Camp, CA, 1996, pp. 235-244, AAAI Technical Report WS-96-01.
62. R. Stolle, E. Bradley, Multimodal reasoning for automatic model construction, in: Fifteenth National Conference on Artificial Intelligence (AAAI-98), Madison, WI, July 1998, pp. 181-188.
63. V.S. Subrahmanian, A simple formulation of the theory of metalogic programming, Technical Report LPRG-TR-88-32, Syracuse University, 1988.
64. G. Tobermann, Verallgemeinerte Hornklausellogik: vom logischen Kalkül zum Logik-Programmiersystem, Ph.D. thesis, Universität Erlangen-Nürnberg, 1994.
65. J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. I, Computer Science Press, Rockville, MD, 1988.
66. P. van der Laag, in: An Analysis of Refinement Operators in Inductive Logic Programming, Tinbergen Institute Research Series, vol. 102, Thesis Publishers, Amsterdam, 1995.
67. F. van Harmelen, Meta-level Inference Systems, Morgan Kaufmann, 1991.
68. D. Waltz, The importance of importance, AI Magazine 20 (3) (1999), Presidential address at the Sixteenth National Conference on Artificial Intelligence (AAAI-99), Orlando, FL.
69. D.H.D. Warren, Efficient processing of interactive relational database queries expressed in logic, in: Seventh International Conference on Very Large Data Bases, Cannes, France, 1981.
70. L.U. Yalcinalp, Meta-Programming for Knowledge Based Systems in PROLOG, Ph.D. thesis, Case Western Reserve University, 1991, Technical Report TR 91-141.
71. K. Yip, F. Zhao, Spatial aggregation: theory and applications. Journal of Artificial Intelligence Research 5 (1996) 1-26.