Artificial Intelligence, Automated Reasoning, and Symbolic Computation

Many problems may be viewed as constraint satisfaction problems. Application domains range from construction scheduling to bioinformatics. Constraint satisfaction problems involve finding values for problem variables subject to restrictions on which combinations of values are allowed. For example, in scheduling professors to teach classes, we cannot schedule the same professor to teach two different classes at the same time. There are many powerful methods for solving constraint satisfaction problems (though in general, of course, they are NP-hard). However, before we can solve a problem, we must describe it, and we want to do so in an appropriate form for efficient processing. The Cork Constraint Computation Centre is applying artificial intelligence techniques to assist or automate this modelling process. In doing so, we address a classic dilemma, common to most any problem solving methodology. The problem domain experts may not be expert in the problem solving methodology and the experts in the problem solving methodology may not be domain experts. The author is supported by a Principal Investigator Award from Science Foundation Ireland. J. Calmet et al. (Eds.): AISC-Calculemus 2002, LNAI 2385, p. 1, 2002. c © Springer-Verlag Berlin Heidelberg 2002 Expressiveness and Complexity of Full First-Order Constraints in the Algebra of Trees

[1]  Vladimir Tarasov Applying intelligent agent technology to create instruction programs , 1998 .

[2]  Volker Sorge,et al.  Critical Agents Supporting Interactive Theorem Proving , 1999, EPIA.

[3]  B. Peirce A short table of integrals , 1898 .

[4]  Stefan Ratschan,et al.  Uncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving , 2000, J. Univers. Comput. Sci..

[5]  Boi Faltings,et al.  Consistency techniques for continuous constraints , 1996, Constraints.

[6]  Sergey P. Shary,et al.  Outer Estimation of Generalized Solution Sets to Interval Linear Systems , 1999, Reliab. Comput..

[7]  Anand S. Rao,et al.  Modeling Rational Agents within a BDI-Architecture , 1997, KR.

[8]  Stefan Ratschan,et al.  Quantified Constraints Under Perturbation , 2002, J. Symb. Comput..

[9]  Stefan Ratschan,et al.  Approximate Quantified Constraint Solving by Cylindrical Box Decomposition , 2002, Reliab. Comput..

[10]  Simon Colton,et al.  A Multi-agent Approach to Modelling Interaction in Human Mathematical Reasoning , 2001 .

[11]  James H. Davenport,et al.  Computer Algebra: Systems and Algorithms for Algebraic Computation , 1988 .

[12]  Claude Moulin,et al.  Adaption of a system to the Student's Behaviour , 1997 .

[13]  Stefan Ratschan Applications of Real First-Order Constraint Solving Bibliography , 2001 .

[14]  Daniel Richardson,et al.  Some undecidable problems involving elementary functions of a real variable , 1969, Journal of Symbolic Logic.

[15]  Penny Nii The blackboard model of problem solving , 1986 .

[16]  Manuel Bronstein,et al.  Symbolic integration I: transcendental functions , 1997 .

[17]  Sarit Kraus,et al.  Strategic Negotiation in Multiagent Environments , 2001, Intelligent robots and autonomous agents.

[18]  Lou van den Dries,et al.  Alfred Tarski's Elimination Theory for Real Closed Fields , 1988, J. Symb. Log..

[19]  G. Sacks A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[20]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .