Electronic Notes in Theoretical Computer Science, Volume 262
Volume 262, May 2010
- Régis Alenda, Nicola Olivetti, Gian Luca Pozzato: CSL-lean: A Theorem-prover for the Logic of Comparative Concept Similarity. 3-16
- Sergey Babenyshev, Vladimir V. Rybakov, Renate A. Schmidt, Dmitry Tishkovsky: A Tableau Method for Checking Rule Admissibility in S4. 17-32
- Philippe Balbiani, Fahima Cheikh, Guillaume Feuillade: Controller/Orchestrator Synthesis via Filtration. 33-48
- Mario R. F. Benevides, L. Menasché Schechter: A Propositional Dynamic Logic for Concurrent Programs Based on the pi-Calculus. 49-64
- Davide Bresolin, Dario Della Monica, Valentin Goranko, Angelo Montanari, Guido Sciavicco: Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings. 65-81
- Valentin Goranko, Angelo Kyrilov, Dmitry Shkatov: Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis. 113-125
- Jens Ulrik Hansen: Terminating Tableaux for Dynamic Epistemic Logics. 141-156
- Lauri Hella, Antti Kuusisto: Monadic Sigma11 and Modal Logic with Quantified Binary Relations. 173-188
- Kurt Ranalter: Embedding Constructive K into Intuitionistic K. 205-219
- Renate A. Schmidt: Simulation and Synthesis of Deduction Calculi. 221-229
- Gert van Valkenhoef, Elske van der Vaart, Rineke Verbrugge: OOPS: An S5n Prover for Educational Settings. 249-261
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team