16666 search results - page 201 / 3334 » Descriptive and Computational Complexity |
127
Voted
DLOG
2007
15 years 6 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
LREC
2008
15 years 6 months ago
2008
The Italian particle ne exhibits interesting anaphoric properties that have not been yet explored in depth from a corpus and computational linguistic perspective. We provide: (i) ...
137
Voted
IJCAI
2001
15 years 5 months ago
2001
In a rational programming language, a program specifies a situation faced by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the...
113
click to vote
COLING
1996
15 years 5 months ago
1996
Our main motivation is to build general and adaptable linguistic tools and we have faced the problem of their portability. We first make a quick description of the linguistic tool...
114
click to vote
JLP
2006
15 years 4 months ago
2006
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...