Journal: Electronic Notes in Theoretical Computer Science

Volume 86, Issue 1

1 -- 8Dieter Hutter. Deduction as an Engineering Science
9 -- 21Thomas Hillenbrand. Citius altius fortius: Lessons learned from the Theorem Prover WALDMEISTER
22 -- 34Silvio Ghilardi. Quantifier Elimination and Provers Integration
35 -- 48Cesare Tinelli, Calogero G. Zarba. Combining Non-Stably Infinite Theories
49 -- 60Domenico Cantone, Jacob T. Schwartz, Calogero G. Zarba. A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions
61 -- 75Thierry Boy de la Tour, Mnacho Echenim. On Leaf Permutative Theories and Occurrence Permutation Groups
76 -- 90Sébastien Limet, Gernot Salzer. Manipulating Tree Tuple Languages by Transforming Logic Programs
91 -- 104Nicolas Peltier. A Resolution-based Model Building Algorithm for a Fragment of OCC1N=
105 -- 119Silvio Ranise, David Déharbe. Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs
120 -- 132Nachum Dershowitz. Canonicity
133 -- 146Guillaume Feuillade, Thomas Genet. Reachability in Conditional Term Rewriting Systems
147 -- 152Josef Urban. MPTP 0.1: System Description
153 -- 161Abdessamad Imine, Pascal Molli, Gérald Oster, Pascal Urso. VOTE: Group Editors Analyzing Tool: System Description
162 -- 173Hans Zantema, Jan Friso Groote. Transforming equality logic to propositional logic
174 -- 189Mateja Jamnik, Predrag Janicic. Learning Strategies for Mechanised Building of Decision Procedures
190 -- 203Hantao Zhang, Haiou Shen, Felip Manyà. Exact Algorithms for MAX-SAT
204 -- 205Ingo Dahn, Laurent Vigneron. Preface