Sciweavers

5243 search results - page 802 / 1049
» Reasoning About Strategies
Sort
View
CINQ
2004
Springer
131views Database» more  CINQ 2004»
16 years 1 days ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
CSL
2004
Springer
16 years 1 days ago
Game-Based Notions of Locality Over Finite Models
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
DFG
2004
Springer
16 years 1 days ago
A Unifying Semantics for Sequential Function Charts
Programmable Logic Controllers (PLC) are widely used as device controllers for assembly lines, chemical processes, or power plants. Sequential Function Charts (SFC) form one of the...
Nanette Bauer, Ralf Huuck, Ben Lukoschus, Sebastia...
ECAI
2004
Springer
16 years 1 days ago
A Formal Tutoring Process Model for Intelligent Tutoring Systems
The combination Computer Based Training systems with Artificial Intelligence and Cognitive Science has led to the development of Intelligent Tutoring Systems nearly 30 years ago. ...
Alke Martens, Adelinde Uhrmacher
ECOOP
2004
Springer
16 years 1 days ago
Typestates for Objects
Today’s mainstream object-oriented compilers and tools do not support declaring and statically checking simple pre- and postconditions on methods and invariants on object represe...
Robert DeLine, Manuel Fähndrich