default search action
9th PAAR / 9th SC² 2024: Nancy, France
- Christopher W. Brown, Daniela Kaufmann, Cláudia Nalon, Alexander Steen, Martin Suda:
Joint Proceedings of the 9th Workshop on Practical Aspects of Automated Reasoning (PAAR) and the 9th Satisfiability Checking and Symbolic Computation Workshop (SC-Square), 2024 co-located with the 12th International Joint Conference on Automated Reasoning (IJCAR 2024), Nancy, France, July 2, 2024. CEUR Workshop Proceedings 3717, CEUR-WS.org 2024
Workshop on Practical Aspects of Automated Reasoning 2024
- Bruno Andreotti, Haniel Barbosa, Oliver Flatt:
Towards Producing Shorter Congruence Closure Proofs in a State-of-the-art SMT Solver (Extended Abstract). 1-9 - Guy Axelrod, Willem Conradie:
Prefixed Tableaux and Decision Procedures for Many-Valued Modal Logics. 10-27 - Filip Bártek, Karel Chvalovský, Martin Suda:
Cautious Specialization of Strategy Schedules (Extended Abstract). 28-36 - Julie Cailler, Simon Guilloud:
SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus. 37-56 - Adam Dingle:
A Natural-Language Proof Assistant for Higher-Order Logic (Work in Progress). 57-73 - Alexander Steen, Geoff Sutcliffe:
TPTP World Infrastructure for Non-classical Logics. 74-90
Satisfiability Checking and Symbolic Computation Workshop 2024
- Nahiyan Alamgir, Saeed Nejati, Curtis Bright:
SHA-256 Collision Attack with Programmatic SAT. 91-110 - Chad E. Brown, Mikolas Janota, Mirek Olsák:
Symbolic Computation for All the Fun. 111-121 - Zoltán Kovács, Reinhard Oldenburg:
A Technological Approach to Teaching Inequalities, Propositional and Predicate Logic. 122-131 - Valentin Promies, Jasper Nalbach, Erika Ábrahám:
Under-Approximation of a Single Algebraic Cell (Extended Abstract). 132-136
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.