Sciweavers

54 search results - page 9 / 11
» Integrity Constraints Checking In Deductive Databases
Sort
View
WWW
2007
ACM
14 years 9 months ago
Bridging the gap between OWL and relational databases
Schema statements in OWL are interpreted quite differently from analogous statements in relational databases. If these statements are meant to be interpreted as integrity constrai...
Boris Motik, Ian Horrocks, Ulrike Sattler
DBPL
1997
Springer
133views Database» more  DBPL 1997»
14 years 24 days ago
Automatic Verification of Transactions on an Object-Oriented Database
Abstract. In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead...
David Spelt, Herman Balsters
SIGMOD
2004
ACM
173views Database» more  SIGMOD 2004»
14 years 8 months ago
Relaxed Currency and Consistency: How to Say "Good Enough" in SQL
Despite the widespread and growing use of asynchronous copies to improve scalability, performance and availability, this practice still lacks a firm semantic foundation. Applicati...
Hongfei Guo, Jonathan Goldstein, Per-Åke Lar...
FMCAD
2006
Springer
14 years 9 days ago
Ario: A Linear Integer Arithmetic Logic Solver
Ario is a solver for systems of linear integer arithmetic logic. Such systems are commonly used in design verification applications and are classified under Satisfiability Modulo T...
Hossein M. Sheini, Karem A. Sakallah
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 6 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...