The 11th IJCAR automated theorem proving system competition – CASC-J11
From MaRDI portal
(Redirected from Publication:6095787)
The 11th IJCAR automated theorem proving system competition – CASC-J11
The 11th IJCAR automated theorem proving system competition – CASC-J11
Recommendations
- The 10th IJCAR automated theorem proving system competition -- CASC-J10
- The 8th IJCAR automated theorem proving system competition -- CASC-J8
- The 7th IJCAR automated theorem proving system competition -- CASC-J7
- The 9th IJCAR automated theorem proving system competition -- CASC-J9
- scientific article; zbMATH DE number 5305114
Cites work
- \textsf{Goéland}: a concurrent tableau-based theorem prover (system description)
- A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
- AC simplifications and closure redundancies in the superposition calculus
- An abstraction-refinement framework for reasoning with large theories
- ATP-based cross-verification of Mizar proofs: method, systems, and first experiments
- Automated reasoning service for HOL Light
- Beagle -- a hierarchic superposition theorem prover
- Controlling a solver execution with the runsolver Tool
- Detecting inconsistencies in large first-order knowledge bases
- Detecting Unknots via Equational Reasoning, I: Exploration
- Efficient encodings of first-order Horn formulas in equational logic
- Evaluating general purpose automated theorem proving systems
- Faster, higher, stronger: E 2.3
- Generalized MV-algebras
- Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
- Ground joinability and connectedness in the superposition calculus
- GRUNGE: a grand unified ATP challenge
- Handbook of automated reasoning. In 2 vols
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
- Implementing Superposition in iProver (System Description)
- Inst-Gen -- a modular approach to instantiation-based automated reasoning
- iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
- Lash 1.0 (system description)
- Layered clause selection for theory reasoning (short paper)
- Making higher-order superposition work
- Making theory reasoning simpler
- Nitpick: a counterexample generator for higher-order logic based on a relational model finder
- Playing with AVATAR
- Relational lattices: from databases to universal algebra
- Satallax: An Automatic Higher-Order Prover
- Superposition for full higher-order logic
- Superposition with lambdas
- The CADE-16 ATP system competition
- The CADE-28 Automated Theorem Proving System Competition – CASC-28
- The logic languages of the TPTP world
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- Theory and Applications of Satisfiability Testing
- Vampire getting noisy: Will random bits help conquer chaos? (system description)
Cited in
(6)- scientific article; zbMATH DE number 5305114 (Why is no real title available?)
- Range-restricted and Horn interpolation through clausal tableaux
- Graph sequence learning for premise selection
- Duper: a proof-producing superposition theorem prover for dependent type theory
- Model construction for modal clauses
- An empirical assessment of progress in automated theorem proving
This page was built for publication: The 11th IJCAR automated theorem proving system competition – CASC-J11
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6095787)
