Stable models of formulas with generalized quantifiers (preliminary report)

DOI10.4230/LIPICS.ICLP.2012.61MaRDI QIDQ5398043zbMATH OpenFDO

Authors Joohyung Lee, Yunsong Meng

Publication date 25 February 2014

Full work available at URL https://doi.org/10.4230/LIPICS.ICLP.2012.61

zbMATH Keywords

answer set programminggeneralized quantifiersstable model semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Supportedly stable answer sets for logic programs with generalized atoms
• Stable models for infinitary formulas with extensional atoms
• On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
• Chain answer sets for logic programs with generalized atoms
• On Reductive Semantics of Aggregates in Answer Set Programming

Cited in

(6)

• Chain answer sets for logic programs with generalized atoms
• On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
• Integrating rules and ontologies in the first-order stable model semantics (preliminary report)
• On equivalence of infinitary formulas under the stable model semantics
• Stable models for infinitary formulas with extensional atoms
• Safe Formulas in the General Theory of Stable Models (Preliminary Report)

This page was built for publication: Stable models of formulas with generalized quantifiers (preliminary report)

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