76 search results - page 1 / 16 » Identification Constraints and Functional Dependencies in De... |
CADE
2006
Springer
14 years 5 months ago
2006
Springer
We investigate whether identification constraints such as keys and functional dependencies can be granted full status as a concept constructor in a Boolean-complete description log...
IJCAI
2001
13 years 6 months ago
2001
DLOG
2007
13 years 7 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
DLOG
2008
13 years 7 months ago
2008
A fundamental requirement for cooperating agents is to agree on a selection of component values of objects that can be used for reliably communicating references to the objects, to...