Embedding Boolean expressions into logic programming (Q1100935): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3919057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in abelian semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refutational theorem proving using term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678447 / 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: Q4083731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unification Algorithm for Associative-Commutative Functions / rank
 
Normal rank

Latest revision as of 15:42, 18 June 2024

scientific article
Language Label Description Also known as
English
Embedding Boolean expressions into logic programming
scientific article

    Statements

    Embedding Boolean expressions into logic programming (English)
    0 references
    0 references
    0 references
    1987
    0 references
    unification theory
    0 references
    Boolean expressions
    0 references
    most general unifier
    0 references
    logic programming
    0 references
    PROLOG
    0 references

    Identifiers