Ultimate well-founded and stable semantics for logic programs with aggregates
From MaRDI portal
Recommendations
- Well-founded and stable semantics of logic programs with aggregates
- Reconciling well-founded semantics of DL-programs and aggregate programs
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Logic Programming and Nonmonotonic Reasoning
- scientific article; zbMATH DE number 5996835
Cited in
(15)- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- FLP answer set semantics without circular justifications for general logic programs
- Polynomial approximation to well-founded semantics for logic programs with generalized atoms: case studies
- From fuzzy to annotated semantic web languages
- scientific article; zbMATH DE number 5996835 (Why is no real title available?)
- Well-founded and stable semantics of logic programs with aggregates
- “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
- ASP-Core-2 input language format
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Reconciling well-founded semantics of DL-programs and aggregate programs
- Logic Programming and Nonmonotonic Reasoning
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- A top-\(k\) query answering procedure for fuzzy logic programming
- Aggregate semantics for propositional answer set programs
- Logic programs with abstract constraint atoms: the role of computations
This page was built for publication: Ultimate well-founded and stable semantics for logic programs with aggregates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736514)