| Efficient Automated Reasoning About Sets and Multisets with Cardinality Constraints
|
2020 |
Piskac, Ruzica |
| The Resolution of Keller’s Conjecture
|
2020 |
Brakensiek, Joshua |
| Solving Bitvectors with MCSAT: Explanations from Bits and Pieces
|
2020 |
Graham-Lengrand, Stephane |
| Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis
|
2020 |
Reynolds, Andrew |
| Combined Covers and Beth Definability
|
2020 |
Calvanese, Diego |
| A Combinator-Based Superposition Calculus for Higher-Order Logic
|
2020 |
Bhayat, Ahmed |
| Subsumption Demodulation in First-Order Theorem Proving
|
2020 |
Gleiss, Bernhard |
| SGGS Decision Procedures
|
2020 |
Bonacina, Maria Paola |
| Integrating Induction and Coinduction via Closure Operators and Proof Cycles
|
2020 |
Cohen, Liron |
| Constructive Hybrid Games
|
2020 |
Bohrer, Brandon |
| Mechanised Modal Model Theory Yiming Xu and Michael Norrish
|
2020 |
Xu, Yiming |
| How QBF Expansion Makes Strategy Extraction Hard
|
2020 |
Chew, Leroy |
| Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates
|
2020 |
Angelis, Emanuele De |
| A Decision Procedure for String to Code Point Conversion
|
2020 |
Reynolds, Andrew |
| Possible Models Computation and Revision — A Practical Approach
|
2020 |
Baumgartner, Peter |
| A Comprehensive Framework for Saturation Theorem Proving
|
2020 |
Waldmann, Uwe |
| Description Logics with Concrete Domains and General Concept Inclusions Revisited
|
2020 |
Baader, Franz |
| Soft Subexponentials and Multiplexing
|
2020 |
Kanovich, Max |
| Covered Clauses Are Not Propagation Redundant
|
2020 |
Barnett, Lee A. |
| Monadic Decomposition in Integer Linear Arithmetic
|
2020 |
Hague, Matthew |
Tag hinzufügen