default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th FroCos 2017: Brasília, Brazil
- 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
Invited Talks
- 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. 3-21 - Andrew Reynolds, Cesare Tinelli, Dejan Jovanovic, Clark W. Barrett:
Designing Theory Solvers with Extensions. 22-40
Description and Temporal Logics
- Franz Baader:
A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors. 43-59 - Franz Baader, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki, Veronika Thost:
Metric Temporal Description Logics with Interval-Rigid Names. 60-76 - Franz Baader, Patrick Koopmann, Anni-Yasmin Turhan:
Using Ontologies to Query Probabilistic Numerical Data. 77-94 - Jelena Vlasenko, Volker Haarslev, Brigitte Jaumard:
Pushing the Boundaries of Reasoning About Qualified Cardinality Restrictions. 95-112
Rewriting
- Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems. 115-131 - Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl:
Complexity Analysis for Term Rewriting by Integer Transition Systems. 132-150
SAT, SMT and Automated Theorem Proving
- 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. 153-171 - Simon Cruanes:
Superposition with Structural Induction. 172-188 - Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan-Tung Vu:
Subtropical Satisfiability. 189-206
Decision Procedures, Decidability and Verification
- Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho:
On Solving Nominal Fixpoint Equations. 209-226 - Jens Claßen, Benjamin Zarrieß:
Decidable Verification of Decision-Theoretic Golog. 227-243 - Marco Voigt:
The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable. 244-261
Properties and Combinations of Logic
- Matthias Baaz, Anela Lolic:
First-Order Interpolation of Non-classical Logics Derived from Propositional Interpolation. 265-280 - Philippe Balbiani, Çigdem Gencer:
Finitariness of Elementary Unification in Boolean Region Connection Calculus. 281-297 - Carlos Caleiro, Sérgio Marcelino, João Marcos:
Merging Fragments of Classical Logic. 298-315 - Silvio Ghilardi, Alessandro Gianola:
Interpolation, Amalgamation and Combination (The Non-disjoint Signatures Case). 316-332 - Christoph Wernhard:
The Boolean Solution Problem from the Perspective of Predicate Logic. 333-350
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-23 00:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
