| 2006 | On Locally Checkable Properties. | Orna Kupferman, Yoad Lustig, Moshe Y. Vardi |
| 2006 | Automatic Combinability of Rewriting-Based Satisfiability Procedures. | Hlne Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran |
| 2006 | On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus. | Kentaro Kikuchi |
| 2006 | Constructing Camin-Sokal Phylogenies Via Answer Set Programming. | Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Jn Manuch, Xiaohong Zhao, Arvind Gupta |
| 2006 | Reducing Nondeterminism in the Calculus of Structures. | Ozan Kahramanogullari |
| 2006 | Saturation Up to Redundancy for Tableau and Sequent Calculi. | Martin Giese |
| 2006 | Automating Verification of Loops by Parallelization. | Tobias Gedell, Reiner Hhnle |
| 2006 | Theory Instantiation. | Harald Ganzinger, Konstantin Korovin |
| 2006 | Representing Defaults and Negative Information Without Negation-as-Failure. | Pablo R. Fillottrani, Guillermo Ricardo Simari |
| 2006 | Automata for Positive Core XPath Queries on Compressed Documents. | Barbara Fila, Siva Anantharaman |
| 2006 | Combining Supervaluation and Degree Based Reasoning Under Vagueness. | Christian G. Fermller, Robert Kosik |
| 2006 | Matching Modulo Superdevelopments Application to Second-Order Matching. | Germain Faure |
| 2006 | Inductive Decidability Using Implicit Induction. | Stephan Falke, Deepak Kapur |
| 2006 | Boolean Rings for Intersection-Based Satisfiability. | Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss |
| 2006 | A Relaxed Approach to Integrity and Inconsistency in Databases. | Hendrik Decker, Davide Martinenghi |
| 2006 | Deciding Key Cycles for Security Protocols. | Vronique Cortier, Eugen Zalinescu |
| 2006 | Representation of Partial Knowledge and Query Answering in Locally Complete Databases. | Alvaro Corts-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe |
| 2006 | SAT Solving for Argument Filterings. | Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, Ren Thiemann, Jrgen Giesl |
| 2006 | Modular Cut-Elimination: Finding Proofs or Counterexamples. | Agata Ciabattoni, Kazushige Terui |
| 2006 | To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in | Roberto Bruttomesso, Alessandro Cimatti, Anders Franzn, Alberto Griggio, Alessandro Santuari, Roberto Sebastiani |
| 2006 | Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis. | Roberto Bruttomesso, Alessandro Cimatti, Anders Franzn, Alberto Griggio, Roberto Sebastiani |
| 2006 | Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints. | Laura Bozzelli, Rgis Gascon |
| 2006 | A Semantic Completeness Proof for TaMeD. | Richard Bonichon, Olivier Hermant |
| 2006 | A Characterization of Alternating Log Time by First Order Functional Programs. | Guillaume Bonfante, Jean-Yves Marion, Romain Pchoux |
| 2006 | Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems. | Frdric Blanqui, Colin Riba |