The following pages link to (Q3998267):
Displayed 10 items.
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs (Q324656) (← links)
- Proving completeness of logic programs with the cut (Q511027) (← links)
- Fuzzy logic programming reduced to reasoning with attribute implications (Q529051) (← links)
- Abstract interpretation: a kind of magic (Q673498) (← links)
- A new SLDNF-tree (Q1199935) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- kProbLog: an algebraic Prolog for machine learning (Q1699913) (← links)
- Operational semantics of resolution and productivity in Horn clause logic (Q2628299) (← links)
- (Q5020546) (← links)
- On correctness of normal logic programs (Q6103020) (← links)