Equilibrium semantics and strong equivalence for higher-order logic programs

DOI10.1017/S147106842610057XMaRDI QIDQ7406149zbMATH OpenFDO

Authors Angelos Charalambidis, Giannos Chatziagapis, Babis Kostopoulos, Panos Rondogiannis

Publication date 2026

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S147106842610057X

zbMATH Keywords

answer set programminghigher-order logic programmingstrong equivalence

Mathematics Subject Classification ID

Logic programming (68N17)

Cites work

• A Characterization of Strong Equivalence for Logic Programs with Variables
• A new logical characterisation of stable models and answer sets
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Beyond NP: quantifying over answer sets
• From here to there: Stable negation in logic programming
• Fully abstract models of typed \(\lambda\)-calculi
• GO Is Polynomial-Space Hard
• scientific article; zbMATH DE number 400814 (Why is no real title available?)
• Metric temporal equilibrium logic over timed traces
• Planning with Incomplete Information in Quantified Answer Set Programming
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Stable-unstable semantics: Beyond NP with normal logic programs
• Strongly equivalent logic programs
• Ultimate approximation and its application in nonmonotonic knowledge representation systems

This page was built for publication: Equilibrium semantics and strong equivalence for higher-order logic programs

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