Flexible Approximators for Approximating Fixpoint Theory
From MaRDI portal
Publication:2814522
DOI10.1007/978-3-319-34111-8_28zbMath1355.68244OpenAlexW2465441781MaRDI QIDQ2814522
Fang-Fang Liu, Yi Bi, M.D. Solimul Chowdhury, Jia-Huai You, Zhi-Yong Feng
Publication date: 22 June 2016
Published in: Advances in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-34111-8_28
Related Items (1)
Cites Work
- Approximating operators and semantics for abstract dialectical frameworks
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- FO(ID) as an extension of DL with rules
- Local closed world reasoning with description logics under the well-founded semantics
- Grounded fixpoints and their applications in knowledge representation
- Uniform semantic treatment of default and autoepistemic logics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Combining answer set programming with description logics for the semantic web
- A lattice-theoretical fixpoint theorem and its applications
- Hex Semantics via Approximation Fixpoint Theory
- Well-founded semantics for description logic programs in the semantic web
- Well-founded and stable semantics of logic programs with aggregates
- Reconciling description logics and rules
- The well-founded semantics for general logic programs
This page was built for publication: Flexible Approximators for Approximating Fixpoint Theory