leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) (Q3541708): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TPTP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ileanCoP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SETHEO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JProver / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-71070-7_23 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1846589774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LeanT A P: Lean tableau-based theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matings in matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: KoMeT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SETHEO: A high-performance theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlled integration of the cut rule into connection tableau calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical Theorem-Proving by Model Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: ileanTAP: An intuitionistic theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning with Analytic Tableaux and Related Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricting backtracking in connection calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: IeanCOP: lean connection-based theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: T-string unification: Unifying prefixes in non-classical proof methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ILTP problem library for intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Intuitionistic Predicate Logic Theorem Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Prolog technology theorem prover: Implementation by an extended Prolog compiler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TPTP problem library. CNF release v1. 2. 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MPTP 0.2: Design, implementation, and initial experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A resolution theorem prover for intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999539 / rank
 
Normal rank

Latest revision as of 20:26, 28 June 2024

scientific article
Language Label Description Also known as
English
leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
scientific article

    Statements

    leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) (English)
    0 references
    0 references
    27 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers