default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th FroCos 2019: London, UK
- 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
Automated Theorem Proving and Model Building
- Giles Reger
, Martin Riener, Martin Suda:
Symmetry Avoidance in MACE-Style Finite Model Finding. 3-21 - Andreas Teucke, Marco Voigt, Christoph Weidenbach:
On the Expressivity and Applicability of Model Representation Formalisms. 22-39 - Michael Rawson, Giles Reger:
A Neurally-Guided, Parallel Theorem Prover. 40-56 - Alireza Ensan, Eugenia Ternovska:
A Language-Independent Framework for Reasoning About Preferences for Declarative Problem Solving. 57-73
Combinations of Systems
- Mnacho Echenim, Nicolas Peltier, Yanis Sellami:
Ilinva: Using Abduction to Generate Loop Invariants. 77-93 - Eugenia Ternovska:
An Algebra of Modular Systems: Static and Dynamic Perspectives. 94-111 - David Fuenmayor, Christoph Benzmüller:
Mechanised Assessment of Complex Natural-Language Arguments Using Expressive Logic Combinations. 112-128
Constraint Solving
- Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller:
A CDCL-Style Calculus for Solving Non-linear Constraints. 131-148 - Hans Kleine Büning, Piotr Wojciechowski, R. Chandrasekaran, K. Subramani:
Restricted Cutting Plane Proofs in Horn Constraint Systems. 149-164
Description Logics
- Franz Baader, Andreas Ecke, Gabriele Kern-Isberner, Marco Wilhelm:
The Complexity of the Consistency Problem in the Probabilistic Description Logic 𝓐ℒ𝒞ME. 167-184 - Warren Del-Pinto, Renate A. Schmidt:
Extending Forgetting-Based Abduction Using Nominals. 185-202 - Franz Baader, Filippo De Bortoli:
On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets. 203-219
Interactive Theorem Proving
- Ralph Bottesch, Max W. Haslbeck, René Thiemann:
Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL. 223-239 - Manuel Eberl:
Verifying Randomised Social Choice. 240-256
Modal and Epistemic Logics
- Roman Kuznets, Laurent Prosperi, Ulrich Schmid, Krisztina Fruzsa:
Epistemic Reasoning with Byzantine-Faulty Agents. 259-276 - Andrzej Indrzejczak:
Two Is Enough - Bisequent Calculus for S5. 277-294
Rewriting and Unification
- Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar:
On Asymmetric Unification for the Theory of XOR with a Homomorphism. 297-312 - Dohan Kim, Christopher Lynch, Paliath Narendran:
Reviving Basic Narrowing Modulo. 313-329 - Takahito Aoto, Yoshihito Toyama:
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems. 330-347 - Carsten Fuhs:
Transforming Derivational Complexity of Term Rewriting to Runtime Complexity. 348-364
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 2025-11-06 00:08 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:
