152 search results - page 1 / 31 » Keys for Free in Description Logics |
14
Voted
DLOG
2000
13 years 6 months ago
2000
CSL
2000
Springer
13 years 9 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
IJCAI
2003
13 years 6 months ago
2003
Many description logics (DLs) combine knowledge tation on an abstract, logical level with an interface to “concrete” domains such as numbers and strings. We propose to extend ...
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...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...