3776 search results - page 241 / 756 » Partition-Based Logical Reasoning |
151
Voted
TABLEAUX
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications (e.g., configuration and information...
157
click to vote
DEON
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Privacy policies are often defined in terms of permitted messages. Instead, in this paper we derive dynamically the permitted messages from static privacy policies defi...
127
click to vote
DLOG
2007
15 years 6 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...
144
Voted
CADE
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
125
click to vote
DLOG
2010
15 years 2 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...