2035 search results - page 84 / 407 » On the complexity of stratified logics |
144
click to vote
AGP
2003
IEEE
15 years 11 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
147
click to vote
APAL
2010
15 years 6 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
151
click to vote
WOLLIC
2009
Springer
16 years 26 days ago
2009
Springer
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
161
click to vote
ISMIS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The post-genomic era showed up a wide range of new challenging issues for the areas of knowledge discovery and intelligent information management. Among them, the discove...
152
click to vote
DLOG
2007
15 years 8 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...