Pages that link to "Item:Q286399"
From MaRDI portal
The following pages link to Evaluating epistemic negation in answer set programming (Q286399):
Displaying 16 items.
- Autoepistemic answer set programming (Q2046018) (← links)
- Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic (Q2119125) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- Autoepistemic equilibrium logic and epistemic specifications (Q2307335) (← links)
- A parallel memory-efficient epistemic logic program solver: harder, better, faster (Q2317970) (← links)
- Epistemic logic programs: a study of some properties (Q2694560) (← links)
- selp: <i>A Single-Shot Epistemic Logic Program Solver</i> (Q4957201) (← links)
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Q5019599) (← links)
- (Q5020544) (← links)
- (Q5020984) (← links)
- About Epistemic Negation and World Views in Epistemic Logic Programs (Q5108503) (← links)
- On Uniform Equivalence of Epistemic Logic Programs (Q5108505) (← links)
- Thirty years of Epistemic Specifications (Q6085582) (← links)
- Refining the semantics of epistemic specifications (Q6647309) (← links)
- Epistemic logic programs: a study of some properties (Q6656459) (← links)
