Easychair
From MaRDI portal
Cited in
(only showing first 100 items - show all)- ACIDE
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus
- Process algebra and model checking
- Fast and slow enigmas and parental guidance
- Vampire with a brain is a good ITP hammer
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
- HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems
- Scalable fine-grained proofs for formula processing
- The CADE-26 automated theorem proving system competition -- CASC-26
- On the decision problem for MELL
- Novel techniques to speed up the computation of the automorphism group of a graph
- Fuzzy intensional semantics
- Deciding Structural Liveness of Petri Nets
- Computer says no: verdict explainability for runtime monitors using a local proof system
- Counting with probabilistic and ultrametric finite automata
- Verification of Flat FIFO Systems
- EUCLID
- Extensional higher-order paramodulation in Leo-III
- Reducing complex CSP models to traces via priority
- LPAR-21. 21st international conference on logic for programming, artificial intelligence and reasoning, Maun, Botswana, May 8--12, 2017. Selected papers
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- Performance of clause selection heuristics for saturation-based theorem proving
- Breaking symmetries in graph search with canonizing sets
- Context-free commutative grammars with integer counters and resets
- Layered clause selection for theory reasoning (short paper)
- Internal guidance for Satallax
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
- Eliminating models during model elimination
- Learning theorem proving components
- Building strategies into QBF proofs
- ENIGMA: efficient learning-based inference guiding machine
- Complexity and resource bound analysis of imperative programs using difference constraints
- Set-theoretic analysis of nominative data
- VAMPIRE
- E-SETHEO
- ML4PG
- HipSpec
- StarExec
- iProver
- PARTHEO
- BWare
- Imogen
- FDR3
- ModLeanTAP
- FOCI
- HotCRP
- HOT
- LeoPARD
- Websubrev
- Saucy
- E-MaLeS
- randoCoP
- BliStr
- FAST
- FALCON
- Cyclist
- BliStrTune
- OpenSMT2
- GPUexplore
- InKa
- HYST
- Spacer
- SPHIN
- A3PAT
- Logic Theorist
- ALGOL 60
- Saturate
- Model Predictive Control Toolbox
- Tarski
- Seq2Seq
- conauto
- ATPboost
- AVATAR
- Quantor
- MadMax
- Psyche
- Twee
- VerifyThis
- FLOTTER
- AGES
- HR-SQL
- GKC
- DLPEQ
- lpeq
- VERIFAI
- SFADiff
- ast2vec
- Imandra
- sKizzo
- DL2
- The invariance problem for matrix semigroups
- Inductive benchmarks for automated reasoning
- Hierarchical invention of theorem proving strategies
- Craig interpolation with clausal first-order tableaux
- Covered clauses are not propagation redundant
- GANAK
- Lash
- QMaxSATpb
- The CADE-28 Automated Theorem Proving System Competition – CASC-28
This page was built for software: Easychair
