The following pages link to Easychair (Q25180):
Displaying 49 items.
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (Q518409) (← links)
- Fast and slow enigmas and parental guidance (Q831937) (← links)
- Vampire with a brain is a good ITP hammer (Q831938) (← links)
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (Q1640636) (← links)
- Set-theoretic analysis of nominative data (Q1650337) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- On the decision problem for MELL (Q1733062) (← links)
- Reducing complex CSP models to traces via priority (Q1744391) (← links)
- Assigning papers to referees (Q1959732) (← links)
- Computer says no: verdict explainability for runtime monitors using a local proof system (Q1996872) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- Covered clauses are not propagation redundant (Q2096437) (← links)
- Layered clause selection for theory reasoning (short paper) (Q2096461) (← links)
- \textsf{Goéland}: a concurrent tableau-based theorem prover (system description) (Q2104525) (← links)
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving (Q2128804) (← links)
- Inductive benchmarks for automated reasoning (Q2128807) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- Learning theorem proving components (Q2142080) (← links)
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus (Q2142087) (← links)
- HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems (Q2304532) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- Novel techniques to speed up the computation of the automorphism group of a graph (Q2336847) (← links)
- ENIGMA: efficient learning-based inference guiding machine (Q2364687) (← links)
- Complexity and resource bound analysis of imperative programs using difference constraints (Q2398171) (← links)
- Breaking symmetries in graph search with canonizing sets (Q2398437) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Craig interpolation with clausal first-order tableaux (Q2666953) (← links)
- Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
- The Invariance Problem for Matrix Semigroups (Q2811359) (← links)
- Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving (Q2817933) (← links)
- Internal Guidance for Satallax (Q2817934) (← links)
- Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
- Counting with Probabilistic and Ultrametric Finite Automata (Q2944874) (← links)
- Deciding Structural Liveness of Petri Nets (Q2971127) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- Counterexample-Guided Model Synthesis (Q3303898) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- (Q4586077) (← links)
- Fuzzy intensional semantics (Q4646654) (← links)
- Linking focusing and resolution with selection (Q5005105) (← links)
- (Q5013825) (← links)
- The CADE-28 Automated Theorem Proving System Competition – CASC-28 (Q5069650) (← links)
- The CADE-26 automated theorem proving system competition – CASC-26 (Q5145427) (← links)
- Hierarchical invention of theorem proving strategies (Q5145434) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
- An Automation-Friendly Set Theory for the B Method (Q5881455) (← links)
- Scalable fine-grained proofs for formula processing (Q5919479) (← links)
