1436 search results - page 105 / 288 » Description Logic Unplugged |
DLOG
2011
14 years 1 months ago
2011
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
107
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
ESWS
2005
Springer
15 years 3 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
102
click to vote
ASIAN
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Clever algorithm design is sometimes superseded by simple encodings into logic. We apply this motto to a few case studies in the formal verification of security propertie...