Abductive logic programming: Difference between revisions

Revision as of 06:55, 22 January 2016

Revision as of 16:49, 3 February 2016

Line 123:

* {{cite journal |first1=M. |last1=Denecker |first2=A.C. |last2=Kakas |title=Special issue: abductive logic programming |journal=J. Logic Programming |volume=44 |issue=1-3 |pages=1–4 |date=July 2000 |doi=10.1016/S0743-1066(99)00078-3 |url=http://www.sciencedirect.com/science/article/pii/S0743106699000783}}

* {{cite book |first1=M. |last1=Denecker |first2=A.C. |last2=Kakas |chapter=Abduction in Logic Programming |editor1-first=A.C. |editor1-last=Kakas |editor2-first=F. |editor2-last=Sadri |title=Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski |chapterurl=http://books.google.com/books?id=15umWyDVsRMC&pg=PA402 |year=2002 |publisher=Springer |isbn=978-3-540-43959-2 |pages=402–437 |volume=2407 |series=Lecture notes in computer science}}

* {{cite journal |first=D. |last=Poole |title=Probabilistic Horn abduction and Bayesian networks |journal=Artificial Intelligence, |volume=64 |issue=1 |pages=81–129 |year=1993 |doi=10.1016/0004-3702(93)90061-F |url=https://www.cs.ubc.ca/~poole/papers/pha-bn.pdf |format=PDF}}

* {{cite journal |first1=F. |last1=Esposito |first2=S. |last2=Ferilli |first3=T.M.A. |last3=Basile |first4=N. |last4=Di Mauro |title=Inference of abduction theories for handling incompleteness in first-order learning |journal=Knowl. Inf. Syst. |volume=11 |issue=2 |pages=217–242 |date=February 2007 |doi=10.1007/s10115-006-0019-5 |url=http://www.di.uniba.it/~ndm/publications/files/esposito07kais.pdf |format=PDF}}

{{refend}}