Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (Q4559803): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5287508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensional Higher-Order Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of two fixed-point semantics for definitional higher-order logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimate approximation and its application in nonmonotonic knowledge representation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed point theorem for non-monotonic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixpoint semantics for logic programming a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intricacies of three-valued extensional semantics for higher-order logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank

Revision as of 14:29, 17 July 2024

scientific article; zbMATH DE number 6988653
Language Label Description Also known as
English
Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
scientific article; zbMATH DE number 6988653

    Statements

    Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2018
    0 references
    0 references
    higher-order logic programming
    0 references
    negation in logic programming
    0 references
    approximation fixpoint theory
    0 references
    0 references