On Signings and the Well-Founded Semantics

DOI10.1017/s1471068421000077zbMath1530.68057arXiv2102.06495OpenAlexW3132839588MaRDI QIDQ6063875

Michael J. Maher

Publication date: 12 December 2023

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

Full work available at URL: https://arxiv.org/abs/2102.06495

zbMATH Keywords

well-founded semanticsquery optimizationsigning

Mathematics Subject Classification ID

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

Cites Work

• Strict completion of logic programs
• On the relations between stable and well-founded semantics of logic programs
• An extension of Van Gelder's alternating fixpoint to magic programs
• A kripke-kleene semantics for logic programs*
• The well-founded semantics for general logic programs
• Logic programming and negation: A survey
• Transformation-based bottom-up computation of the well-founded model
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• Rethinking Defeasible Reasoning: A Scalable Approach
• Computing the well-founded semantics faster
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Signings and the Well-Founded Semantics