607 search results - page 21 / 122 » Axiomatizing hybrid logic using modal logic |
150
click to vote
TABLEAUX
2000
Springer
15 years 9 months ago
2000
Springer
Two things are done in this paper. First, a modal logic in which one can quantify over both objects and concepts is presented; a semantics and a tableau system are given. It is a n...
187
click to vote
TABLEAUX
2000
Springer
15 years 9 months ago
2000
Springer
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for ...
161
click to vote
CSL
1997
Springer
15 years 10 months ago
1997
Springer
We present a complete axiomatization of test algebra ( 24, 18, 29]), the two-sorted algebraic variant of Propositional Dynamic Logic (PDL, 21, 7]). The axiomatization consists of ...
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...
171
click to vote
IJCAI
2003
15 years 7 months ago
2003
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...