Automated reasoning with analytic tableaux and related methods. 20th international conference, TABLEAUX 2011, Bern, Switzerland, July 4--8, 2011. Proceedings (Q545854)

The articles of this volume will be reviewed individually. In 2010, TABLEAUX was part of IJCAR 2010 (see Zbl 1195.68005). For the 18th conference, TABLEAUX 2009, see Zbl 1173.68010. Indexed articles: \textit{Bonacina, Maria Paola; Johansson, Moa}, On interpolation in decision procedures, 1-16 [Zbl 1331.68198] \textit{Furbach, Ulrich}, First-order tableaux in applications (extended abstract), 17-19 [Zbl 1331.68201] \textit{Alenda, Régis; Olivetti, Nicola}, CSymLean: a theorem prover for the logic CSL over symmetric minspaces, 21-26 [Zbl 1331.68197] \textit{Aravantinos, Vincent; Peltier, Nicolas}, Schemata of SMT-problems, 27-42 [Zbl 1333.03103] \textit{Avron, Arnon; Lahav, Ori}, Kripke semantics for basic sequent systems, 43-57 [Zbl 1333.03236] \textit{Bozzelli, Laura; Lanotte, Ruggero}, Hybrid and first-order complete extensions of CaRet, 58-72 [Zbl 1333.03005] \textit{Bresolin, Davide; Montanari, Angelo; Sala, Pietro; Sciavicco, Guido}, Optimal tableau systems for propositional neighborhood logic over all, dense, and discrete linear orders, 73-87 [Zbl 1333.03006] \textit{Brotherston, James; Goré, Rajeev}, Craig interpolation in displayable logics, 88-103 [Zbl 1333.03107] \textit{Cerrito, Serenella; Cialdea Mayer, Marta}, A tableaux based decision procedure for a broad class of hybrid formulae with binders, 104-118 [Zbl 1331.68200] \textit{Ciabattoni, Agata; Lahav, Ori; Zamansky, Anna}, Basic constructive connectives, determinism and matrix-based semantics, 119-133 [Zbl 1333.03237] \textit{Das, Anupam}, On the proof complexity of cut-free bounded deep inference, 134-148 [Zbl 1333.03239] \textit{Friedmann, Oliver; Lange, Martin}, The modal \(\mu \)-calculus caught off guard, 149-163 [Zbl 1333.03007] \textit{Genovese, Valerio; Giordano, Laura; Gliozzi, Valentina; Pozzato, Gian Luca}, A conditional constructive logic for access control and its sequent calculus, 164-179 [Zbl 1333.03104] \textit{Giordano, Laura; Gliozzi, Valentina; Olivetti, Nicola; Pozzato, Gian Luca}, A tableau calculus for a nonmonotonic extension of \(\mathcal{EL}^\bot\), 180-195 [Zbl 1332.68209] \textit{Kaminski, Mark; Schneider, Thomas; Smolka, Gert}, Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics, 196-210 [Zbl 1333.03008] \textit{Lellmann, Björn; Pattinson, Dirk}, Cut elimination for shallow modal logics, 211-225 [Zbl 1244.68069] \textit{Otten, Jens}, A non-clausal connection calculus, 226-241 [Zbl 1333.03004] \textit{Tishkovsky, Dmitry; Schmidt, Renate A.; Khodadadi, Mohammad}, \textsc{MetTeL}: a tableau prover with logic-independent inference engine, 242-247 [Zbl 1332.68205] \textit{Tiu, Alwen}, A hypersequent system for Gödel-Dummett logic with non-constant domains, 248-262 [Zbl 1333.03088] \textit{Urban, Josef; Vyskočil, Jiří; Štěpánek, Petr}, MaLeCoP. Machine learning connection prover, 263-277 [Zbl 1332.68206]