2152 search results - page 199 / 431 » On Automating the Calculus of Relations |
179
click to vote
FLOPS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the in...
195
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
168
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. In the paper we propose a method of structuring a knowledge base into hierarchically related contexts and present how this arrangement influences the structure of TBox a...
184
click to vote
DEON
2010
Springer
15 years 8 months ago
2010
Springer
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
177
click to vote
GIS
2008
ACM
15 years 6 months ago
2008
ACM
Spatially enabled government requires the development of effective SDIs that will support the vast majority of society, who are not spatially aware, in a transparent manner. This ...