Sciweavers

746 search results - page 16 / 150
» Connectionist Propositional Logic
Sort
View
JANCL
2006
100views more  JANCL 2006»
14 years 10 months ago
An efficient relational deductive system for propositional non-classical logics
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Andrea Formisano, Marianna Nicolosi Asmundo
SLOGICA
2010
135views more  SLOGICA 2010»
14 years 4 months ago
A Contraction-free and Cut-free Sequent Calculus for Propositional Dynamic Logic
In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the...
Brian Hill, Francesca Poggiolesi
FOSSACS
2006
Springer
15 years 1 months ago
Propositional Dynamic Logic with Recursive Programs
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
Christof Löding, Olivier Serre
AUSAI
2003
Springer
15 years 1 months ago
Decidability of Propositionally Quantified Logics of Knowledge
Abstract. Logics of knowledge have important applications for reasoning about security protocols and multi-agent systems. We extend the semantics for the logic of necessity with lo...
Tim French
ENTCS
2008
126views more  ENTCS 2008»
14 years 10 months ago
Admissibility of Cut in Coalgebraic Logics
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of th...
Dirk Pattinson, Lutz Schröder