3658 search results - page 345 / 732 » The logic of proofs, semantically |
203
click to vote
CONTEXT
2003
Springer
16 years 3 days ago
2003
Springer
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
187
click to vote
APWEB
2006
Springer
15 years 10 months ago
2006
Springer
Named Graphs is a simple, compatible extension to the RDF syntax that enables statements to be made about RDF graphs. This approach is in contrast to earlier attempts such as RDF r...
169
click to vote
CSL
1999
Springer
15 years 11 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
200
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
167
click to vote
AAAI
2008
15 years 9 months ago
2008
The interpreted system model offers a computationally grounded model, in terms of the states of computer processes, to S5 epistemic logics. This paper extends the interpreted syst...