Clause trees: A tool for understanding and implementing resolution in automated reasoning (Q1402732): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(5 intermediate revisions by 3 users not shown)
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: TPTP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: METEOR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refutations by Matings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of lemmas in the model elimination procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs of the pigeonhole formulas based on the connection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear resolution with selection function / 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: SETHEO: A high-performance theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical Theorem-Proving by Model Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension to linear resolution with selection function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dissolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Results on Ordering for Resolution with Merging and Linear Format / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding duplicate proofs with the foothold refinement / 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: A Prolog technology theorem prover: A new exposition and implementation in Prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TPTP problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994754 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0004-3702(96)00046-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970444992 / rank
 
Normal rank

Latest revision as of 09:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Clause trees: A tool for understanding and implementing resolution in automated reasoning
scientific article

    Statements

    Clause trees: A tool for understanding and implementing resolution in automated reasoning (English)
    0 references
    0 references
    0 references
    28 August 2003
    0 references
    0 references
    Automated theorem proving
    0 references
    Redundancy
    0 references
    Minimality
    0 references
    Proof procedures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references