936 search results - page 91 / 188 » The Logical Difference Problem for Description Logic Termino... |
SAC
2002
ACM
13 years 7 months ago
2002
ACM
Web-based applications are typically required to be highly customizable and configurable. New application requirements have to be introduced rapidly, often without stopping the ru...
IANDC
2010
13 years 5 months ago
2010
The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
KR
1998
Springer
14 years 3 days ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
WISE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...