119 search results - page 14 / 24 » On finite alphabets and infinite bases |
ATVA
2006
Springer
14 years 1 months ago
2006
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
FOIKS
2008
Springer
13 years 11 months ago
2008
Springer
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
ASE
2005
13 years 9 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...
FATES
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
AI
2008
Springer
13 years 8 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...