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...
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...
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
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...