Easychair
From MaRDI portal
Software:25180
No author found.
Related Items (49)
An Automation-Friendly Set Theory for the B Method ⋮ ENIGMA: efficient learning-based inference guiding machine ⋮ Heterogeneous heuristic optimisation and scheduling for first-order theorem proving ⋮ Inductive benchmarks for automated reasoning ⋮ 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 ⋮ Preprocessing for DQBF ⋮ Process Algebra and Model Checking ⋮ Eliminating models during model elimination ⋮ Learning theorem proving components ⋮ Uniform interpolation from cyclic proofs: the case of modal mu-calculus ⋮ Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques ⋮ Context-free commutative grammars with integer counters and resets ⋮ Set-theoretic analysis of nominative data ⋮ The CADE-28 Automated Theorem Proving System Competition – CASC-28 ⋮ Complexity and resource bound analysis of imperative programs using difference constraints ⋮ Breaking symmetries in graph search with canonizing sets ⋮ Hammer for Coq: automation for dependent type theory ⋮ Craig interpolation with clausal first-order tableaux ⋮ Extensional higher-order paramodulation in Leo-III ⋮ Counting with Probabilistic and Ultrametric Finite Automata ⋮ Unnamed Item ⋮ Deciding Structural Liveness of Petri Nets ⋮ Unnamed Item ⋮ Assigning papers to referees ⋮ On the decision problem for MELL ⋮ Verification of Flat FIFO Systems ⋮ The CADE-26 automated theorem proving system competition – CASC-26 ⋮ Hierarchical invention of theorem proving strategies ⋮ Counterexample-Guided Model Synthesis ⋮ Reducing complex CSP models to traces via priority ⋮ Fuzzy intensional semantics ⋮ Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components ⋮ Computer says no: verdict explainability for runtime monitors using a local proof system ⋮ Building strategies into QBF proofs ⋮ Unnamed Item ⋮ The Invariance Problem for Matrix Semigroups ⋮ Scalable fine-grained proofs for formula processing ⋮ Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving ⋮ Internal Guidance for Satallax ⋮ Predicate Elimination for Preprocessing in First-Order Theorem Proving ⋮ 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 ⋮ A logic-based approach to incremental reasoning on multi-agent systems ⋮ Novel techniques to speed up the computation of the automorphism group of a graph ⋮ 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)
This page was built for software: Easychair
