Pages that link to "Item:Q4559803"
From MaRDI portal
The following pages link to Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (Q4559803):
Displaying 16 items.
- Equivalence of two fixed-point semantics for definitional higher-order logic programs (Q512650) (← links)
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
- Fixpoint semantics for logic programming a survey (Q1605173) (← links)
- (Q2767052) (← 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)
- (Q3153396) (← links)
- (Q3983046) (← links)
- An effective fixpoint semantics for linear logic programs (Q4452612) (← links)
- A Step Up in Expressiveness of Decidable Fixpoint Logics (Q4635946) (← links)
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory (Q5038459) (← links)
- The Expressive Power of Higher-Order Datalog (Q5108510) (← 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)
