Representing Incomplete Knowledge in Abductive Logic Programming | Zendy

Marc Denecker | Zendy; Danny De Schreye | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Representing Incomplete Knowledge in Abductive Logic Programming

Author(s) -

Marc Denecker,

Danny De Schreye

Publication year - 1995

Publication title -

journal of logic and computation

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.475

H-Index - 54

eISSN - 1465-363X

pISSN - 0955-792X

ISBN - 0-262-63152-0

DOI - 10.1093/logcom/5.5.553

Subject(s) - abductive reasoning , soundness , computer science , non monotonic logic , logic programming , programming language , completeness (order theory) , functional logic programming , knowledge representation and reasoning , artificial intelligence , theoretical computer science , inductive programming , programming paradigm , mathematics , mathematical analysis

Recently, Gelfond and Lifschitz presented a formal language for representing incomplete knowledge on actions and states, and a sound translation from this language to extended logic programming. We present an alternative translation to abductive logic programming with integrity constraints and prove the soundness and completeness. In addition, we show how an abductive procedure can be used, not only for explanation, but also for deduction and proving satisfiability under uncertainty. From a more general perspective, this work can be viewed as a-successful-experiment in the declarative representation of and automated reasoning on incomplete knowledge using abductive logic programming.status: publishe

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research