Pages that link to "Item:Q2426101"
From MaRDI portal
The following pages link to Complexity results for answer set programming with bounded predicate arities and implications (Q2426101):
Displaying 19 items.
- Extended RDF: computability and complexity issues (Q905991) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
- Why-provenance information for RDF, rules, and negation (Q2248547) (← links)
- Complexity results for probabilistic answer set programming (Q2302961) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- Inconsistency Management for Traffic Regulations: Formalization and Complexity Results (Q2915061) (← links)
- Linking Open-World Knowledge Bases Using Nonmonotonic Rules (Q3449214) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- The power of non-ground rules in Answer Set Programming (Q4593042) (← links)
- Solving Advanced Argumentation Problems with Answer Set Programming (Q4957200) (← links)
- selp: <i>A Single-Shot Epistemic Logic Program Solver</i> (Q4957201) (← links)
- (Q5020542) (← links)
- (Q5020550) (← links)
- Reasoning with Forest Logic Programs and f-hybrid knowledge bases (Q5298799) (← links)
- (Q5856406) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)
- Signed dual tableaux for Kleene answer set programs (Q6599615) (← links)
