Revision as of 21:27, 22 January 2024 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,695 edits Francesca Toni ← Previous edit		Latest revision as of 22:59, 1 February 2024 edit undo Mathnerd314159 (talk \| contribs) Extended confirmed users 3,255 edits change paradigms template to navbox (see Template talk:Programming paradigms#too long)
Line 1: {{Short description\|Logic programming using abductive reasoning}} {{No footnotes\|date=February 2015~~}}{{Programming paradigms~~}} '''Abductive logic programming''' ('''ALP''') is a high-level [[knowledge representation\|knowledge-representation]] framework that can be used to solve problems declaratively, based on [[abductive reasoning]]. It extends normal [[logic programming]] by allowing some predicates to be incompletely defined, declared as abducible predicates. Problem solving is effected by deriving hypotheses on these abducible predicates (abductive hypotheses) as solutions of problems to be solved. These problems can be either observations that need to be explained (as in classical abduction) or goals to be achieved (as in normal [[logic programming]]). It can be used to solve problems in diagnosis, [[planning]], natural language and [[machine learning]]. It has also been used to interpret [[negation as failure]] as a form of abductive reasoning. Line 169: * [http://lia.deis.unibo.it/sciff/ SCIFF] * [http://dtai.cs.kuleuven.be/krr/Asystem/asystem.html Asystem] {{Programming paradigms navbox}} [[Category:Logic programming]]

Abductive logic programming: Difference between revisions