Pages that link to "Item:Q2734934"
From MaRDI portal
The following pages link to Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning (Q2734934):
Displaying 35 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)
- A context for belief revision: forward chaining-normal nonmonotonic rule systems (Q1326782) (← links)
- Safe inductions and their applications in knowledge representation (Q1647517) (← links)
- Fixpoint semantics for active integrity constraints (Q1693567) (← 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)
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms (Q2124445) (← links)
- A fixed point theorem for non-monotonic functions (Q2257304) (← links)
- Realizability of three-valued semantics for abstract dialectical frameworks (Q2287192) (← links)
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach (Q2642629) (← links)
- Efficient Approximation of Well-Founded Justification and Well-Founded Domination (Q2851261) (← 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)
- Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (Q4559803) (← links)
- Knowledge compilation of logic programs using approximation fixpoint theory (Q4592990) (← links)
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory (Q5038459) (← links)
- Exploiting Game Theory for Analysing Justifications (Q5140022) (← links)
- Stability, Supportedness, Minimality and Kleene Answer Set Programs (Q5172611) (← links)
- A compositional typed higher-order logic with definitions (Q5240216) (← links)
- Logic Programming (Q5313184) (← links)
- Witnesses for Answer Sets of Logic Programs (Q5886522) (← links)
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT (Q6063882) (← links)
- Categorical approximation fixpoint theory (Q6545560) (← links)
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming (Q6566627) (← links)
- Embedding justification theory in approximation fixpoint theory (Q6566637) (← links)
- Fixpoint semantics for recursive \textsc{shacl} (Q6647306) (← links)
