Abstract is missing.
- From Tableaux to Automata for Description LogicsFranz Baader, Jan Hladik, Carsten Lutz, Frank Wolter. 1-32 [doi]
- Disproving False ConjecturesSerge Autexier, Carsten Schürmann. 33-48 [doi]
- A Formal Proof of Dickson s Lemma in ACL2Francisco-Jesús Martín-Mateos, José-Antonio Alonso, María-José Hidalgo, José-Luis Ruiz-Reina. 49-58 [doi]
- Imperative Object-Based Calculi in Co-inductive Type TheoriesAlberto Ciaffaglione, Luigi Liquori, Marino Miculan. 59-77 [doi]
- Congruence Closure with Integer OffsetsRobert Nieuwenhuis, Albert Oliveras. 78-90 [doi]
- A Machine-Verified Code GeneratorChristoph Walther, Stephan Schweitzer. 91-106 [doi]
- A Translation Characterizing the Constructive Content of Classical TheoriesMatthias Baaz, Christian G. Fermüller. 107-121 [doi]
- Extensions of Non-standard Inferences to Descriptions Logics with Transitive RolesSebastian Brandt, Anni-Yasmin Turhan, Ralf Küsters. 122-136 [doi]
- Extended Canonicity of Certain Topological Properties of Set SpacesBernhard Heinemann. 137-151 [doi]
- Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal LogicsSilvio Ghilardi, Luigi Santocanale. 152-166 [doi]
- Improving Dependency PairsJürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke. 167-182 [doi]
- On Closure under Complementation of Equational Tree Automata for Theories Extending ACKumar Neeraj Verma. 183-197 [doi]
- Completeness of E-Unification with Eager Variable EliminationBarbara Morawska. 198-212 [doi]
- Computable NumberingsSerikzhan Badaev. 213 [doi]
- Handling Equality in Monodic Temporal ResolutionBoris Konev, Anatoli Degtyarev, Michael Fisher. 214-228 [doi]
- Once upon a Time in a West - Determinacy, Definability, and Complexity of Path GamesDietmar Berwanger, Erich Grädel, Stephan Kreutzer. 229-243 [doi]
- Ordered DiagnosisDavy Van Nieuwenborgh, Dirk Vermeir. 244-258 [doi]
- Computing Preferred Answer Sets in Answer Set ProgrammingToshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta. 259-273 [doi]
- A Syntax-Based Approach to Reasoning about Actions and EventsQuoc Bao Vo, Abhaya C. Nayak, Norman Y. Foo. 274-288 [doi]
- Minimizing Automata on Infinite WordsThomas Wilke. 289 [doi]
- Gandy s Theorem for Abstract Structures without the Equality TestMargarita V. Korovina. 290-301 [doi]
- Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint SystemsMartin Fränzle, Christian Herde. 302-316 [doi]
- NP-Completeness Results for Deductive Problems on Stratified TermsThierry Boy de la Tour, Mnacho Echenim. 317-331 [doi]
- Is Cantor s Theorem Automatic?Dietrich Kuske. 332-345 [doi]
- Automatic Structures of Bounded DegreeMarkus Lohrey. 346-360 [doi]
- An Optimal Automata Approach to LTL Model Checking of Probabilistic SystemsJean-Michel Couvreur, Nasser Saheb, Grégoire Sutre. 361-375 [doi]
- A Logical Study on Qualitative Default Reasoning with ProbabilitiesChristoph Beierle, Gabriele Kern-Isberner. 376-388 [doi]
- On Structuring Proof Search for First Order Linear LogicPaola Bruscoli, Alessio Guglielmi. 389-406 [doi]
- Strict Geometry of Interaction Graph ModelsFurio Honsell, Marina Lenisa, Rekha Redamalla. 407-421 [doi]
- Connection-Based Proof Construction in Non-commutative LogicDidier Galmiche, J.-M. Notin. 422-436 [doi]