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

MaRDI QIDQ5014440zbMATH OpenFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 1841821 (Why is no real title available?)
• HiLog: A foundation for higher-order logic programming
• Minimum model semantics for extensional higher-order logic programming with negation
• Programming with higher-order logic.

Cited in

(4)

• scientific article; zbMATH DE number 5677418 (Why is no real title available?)
• scientific article; zbMATH DE number 7023675 (Why is no real title available?)
• Equivalence of two formal semantics for functional logic programs
• Equivalence of two fixed-point semantics for definitional higher-order logic programs

Describes a project that uses

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)