236 search results - page 33 / 48 » Learning Teleoreactive Logic Programs from Problem Solving |
CADE
2002
Springer
14 years 7 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
PLDI
2004
ACM
14 years 24 days ago
2004
ACM
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
IFIP
1994
Springer
13 years 11 months ago
1994
Springer
The concept of information landscapes has been a constant theme in the development of interactive multimedia packages. For the interface and access to this information to be effec...
PKDD
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Problem solving with experiences that are recorded in text form requires a mapping from text to structured cases, so that case comparison can provide informed feedback fo...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
This paper describes a system combining model-based and learning-based methods for automated reasoning in large theories, i.e. on a large number of problems that use many axioms, l...