Pages that link to "Item:Q2900518"
From MaRDI portal
The following pages link to Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs (Q2900518):
Displaying 16 items.
- An analysis of the equational properties of the well-founded fixed point (Q347388) (← links)
- Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
- Grounded fixpoints and their applications in knowledge representation (Q892232) (← links)
- Fixpoint semantics for active integrity constraints (Q1693567) (← links)
- Equivalence between answer-set programs under (partially) fixed input (Q1783736) (← links)
- Fixed point semantics for stream reasoning (Q2046012) (← links)
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus (Q2628297) (← links)
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning (Q2734934) (← links)
- Equivalence Between Answer-Set Programs Under (Partially) Fixed Input (Q2807074) (← links)
- (Q3153396) (← links)
- Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (Q4559803) (← links)
- The intricacies of three-valued extensional semantics for higher-order logic programs (Q4592720) (← links)
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory (Q5038459) (← links)
- On Dual Programs in Co-Logic Programming (Q5743583) (← links)
- Categorical approximation fixpoint theory (Q6545560) (← links)
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming (Q6566627) (← links)
