92 search results - page 7 / 19 » Description Logics with Concrete Domains and Functional Depe... |
DLOG
2007
13 years 10 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...
SIGSOFT
2010
ACM
13 years 5 months ago
2010
ACM
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...
IJCAI
2003
13 years 9 months ago
2003
Motivated by the matchmaking problem in electronic marketplaces, we study abduction in Description Logics. We devise suitable definitions of the problem, and show how they can mod...
CAISE
2009
Springer
13 years 11 months ago
2009
Springer
Just like web services, business processes can be stored in public repositories to be shared and used by third parties, e.g., as building blocks for constructing new business proce...