- Julian Biendarra, Jasmin Christian Blanchette
, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondrej Kuncar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu, Christian Sternagel, René Thiemann, Dmitriy Traytel:
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic. FroCoS 2017: 3-21 - Carlos Caleiro, Sérgio Marcelino, João Marcos:
Merging Fragments of Classical Logic. FroCoS 2017: 298-315 - Jens Claßen, Benjamin Zarrieß:
Decidable Verification of Decision-Theoretic Golog. FroCoS 2017: 227-243 - Simon Cruanes:
Superposition with Structural Induction. FroCoS 2017: 172-188 - Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan-Tung Vu:
Subtropical Satisfiability. FroCoS 2017: 189-206 - Silvio Ghilardi, Alessandro Gianola:
Interpolation, Amalgamation and Combination (The Non-disjoint Signatures Case). FroCoS 2017: 316-332 - Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems. FroCoS 2017: 115-131 - Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl:
Complexity Analysis for Term Rewriting by Integer Transition Systems. FroCoS 2017: 132-150 - Andrew Reynolds, Cesare Tinelli, Dejan Jovanovic, Clark W. Barrett:
Designing Theory Solvers with Extensions. FroCoS 2017: 22-40 - Jelena Vlasenko, Volker Haarslev, Brigitte Jaumard:
Pushing the Boundaries of Reasoning About Qualified Cardinality Restrictions. FroCoS 2017: 95-112 - Marco Voigt:
The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable. FroCoS 2017: 244-261 - Christoph Wernhard:
The Boolean Solution Problem from the Perspective of Predicate Logic. FroCoS 2017: 333-350 - Clare Dixon, Marcelo Finger:
Frontiers of Combining Systems - 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings. Lecture Notes in Computer Science 10483, Springer 2017, ISBN 978-3-319-66166-7 [contents] - 2015
- Gábor Alagi, Christoph Weidenbach:
NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment. FroCos 2015: 69-84 - Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
A New Acceleration-Based Combination Framework for Array Properties. FroCos 2015: 169-185 - Franz Baader, Gerhard Brewka, Oliver Fernandez Gil:
Adding Threshold Concepts to the Description Logic EL. FroCos 2015: 33-48 - Peter Backeman, Philipp Rümmer:
Free Variables and Theories: Revisiting Rigid E-unification. FroCos 2015: 3-13 - Stephan Böhme, Marcel Lippmann:
Decidable Description Logics of Context with Rigid Roles. FroCos 2015: 17-32 - Stefan Borgwardt, Rafael Peñaloza:
Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics. FroCos 2015: 49-65 - Guillaume Burel, Gilles Dowek, Ying Jiang:
A Completion Method to Decide Reachability in Rewrite Systems. FroCos 2015: 205-219 - Paula Daniela Chocron, Pascal Fontaine, Christophe Ringeissen:
A Rewriting Approach to the Combination of Data Structures with Bridging Theories. FroCos 2015: 275-290 - Jürgen Christ, Jochen Hoenicke:
Weakly Equivalent Arrays. FroCos 2015: 119-134 - Werner Damm, Matthias Horbach, Viorica Sofronie-Stokkermans:
Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata. FroCos 2015: 186-202 - Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Unification and Matching in Hierarchical Combinations of Syntactic Theories. FroCos 2015: 291-306 - Michael Färber, Cezary Kaliszyk:
Random Forests for Premise Selection. FroCos 2015: 325-340 - Maximilian Jaroschek, Pablo Federico Dobal, Pascal Fontaine:
Adapting Real Quantifier Elimination Methods for Conflict Set Computation. FroCos 2015: 151-166 - Cezary Kaliszyk, Josef Urban, Jirí Vyskocil:
Lemmatization for Stronger Reasoning in Large Theories. FroCos 2015: 341-356 - Tianyi Liang, Nestan Tsiskaridze, Andrew Reynolds, Cesare Tinelli, Clark W. Barrett:
A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings. FroCos 2015: 135-150 - Tobias Philipp:
An Expressive Model for Instance Decomposition Based Parallel SAT Solvers. FroCos 2015: 101-116 - Damien Rouhling, Mahfuza Farooque, Stéphane Graham-Lengrand, Assia Mahboubi, Jean-Marc Notin:
Axiomatic Constraint Systems for Proof Search Modulo Theories. FroCos 2015: 220-236
