Sciweavers

27 search results - page 6 / 6
» Handling Polymorphism in Automated Deduction
Sort
View
LOGCOM
2010
136views more  LOGCOM 2010»
13 years 3 months ago
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
Bi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But ...
Rajeev Goré, Linda Postniece
SBBD
2004
119views Database» more  SBBD 2004»
13 years 6 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link