31 search results - page 6 / 7 » Strategy Parallelism in Automated Theorem Proving |
RTA
1995
Springer
13 years 9 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
CADE
2002
Springer
14 years 6 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
COGSYS
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. Natural language interaction between a student and a tutoring or an assistance system for mathematics is a new multi-disciplinary challenge that requires the interaction ...
TCAD
2010
13 years 15 days ago
2010
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
JSSPP
2005
Springer
13 years 11 months ago
2005
Springer
As grid computing becomes more commonplace, so does the importance of coscheduling these geographically distributed resourcest. Negotiating resource management and scheduling deci...