Equivalence of two fixed-point semantics for definitional higher-order logic programs

zbMATH Open1476.68142MaRDI QIDQ5014440FDOQ5014440

Authors: Angelos Charalambidis, Panos Rondogiannis, Ioanna Symeonidou 

Publication date: 2 December 2021

Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?FICS2015.4

Recommendations

• Equivalence of two fixed-point semantics for definitional higher-order logic programs
• Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
• scientific article; zbMATH DE number 1841821

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cites Work

• Programming with higher-order logic.
• Title not available (Why is that?)
• Minimum model semantics for extensional higher-order logic programming with negation
• HiLog: A foundation for higher-order logic programming
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Equivalence of two formal semantics for functional logic programs
• Equivalence of two fixed-point semantics for definitional higher-order logic programs

Uses Software

• HiLog

This page was built for publication: Equivalence of two fixed-point semantics for definitional higher-order logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014440)