Pages that link to "Item:Q4593042"
From MaRDI portal
The following pages link to The power of non-ground rules in Answer Set Programming (Q4593042):
Displaying 13 items.
- Lpopt: a rule optimization tool for answer set programming (Q2409731) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates (Q4589242) (← links)
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) (Q4593048) (← links)
- Optimizing Answer Set Computation via Heuristic-Based Decomposition (Q4957190) (← links)
- Solving Advanced Argumentation Problems with Answer Set Programming (Q4957200) (← links)
- selp: <i>A Single-Shot Epistemic Logic Program Solver</i> (Q4957201) (← links)
- (Q5020987) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424868) (← links)
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case (Q5504682) (← links)
- Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach (Q5870535) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)
- Reasoning on with Defeasibility in ASP (Q6063881) (← links)