615 search results - page 13 / 123 » Completeness of Combinations of Constructor Systems |
FROCOS
2000
Springer
13 years 11 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
FROCOS
2005
Springer
14 years 1 months ago
2005
Springer
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract In this document we make a brief review of memory management and DMA considerations in case of common SCI hardware and the Virtual Interface Architecture. On this basis we...