• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 23 matches

• 2017
• 
  Lee A. Barnett:
  Goal-Sensitive Reasoning with Disconnection Tableaux. TABLEAUX 2017: 163-174
• 
  Peter Baumgartner, Sylvie Thiébaux, Felipe W. Trevizan:
  Tableaux for Policy Synthesis for MDPs with PCTL* Constraints. TABLEAUX 2017: 175-192
• 
  Wolfgang Bibel:
  A Vision for Automated Deduction Rooted in the Connection Method. TABLEAUX 2017: 3-21
• 
  Katalin Bimbó:
  On the Decidability of Certain Semi-Lattice Based Modal Logics. TABLEAUX 2017: 44-61
• 
  David M. Cerna, Michael Peter Lettmann:
  Integrating a Global Induction Mechanism into a Sequent Calculus. TABLEAUX 2017: 278-294
• 
  Serenella Cerrito, Amélie David:
  Minimisation of ATL * Models. TABLEAUX 2017: 193-208
• 
  Liron Cohen:
  Completeness for Ancestral Logic via a Computationally-Meaningful Semantics. TABLEAUX 2017: 247-260
• 
  Anupam Das, Damien Pous:
  A Cut-Free Cyclic Proof System for Kleene Algebra. TABLEAUX 2017: 261-277
• 
  Jeremy E. Dawson, Rajeev Goré:
  Issues in Machine-Checking the Decidability of Implicational Ticket Entailment. TABLEAUX 2017: 347-363
• 
  Crystal Chang Din, Reiner Hähnle, Einar Broch Johnsen, Ka I Pun, Silvia Lizeth Tapia Tarifa:
  Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages. TABLEAUX 2017: 22-43
• 
  Christian G. Fermüller, Timo Lang:
  Interpreting Sequent Calculi as Client-Server Games. TABLEAUX 2017: 98-113
• 
  Camillo Fiorentini, Mauro Ferrari:
  A Forward Unprovability Calculus for Intuitionistic Propositional Logic. TABLEAUX 2017: 114-130
• 
  Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Luca Pozzato:
  Hypersequent Calculi for Lewis' Conditional Logics with Uniformity and Reflexivity. TABLEAUX 2017: 131-148
• 
  Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Luca Pozzato, Quentin Vitalis:
  VINTE: An Implementation of Internal Calculi for Lewis' Logics of Counterfactual Reasoning. TABLEAUX 2017: 149-159
• 
  Ori Lahav, Yoni Zohar:
  Cut-Admissibility as a Corollary of the Subformula Property. TABLEAUX 2017: 65-80
• 
  Sonia Marin, Lutz Straßburger:
  Proof Theory for Indexed Nested Sequents. TABLEAUX 2017: 81-97
• 
  Mateus de Oliveira Oliveira:
  Parameterized Provability in Equational Logic. TABLEAUX 2017: 364-380
• 
  Jens Otten:
  Non-clausal Connection Calculi for Non-classical Logics. TABLEAUX 2017: 209-227
• 
  Reuben N. S. Rowe, James Brotherston:
  Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent. TABLEAUX 2017: 295-310
• 
  Peter H. Schmitt:
  A Mechanizable First-Order Theory of Ordinals. TABLEAUX 2017: 331-346
• 
  Sorin Stratulat:
  Cyclic Proofs with Ordering Constraints. TABLEAUX 2017: 311-327
• 
  Dmitry Tishkovsky, Renate A. Schmidt:
  Rule Refinement for Semantic Tableau Calculi. TABLEAUX 2017: 228-244
• 
  Renate A. Schmidt, Cláudia Nalon:
  Automated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, TABLEAUX 2017, Brasília, Brazil, September 25-28, 2017, Proceedings. Lecture Notes in Computer Science 10501, Springer 2017, ISBN 978-3-319-66901-4 [contents]