- Qingxiang Wang, Cezary Kaliszyk
:
JEFL: Joint Embedding of Formal Proof Libraries. FroCoS 2021: 154-170 - Boris Konev, Giles Reger:
Frontiers of Combining Systems - 13th International Symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021, Proceedings. Lecture Notes in Computer Science 12941, Springer 2021, ISBN 978-3-030-86204-6 [contents] - 2019
- Takahito Aoto, Yoshihito Toyama:
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems. FroCos 2019: 330-347 - Franz Baader, Filippo De Bortoli:
On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets. FroCos 2019: 203-219 - Franz Baader, Andreas Ecke, Gabriele Kern-Isberner, Marco Wilhelm:
The Complexity of the Consistency Problem in the Probabilistic Description Logic 𝓐ℒ𝒞ME. FroCos 2019: 167-184 - Ralph Bottesch, Max W. Haslbeck, René Thiemann:
Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL. FroCos 2019: 223-239 - Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller:
A CDCL-Style Calculus for Solving Non-linear Constraints. FroCos 2019: 131-148 - Hans Kleine Büning, Piotr Wojciechowski, R. Chandrasekaran, K. Subramani:
Restricted Cutting Plane Proofs in Horn Constraint Systems. FroCos 2019: 149-164 - Warren Del-Pinto, Renate A. Schmidt:
Extending Forgetting-Based Abduction Using Nominals. FroCos 2019: 185-202 - Manuel Eberl:
Verifying Randomised Social Choice. FroCos 2019: 240-256 - Mnacho Echenim, Nicolas Peltier, Yanis Sellami:
Ilinva: Using Abduction to Generate Loop Invariants. FroCos 2019: 77-93 - Alireza Ensan, Eugenia Ternovska:
A Language-Independent Framework for Reasoning About Preferences for Declarative Problem Solving. FroCos 2019: 57-73 - David Fuenmayor, Christoph Benzmüller:
Mechanised Assessment of Complex Natural-Language Arguments Using Expressive Logic Combinations. FroCos 2019: 112-128 - Carsten Fuhs:
Transforming Derivational Complexity of Term Rewriting to Runtime Complexity. FroCos 2019: 348-364 - Andrzej Indrzejczak:
Two Is Enough - Bisequent Calculus for S5. FroCos 2019: 277-294 - Dohan Kim, Christopher Lynch, Paliath Narendran:
Reviving Basic Narrowing Modulo. FroCos 2019: 313-329 - Roman Kuznets, Laurent Prosperi, Ulrich Schmid, Krisztina Fruzsa:
Epistemic Reasoning with Byzantine-Faulty Agents. FroCos 2019: 259-276 - Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar:
On Asymmetric Unification for the Theory of XOR with a Homomorphism. FroCos 2019: 297-312 - Michael Rawson, Giles Reger:
A Neurally-Guided, Parallel Theorem Prover. FroCos 2019: 40-56 - Giles Reger, Martin Riener, Martin Suda:
Symmetry Avoidance in MACE-Style Finite Model Finding. FroCos 2019: 3-21 - Eugenia Ternovska:
An Algebra of Modular Systems: Static and Dynamic Perspectives. FroCos 2019: 94-111 - Andreas Teucke, Marco Voigt, Christoph Weidenbach:
On the Expressivity and Applicability of Model Representation Formalisms. FroCos 2019: 22-39 - Andreas Herzig, Andrei Popescu:
Frontiers of Combining Systems - 12th International Symposium, FroCoS 2019, London, UK, September 4-6, 2019, Proceedings. Lecture Notes in Computer Science 11715, Springer 2019, ISBN 978-3-030-29006-1 [contents] - 2017
- Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho:
On Solving Nominal Fixpoint Equations. FroCoS 2017: 209-226 - Franz Baader:
A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors. FroCoS 2017: 43-59 - Franz Baader, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki, Veronika Thost:
Metric Temporal Description Logics with Interval-Rigid Names. FroCoS 2017: 60-76 - Franz Baader, Patrick Koopmann, Anni-Yasmin Turhan:
Using Ontologies to Query Probabilistic Numerical Data. FroCoS 2017: 77-94 - Matthias Baaz, Anela Lolic:
First-Order Interpolation of Non-classical Logics Derived from Propositional Interpolation. FroCoS 2017: 265-280 - Philippe Balbiani, Çigdem Gencer:
Finitariness of Elementary Unification in Boolean Region Connection Calculus. FroCoS 2017: 281-297 - Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti:
Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report. FroCoS 2017: 153-171
