Sciweavers

289 search results - page 27 / 58
» Regular Linear Temporal Logic
Sort
View
LICS
2010
IEEE
15 years 2 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
NIPS
2001
15 years 5 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
AMAST
2006
Springer
15 years 7 months ago
Fork Algebras as a Sufficiently Rich Universal Institution
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
Carlos López Pombo, Marcelo F. Frias
131
Voted
KBSE
2005
IEEE
15 years 9 months ago
Properties and scopes in web model checking
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while ot...
May Haydar, Sergiy Boroday, Alexandre Petrenko, Ho...
CHARME
2005
Springer
122views Hardware» more  CHARME 2005»
15 years 9 months ago
Regular Vacuity
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
Doron Bustan, Alon Flaisher, Orna Grumberg, Orna K...