Abstract is missing.
- Automatic Inference of Resource Consumption BoundsElvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, Germán Puebla. 1-11 [doi]
- Matrix Interpretations for Polynomial Derivational Complexity of Rewrite SystemsAart Middeldorp. 12 [doi]
- Parameterized Complexity and Fixed-Parameter Tractability of Description Logic ReasoningBoris Motik. 13-14 [doi]
- Enfragmo: A System for Modelling and Solving Search Problems with LogicAmir Aavani, Xiongnan (Newman) Wu, Shahab Tasharrofi, Eugenia Ternovska, David G. Mitchell. 15-22 [doi]
- The Permutative λ-CalculusBeniamino Accattoli, Delia Kesner. 23-36 [doi]
- Automated and Human Proofs in General Mathematics: An Initial ComparisonJesse Alama, Daniel Kühlwein, Josef Urban. 37-45 [doi]
- Lazy Abstraction with Interpolants for ArraysFrancesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina. 46-61 [doi]
- Backward Trace Slicing for Conditional Rewrite TheoriesMaría Alpuente, Demis Ballis, Francisco Frechina, Daniel Romero. 62-76 [doi]
- Forgetting for Defeasible LogicGrigoris Antoniou, Thomas Eiter, Kewen Wang. 77-91 [doi]
- Querying ProofsDavid Aspinall, Ewen Denney, Christoph Lüth. 92-106 [doi]
- Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set ConstraintsFranz Baader, Alexander Okhotin. 107-121 [doi]
- Dual-Priced Modal Transition Systems with Time DurationsNikola Benes, Jan Kretínský, Kim Guldstrand Larsen, Mikael H. Møller, Jirí Srba. 122-137 [doi]
- Finding Finite Herbrand ModelsStefan Borgwardt, Barbara Morawska. 138-152 [doi]
- Smart Testing of Functional Programs in IsabelleLukas Bulwahn. 153-167 [doi]
- Monitor-Based Statistical Model Checking for Weighted Metric Temporal LogicPeter E. Bulychev, Alexandre David, Kim Guldstrand Larsen, Axel Legay, Guangyuan Li, Danny Bøgsted Poulsen, Amélie Stainer. 168-182 [doi]
- Duality between Merging Operators and Social Contraction OperatorsJosé Luis Chacón, Ramón Pino Pérez. 183-196 [doi]
- Automatic Generation of Invariants for Circular Derivations in SUP(LA)Arnaud Fietzke, Evgeny Kruglov, Christoph Weidenbach. 197-211 [doi]
- Moral Reasoning under UncertaintyHan The Anh, Ari Saptawijaya, Luís Moniz Pereira. 212-227 [doi]
- Towards Algorithmic Cut-IntroductionStefan Hetzl, Alexander Leitsch, Daniel Weller. 228-242 [doi]
- Conflict Anticipation in the Search for Graph AutomorphismsHadi Katebi, Karem A. Sakallah, Igor L. Markov. 243-257 [doi]
- Confluence of Non-Left-Linear TRSs via Relative TerminationDominik Klein, Nao Hirokawa. 258-273 [doi]
- Regular Expressions for Data WordsLeonid Libkin, Domagoj Vrgoc. 274-288 [doi]
- Automatic Verification of TLA + Proof Obligations with SMT SolversStephan Merz, Hernán Vanzetto. 289-303 [doi]
- An Asymptotically Correct Finite Path Semantics for LTLAndreas Morgenstern, Manuel Gesell, Klaus Schneider. 304-319 [doi]
- On the Domain and Dimension Hierarchy of Matrix InterpretationsFriedrich Neurauter, Aart Middeldorp. 320-334 [doi]
- iSat: Structure Visualization for SAT ProblemsEzequiel Orbe, Carlos Areces, Gabriel G. Infante López. 335-342 [doi]
- Linear Constraints over Infinite TreesMartin Hofmann, Dulma Rodriguez. 343-358 [doi]
- E-Matching with Free VariablesPhilipp Rümmer. 359-374 [doi]
- Random: R-Based Analyzer for Numerical DomainsGianluca Amato, Francesca Scozzari. 375-382 [doi]
- Solving Graded/Probabilistic Modal Logic via Linear Inequalities (System Description)William Snell, Dirk Pattinson, Florian Widmann. 383-390 [doi]
- Labelled Superposition for PLTLMartin Suda, Christoph Weidenbach. 391-405 [doi]
- The TPTP Typed First-Order Form with ArithmeticGeoff Sutcliffe, Stephan Schulz, Koen Claessen, Peter Baumgartner. 406-419 [doi]
- Ordinals and Knuth-Bendix OrdersSarah Winkler, Harald Zankl, Aart Middeldorp. 420-434 [doi]
- r-TuBound: Loop Bounds for WCET Analysis (Tool Paper)Jens Knoop, Laura Kovács, Jakob Zwirchmayr. 435-444 [doi]