Incremental Decision Procedures for Modal Logic with Nominals and Eventualities

Outline of the paper: In Sect. 2, we introduce the syntax and proof theory of some constructive modal logics, and in Sect. 3, we give our definition of a justification logic

Using these ideas, we demonstrate that Jedi outperforms special- ized graph engines by over an order of magnitude and rela- tional systems by over two orders of magnitude on

As far as we know, relational dual tableau-based decision procedures can be found in [16] for fragments of RL(1) corresponding to the class of first-order formulae in prenex normal

In this paper, we present a MILP-based tableau procedure that allows to reason within fuzzy ALCB, i.e., ALC with individual value restrictions.. Interestingly, unlike classical

In order to arrive to this result, the paper is organised as follows: Section 2 presents the key features of the problem we want to solve (the minimization among transport maps T )

As a consequence, considering all the formulae in the node label for blocking instead of a single formula (paired, in the setting of our calculus for hybrid logic, with a

A tableau calculus is called sound iff each satisfiable input formula ϕ is tableau-satisfiable; complete iff for each valid input formula ϕ there exists a tableau proof of

While the first provably worse case optimal join algorithm was dis- covered relatively recently, the techniques and results surrounding these algorithms grow out of decades of