366 search results - page 67 / 74 » Reasoning about relational granulation in modal logics |
104
click to vote
POPL
1993
ACM
15 years 1 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
98
Voted
KR
2004
Springer
15 years 2 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
95
Voted
TPHOL
2008
IEEE
15 years 3 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
101
click to vote
TPCD
1994
14 years 10 months ago
1994
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
SEMWEB
2005
Springer
15 years 2 months ago
2005
Springer
Information retrieval systems have to deal with uncertain knowledge and query results should reflect this uncertainty in some manner. However, Semantic Web ontologies are based on...