A relational approach to logic programming: The extended Alexander method (Q1263276): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90089-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026267935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compiling queries in recursive first-order databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Alexander Method - a technique for the processing of recursive axioms in deductive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of logical query languages for databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank

Latest revision as of 10:51, 20 June 2024

scientific article
Language Label Description Also known as
English
A relational approach to logic programming: The extended Alexander method
scientific article

    Statements

    A relational approach to logic programming: The extended Alexander method (English)
    0 references
    0 references
    1989
    0 references
    algorithm of the Alexander transformation
    0 references
    termination
    0 references
    soundness
    0 references
    completeness
    0 references
    compiling method for logic programs without negation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references