Sciweavers

1537 search results - page 263 / 308
» On sets not belonging to algebras
Sort
View
LCPC
2001
Springer
14 years 1 months ago
Strength Reduction of Integer Division and Modulo Operations
Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behav...
Jeffrey Sheldon, Walter Lee, Ben Greenwald, Saman ...
ECAI
2000
Springer
14 years 1 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
DATE
1998
IEEE
103views Hardware» more  DATE 1998»
14 years 1 months ago
Efficient Encoding Schemes for Symbolic Analysis of Petri Nets
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...
Enric Pastor, Jordi Cortadella
VLDB
1998
ACM
142views Database» more  VLDB 1998»
14 years 1 months ago
On the Discovery of Interesting Patterns in Association Rules
Many decision support systems, which utilize association rules for discovering interesting patterns, require the discovery of association rules that vary over time. Such rules des...
Sridhar Ramaswamy, Sameer Mahajan, Abraham Silbers...
WADT
1997
Springer
14 years 1 months ago
An inductive view of graph transformation
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
Fabio Gadducci, Reiko Heckel