The following pages link to (Q4327612):
Displaying 20 items.
- Reasoning with infinite stable models (Q814596) (← links)
- Equilibrium logic (Q854969) (← links)
- Semantic-based construction of arguments: an answer set programming approach (Q899190) (← links)
- Constraint-based correctness proofs for logic program transformations (Q1941873) (← links)
- Ensuring reference independence and cautious monotony in abstract argumentation (Q2069060) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Partial equilibrium logic (Q2457796) (← links)
- A Selective Semantics for Logic Programs with Preferences (Q2915073) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- RASP and ASP as a fragment of linear logic (Q4583307) (← links)
- Query answering in resource-based answer set semantics (Q4593046) (← links)
- Characterizations of the stable semantics by partial evaluation (Q5101443) (← links)
- Computing the well-founded semantics faster (Q5101445) (← links)
- Strong and explicit negation in non-monotonic reasoning and logic programming (Q5236430) (← links)
- Characterizing D-WFS: Confluence and iterated GCWA (Q5236439) (← links)
- Collaborative vs. Conflicting Learning, Evolution and Argumentation (Q5302474) (← links)
- A general theory of confluent rewriting systems for logic programming and its applications (Q5935989) (← links)
- Prolegomena to logic programming for non-monotonic reasoning (Q6623791) (← links)
- On logics and semantics for general logic programs (Q6623792) (← links)
- Aggregation and well-founded semantics\textsuperscript{+} (Q6623794) (← links)
