158 search results - page 11 / 32 » Coinductive Logic Programming with Negation |
LPNMR
2009
Springer
15 years 6 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
ASIAN
1999
Springer
15 years 4 months ago
1999
Springer
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
109
Voted
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives without the burden of any form of negation. This complete ab...
103
click to vote
RR
2009
Springer
15 years 6 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
91
Voted
AAAI
1990
15 years 25 days ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...