Definite clause programs are canonical (over a suitable domain) (Q1356204): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3960112 / 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: The recursion-theoretic complexity of the semantics of predicate logic as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closures and fairness in the semantics of programming logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / 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: Q5537599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computable semantics for general logic programs / rank
 
Normal rank

Latest revision as of 14:05, 27 May 2024

scientific article
Language Label Description Also known as
English
Definite clause programs are canonical (over a suitable domain)
scientific article

    Statements