Sciweavers

3239 search results - page 49 / 648
» A Logical Process Calculus
Sort
View
96
Voted
LPAR
2004
Springer
15 years 6 months ago
The Inverse Method for the Logic of Bunched Implications
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, S...
122
Voted
CSFW
2012
IEEE
13 years 3 months ago
Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
Valerio Genovese, Deepak Garg, Daniele Rispoli
CADE
2007
Springer
16 years 26 days ago
Optimized Reasoning in Description Logics Using Hypertableaux
We present a novel reasoning calculus for Description Logics (DLs)--knowledge representation formalisms with applications in areas such as the Semantic Web. In order to reduce the ...
Boris Motik, Rob Shearer, Ian Horrocks
114
Voted
CSL
2003
Springer
15 years 5 months ago
Atomic Cut Elimination for classical Logic
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
Kai Brünnler
ENTCS
2008
90views more  ENTCS 2008»
15 years 18 days ago
Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic
The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweig...
Richard Bubel, Andreas Roth, Philipp Rümmer