3032 search results - page 420 / 607 » Description Logic Rules |
111
click to vote
SIGSOFT
2007
ACM
16 years 1 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...
115
click to vote
KR
1998
Springer
15 years 5 months 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...
121
click to vote
DAARC
2007
Springer
15 years 7 months ago
2007
Springer
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
89
Voted
DAC
2005
ACM
16 years 1 months ago
2005
ACM
This paper presents a unifying framework for the modeling of asynchronous pipeline circuits. A pipeline protocol is captured in a graph-based model which defines the partial order...
190
Voted
POPL
2007
ACM
16 years 1 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...