Easychair
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Goeland
- libfsmtest
- QBFFam
- GANAK
- VAMPIRE
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
- Set-theoretic analysis of nominative data
- Hammer for Coq: automation for dependent type theory
- On the decision problem for MELL
- Reducing complex CSP models to traces via priority
- ML4PG
- E-SETHEO
- Assigning papers to referees
- HipSpec
- Computer says no: verdict explainability for runtime monitors using a local proof system
- Building strategies into QBF proofs
- StarExec
- A logic-based approach to incremental reasoning on multi-agent systems
- Covered clauses are not propagation redundant
- Layered clause selection for theory reasoning (short paper)
- \textsf{Goéland}: a concurrent tableau-based theorem prover (system description)
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
- Inductive benchmarks for automated reasoning
- Eliminating models during model elimination
- Learning theorem proving components
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus
- iProver
- PARTHEO
- BWare
- HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- Imogen
- Novel techniques to speed up the computation of the automorphism group of a graph
- ENIGMA: efficient learning-based inference guiding machine
- Complexity and resource bound analysis of imperative programs using difference constraints
- Breaking symmetries in graph search with canonizing sets
- ModLeanTAP
- FDR3
- FOCI
- Websubrev
- HotCRP
- HOT
- LeoPARD
- Saucy
- Context-free commutative grammars with integer counters and resets
- Craig interpolation with clausal first-order tableaux
- Extensional higher-order paramodulation in Leo-III
- randoCoP
- E-MaLeS
- The invariance problem for matrix semigroups
- Performance of clause selection heuristics for saturation-based theorem proving
- Internal guidance for Satallax
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- BliStr
- Counting with probabilistic and ultrametric finite automata
- Deciding Structural Liveness of Petri Nets
- Cyclist
- OpenSMT2
- BliStrTune
- Spacer
- GPUexplore
- InKa
- SPHIN
- Process algebra and model checking
- HYST
- Counterexample-Guided Model Synthesis
- FAST
- Logic Theorist
- FALCON
- Saturate
- A3PAT
- ALGOL 60
- Model Predictive Control Toolbox
- Preprocessing for DQBF
- Tarski
- Seq2Seq
- conauto
- Quantor
- Psyche
- ATPboost
- MadMax
- Twee
- AVATAR
- VerifyThis
- FLOTTER
- HR-SQL
- AGES
- GKC
- VERIFAI
- lpeq
- DLPEQ
- LPAR-21. 21st international conference on logic for programming, artificial intelligence and reasoning, Maun, Botswana, May 8--12, 2017. Selected papers
- SFADiff
- Fuzzy intensional semantics
- Linking focusing and resolution with selection
- Strong typed Böhm theorem and functional completeness on the linear lambda calculus
- The CADE-28 Automated Theorem Proving System Competition – CASC-28
- The CADE-26 automated theorem proving system competition -- CASC-26
- Hierarchical invention of theorem proving strategies
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
This page was built for software: Easychair
