607 search results - page 21 / 122 » Axiomatizing hybrid logic using modal logic |
TABLEAUX
2000
Springer
15 years 1 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...
101
click to vote
TABLEAUX
2000
Springer
15 years 1 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 ...
90
Voted
CSL
1997
Springer
15 years 1 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 ...
JAPLL
2010
14 years 8 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...
IJCAI
2003
14 years 11 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 ...