Pages that link to "Item:Q5404394"
From MaRDI portal
The following pages link to Efficient HEX-Program Evaluation Based on Unfounded Sets (Q5404394):
Displaying 11 items.
- Domain expansion for ASP-programs with external sources (Q254002) (← links)
- Data repair of inconsistent nonmonotonic description logic programs (Q322065) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- Exploiting Unfounded Sets for HEX-Program Evaluation (Q2915067) (← links)
- Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations (Q2938489) (← links)
- Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997) (← links)
- Complexity and compilation of GZ-aggregates in answer set programming (Q4592998) (← links)
- A model building framework for answer set programming with external computations (Q4593036) (← links)
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description) (Q4593064) (← links)
- Inlining External Sources in Answer Set Programs (Q4957183) (← links)
- Hybrid planning for challenging construction problems: an answer set programming approach (Q6161492) (← links)
