607 search results - page 31 / 122 » Axiomatizing hybrid logic using modal logic |
JAPLL
2010
14 years 4 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
70
Voted
TLCA
2001
Springer
15 years 2 months ago
2001
Springer
We extend the modal logic of ambients described in [7] to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions ...
101
click to vote
TAP
2010
Springer
14 years 7 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
DAGSTUHL
2007
14 years 11 months ago
2007
Abstract. The paper proposes a logical systematization of the notion of countsas which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., f...