2911 search results - page 130 / 583 » A Logic of Graph Constraints |
119
Voted
DAWAK
2011
Springer
14 years 14 days ago
2011
Springer
Data cleaning and ETL processes are usually modeled as graphs of data transformations. The involvement of the users responsible for executing these graphs over real data is importa...
110
Voted
SAT
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
STOC
2009
ACM
16 years 1 months ago
2009
ACM
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
117
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
100
click to vote
CONCUR
2004
Springer
15 years 6 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...