97 search results - page 7 / 20 » A Systematic Proof Theory for Several Modal Logics |
90
Voted
CLIMA
2004
15 years 1 months ago
2004
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
113
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
73
Voted
DEON
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In this paper we investigate the design space of access control logics. Specifically, we consider several possible axioms for the common operator says. Some of the axioms...
106
Voted
CADE
2005
Springer
15 years 12 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
BIRTHDAY
2007
Springer
15 years 5 months ago
2007
Springer
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...