Pages that link to "Item:Q1041788"
From MaRDI portal
The following pages link to Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788):
Displaying 7 items.
- Some techniques for proving termination of the hyperresolution calculus (Q861692) (← links)
- Completeness of resolution revisited (Q914411) (← links)
- Disjunctive logic programs, answer sets, and the cut rule (Q2085572) (← links)
- (Q3486879) (← links)
- Another technique for proving completeness of ground resolution (Q3971269) (← links)
- Logics in Artificial Intelligence (Q5394153) (← links)
- HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. (Q6168463) (← links)