3244 search results - page 55 / 649 » Extensions to Description Logics |
147
click to vote
TARK
2007
Springer
16 years 6 days ago
2007
Springer
In this paper we show how coalition logic can be reduced to the fusion of a normal modal STIT logic for agency and a standard normal temporal logic for discrete time, and how this...
168
click to vote
JAPLL
2010
15 years 4 months ago
2010
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
145
click to vote
SIGCSE
2009
ACM
16 years 6 months ago
2009
ACM
ion and Extensibility in Digital Logic Simulation Software Richard M. Salter and John L. Donaldson Computer Science Department Oberlin College Oberlin, OH 44074 rms@cs.oberlin.edu,...
149
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
166
click to vote
JFPLC
1998
15 years 7 months ago
1998
Abstract. This paper presents a feature constraint system that, compared with the well-known systems OSF 1] and CFT 5], incorporates several interesting characteristics. The new sy...