TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (Q1332639): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4951952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3954845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: N-Prolog: An extension of Prolog with hypothetical implications. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Format for the Model Elimination Theorem-Proving Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Horn prolog and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified problem reduction format / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Horn clause logic programming without contrapositives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequent-style model elimination strategy and a positive refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of three PROLOG extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786473 / rank
 
Normal rank

Revision as of 17:36, 22 May 2024

scientific article
Language Label Description Also known as
English
TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic
scientific article

    Statements

    TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (English)
    0 references
    0 references
    0 references
    12 January 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    classical logics
    0 references
    many-valued logics
    0 references
    theorem proving
    0 references
    logic programming
    0 references
    non Horn reasoning with case analysis
    0 references
    model elimination
    0 references
    tableau
    0 references
    three- valued logic L3
    0 references
    four-valued logic L4
    0 references