The following pages link to (Q2734934):
Displayed 17 items.
- An analysis of the equational properties of the well-founded fixed point (Q347388) (← links)
- Approximating operators and semantics for abstract dialectical frameworks (Q490444) (← links)
- Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
- Grounded fixpoints and their applications in knowledge representation (Q892232) (← links)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
- An encompassing framework for paraconsistent logic programs (Q1775864) (← links)
- Uniform semantic treatment of default and autoepistemic logics (Q1853682) (← links)
- Logic programs and connectionist networks (Q1884268) (← links)
- A fixed point theorem for non-monotonic functions (Q2257304) (← links)
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach (Q2642629) (← links)
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs (Q2900518) (← links)
- Connecting First-Order ASP and the Logic FO(ID) through Reducts (Q2900547) (← links)
- Equational Properties of Stratified Least Fixed Points (Extended Abstract) (Q2947468) (← links)
- From Fuzzy to Annotated Semantic Web Languages (Q2970305) (← links)
- A Formal Theory of Justifications (Q3449209) (← links)
- Stability, Supportedness, Minimality and Kleene Answer Set Programs (Q5172611) (← links)