Sciweavers

174 search results - page 32 / 35
» Loop Calculus for Satisfiability
Sort
View
TACS
1994
Springer
13 years 11 months ago
Syntactic Definitions of Undefined: On Defining the Undefined
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
Zena M. Ariola, Richard Kennaway, Jan Willem Klop,...
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
13 years 11 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
PODS
2004
ACM
120views Database» more  PODS 2004»
14 years 7 months ago
Locally Consistent Transformations and Query Answering in Data Exchange
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions ? ta...
Marcelo Arenas, Pablo Barceló, Ronald Fagin...
KBSE
2007
IEEE
14 years 1 months ago
Ensuring consistency in long running transactions
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
Jeffrey Fischer, Rupak Majumdar
RTAS
2007
IEEE
14 years 1 months ago
Full Duplex Switched Ethernet for Next Generation "1553B"-Based Applications
Over the last thirty years, the MIL-STD 1553B data bus has been used in many embedded systems, like aircrafts, ships, missiles and satellites. However, the increasing number and c...
Ahlem Mifdaoui, Fabrice Frances, Christian Fraboul