First-order stable model semantics and first-order loop formulas

MaRDI QIDQ3112629zbMATH OpenFDO

Authors Joohyung Lee, Yunsong Meng

Publication date 12 January 2012

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

zbMATH Keywords

disjunctive programfirst-order theorylogic programloop formulasstable model semantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• A generalization of the Lin-Zhao theorem
• Logic Programming
• Stable models and circumscription
• Argumentation-based semantics for logic programs with first-order formulae
• Why are there so many loop formulas?

Cited in

(9)

• A progression semantics for first-order logic programs
• First-order abduction as enumeration of stable models
• Integrating rules and ontologies in the first-order stable model semantics (preliminary report)
• Continuous first order logic and local stability
• Ordered completion for first-order logic programs on finite structures
• Expressiveness of logic programs under the general stable model semantics
• Stable models and circumscription
• Loop-separable programs and their first-order definability
• Extended RDF: computability and complexity issues

This page was built for publication: First-order stable model semantics and first-order loop formulas

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