Pages that link to "Item:Q543600"
From MaRDI portal
The following pages link to Semantics and complexity of recursive aggregates in answer set programming (Q543600):
Displaying 20 items.
- On Nested Justification Systems (Q5038468) (← links)
- Enhancing Magic Sets with an Application to Ontological Reasoning (Q5108494) (← links)
- About Epistemic Negation and World Views in Epistemic Logic Programs (Q5108503) (← links)
- Inconsistency Proofs for ASP: The ASP - DRUPE Format (Q5108508) (← links)
- Relating Two Dialects of Answer Set Programming (Q5108518) (← links)
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More (Q5140003) (← links)
- Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints (Q5140015) (← links)
- ASP (): Answer Set Programming with Algebraic Constraints (Q5140023) (← links)
- Answering the “why” in answer set programming – A survey of explanation approaches (Q5197747) (← links)
- A compositional typed higher-order logic with definitions (Q5240216) (← links)
- Semantical characterizations and complexity of equivalences in answer set programming (Q5277782) (← links)
- Logic Programming (Q5313212) (← links)
- Logics in Artificial Intelligence (Q5394125) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424890) (← links)
- On the Complexity of Answer Set Programming with Aggregates (Q5425401) (← links)
- Gelfond-Zhang aggregates as propositional formulas (Q5919599) (← links)
- Hybrid planning for challenging construction problems: an answer set programming approach (Q6161492) (← links)
- Rule Induction and Reasoning over Knowledge Graphs (Q6163650) (← links)
- Aspmc: new frontiers of algebraic answer set counting (Q6566624) (← links)
- Embedding justification theory in approximation fixpoint theory (Q6566637) (← links)
