Sciweavers

1151 search results - page 211 / 231
» Collaborative Programming: Applications of Logic and Automat...
Sort
View
CADE
2005
Springer
15 years 10 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
TIME
2009
IEEE
15 years 4 months ago
Model Checking CTL is Almost Always Inherently Sequential
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
TIME
2008
IEEE
15 years 4 months ago
Time Aware Mining of Itemsets
Frequent behavioural pattern mining is a very important topic of knowledge discovery, intended to extract correlations between items recorded in large databases or Web acces logs....
Bashar Saleh, Florent Masseglia
FUZZIEEE
2007
IEEE
15 years 4 months ago
Using Orders of Magnitude and Nominal Variables to Construct Fuzzy Partitions
— The application of Qualitative Reasoning to Learning Algorithms can provide these models with the capability of automate common-sense and expert reasoning. Learning algorithms ...
Cati Olmo, Germán Sánchez, Francesc ...
CSL
2004
Springer
15 years 3 months ago
Parameterized Model Checking of Ring-Based Message Passing Systems
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems,  ¢¡ , comprised of finite, but arbitrarily many,...
E. Allen Emerson, Vineet Kahlon