Pages that link to "Item:Q4593088"
From MaRDI portal
The following pages link to <tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing (Q4593088):
Displayed 12 items.
- Optimizing Answer Set Computation via Heuristic-Based Decomposition (Q4957190) (← links)
- The Seventh Answer Set Programming Competition: Design and Results (Q4957192) (← links)
- Efficiently Coupling the I-DLV Grounder with ASP Solvers (Q4957193) (← links)
- (Q5020542) (← links)
- Partial Compilation of ASP Programs (Q5108506) (← links)
- Incremental Answer Set Programming with Overgrounding (Q5108513) (← links)
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More (Q5140003) (← links)
- Incremental maintenance of overgrounded logic programs with tailored simplifications (Q5140010) (← links)
- Answering the “why” in answer set programming – A survey of explanation approaches (Q5197747) (← links)
- (Q5240210) (← links)
- $$\exists $$ -ASP for Computing Repairs with Existential Ontologies (Q5268421) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)