Pages that link to "Item:Q4452640"
From MaRDI portal
The following pages link to Transformation-based bottom-up computation of the well-founded model (Q4452640):
Displayed 13 items.
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms (Q703484) (← links)
- Semantic-based construction of arguments: an answer set programming approach (Q899190) (← links)
- On the equivalence and range of applicability of graph-based representations of logic programs. (Q1853147) (← links)
- Relating defeasible and normal logic programming through transformation properties. (Q1853599) (← links)
- Dealing with explicit preferences and uncertainty in answer set programming (Q1928820) (← links)
- Efficient Computation of the Well-Founded Semantics over Big Data (Q2931253) (← links)
- A Framework for Goal-Directed Query Evaluation with Negation (Q3449200) (← links)
- Justifications for logic programs under answer set semantics (Q3612602) (← links)
- Preface (Q4593090) (← links)
- (Q5020560) (← links)
- About Epistemic Negation and World Views in Epistemic Logic Programs (Q5108503) (← links)
- Approximating agreements in formal argumentation dialogues1 (Q5145459) (← links)
- A general theory of confluent rewriting systems for logic programming and its applications (Q5935989) (← links)