Computing finite models by reduction to function-free clause logic (Q1006733): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4249897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lemma Learning in the Model Evolution Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing answers with model elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and Other Enhancements for Bottom-Up Model Generation Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Theorems with the Modification Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Resolution: A Proof Procedure Based on Finite Model Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Powerful Technique to Eliminate Isomorphism in Finite Model Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof and Model Generation with Disconnection Tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / 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: Q5486135 / rank
 
Normal rank

Latest revision as of 05:17, 29 June 2024

scientific article
Language Label Description Also known as
English
Computing finite models by reduction to function-free clause logic
scientific article

    Statements

    Computing finite models by reduction to function-free clause logic (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2009
    0 references
    0 references
    automated theorem proving
    0 references
    model building
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references