2308 search results - page 15 / 462 » Representing Symbolic Reasoning |
AIR
2005
13 years 7 months ago
2005
A desired capability of automatic problem solvers is that they can explain the results. Such explanations should justify that the solution proposed by the problem solver arises fr...
CONSTRAINTS
1998
13 years 7 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
ENTCS
2006
13 years 7 months ago
2006
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
IJCAI
1997
13 years 8 months ago
1997
In teaching case-based argumentation skills, the CATO program, an intelligent learning environment, guides students' assessments of partial matches between problems and cases...
AAECC
1999
Springer
13 years 7 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...