551 search results - page 21 / 111 » {log}: A Logic Programming Language with Finite Sets |
ROBOCUP
2000
Springer
13 years 11 months ago
2000
Springer
Building agents for a scenario such as the RoboCup simulation league requires not only methodologies for implementing high-level complex behavior, but also the careful and efficien...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
LOGCOM
2010
13 years 2 months ago
2010
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
ASE
2005
13 years 7 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
DAS
2006
Springer
13 years 11 months ago
2006
Springer
Engineering diagnosis often involves analyzing complex records of system states printed to large, textual log files. Typically the logs are designed to accommodate the widest debug...