Sciweavers

1321 search results - page 188 / 265
» Subtyping in Logical Form
Sort
View
ECSQARU
2009
Springer
15 years 4 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova
SCP
2010
123views more  SCP 2010»
15 years 1 months ago
Slicing for architectural analysis
Current software development often relies on non trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such ...
Nuno F. Rodrigues, Luís Soares Barbosa
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 8 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
CADE
2006
Springer
16 years 6 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
16 years 3 months ago
Correct-by-construction microarchitectural pipelining
— This paper presents a method for correct-by-construction microarchitectural pipelining that handles cyclic systems with dependencies between iterations. Our method combines pre...
Timothy Kam, Michael Kishinevsky, Jordi Cortadella...