List of the FroCoS 2019 Accepted Papers

(produced using EasyChair)

Giles Reger, Martin Riener and Martin Suda. Symmetry Avoidance in MACE-Style Finite Model Finding
Andreas Teucke, Marco Voigt and Christoph Weidenbach. On the Expressivity and Applicability of Model Representation Formalisms
Roman Kuznets, Laurent Prosperi, Ulrich Schmid and Krisztina Fruzsa. Epistemic Reasoning with Byzantine-Faulty Agents
Ralph Bottesch, Max W. Haslbeck and René Thiemann. Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL
Franz Baader, Andreas Ecke, Gabriele Kern-Isberner and Marco Wilhelm. The Complexity of the Consistency Problem in the Probabilistic Description Logic ALC^ME
Mnacho Echenim, Nicolas Peltier and Yanis Sellami. Ilinva: Using Abduction to Generate Loop Invariants
Andrzej Indrzejczak. Two is Enough -- Bisequent Calculus for S5
Franz Brauße, Konstantin Korovin, Margarita Korovina and Norbert Th. Müller. A CDCL-style calculus for solving non-linear constraints
Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran and Veena Ravishankar. On Asymmetric Unification for the Theory of XOR with a Homomorphism
Warren Del-Pinto and Renate A. Schmidt. Extending Forgetting-Based Abduction using Nominals
Dohan Kim, Christopher Lynch and Paliath Narendran. Reviving Basic Narrowing Modulo
Eugenia Ternovska. An Algebra of Modular Systems: Static and Dynamic Perspectives
Takahito Aoto and Yoshihito Toyama. Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems
Michael Rawson and Giles Reger. A Neurally-Guided, Parallel Theorem Prover
Franz Baader and Filippo De Bortoli. On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets
Manuel Eberl. Verifying Randomised Social Choice
David Fuenmayor and Christoph Benzmüller. Mechanised Assessment of Complex Natural-Language Arguments using Expressive Logic Combinations (*)
Hans Kleine Büning, Piotr Wojciechowski, Ramaswamy Chandrasekaran and K. Subramani. On some classes of restricted cutting plane systems
Carsten Fuhs. Derivational Complexity of Term Rewriting Revisited
Alireza Ensan and Eugenia Ternovska. A Language-Independent Framework for Reasoning about Preferences for Declarative Problem Solving