Query Answering in Normal Logic Programs Under Uncertainty | Zendy

Umberto Straccia | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Query Answering in Normal Logic Programs Under Uncertainty

Author(s) -

Umberto Straccia

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-27326-3

DOI - 10.1007/11518655_58

Subject(s) - computer science , negation , paraconsistent logic , datalog , simple (philosophy) , logic program , programming language , monotonic function , theoretical computer science , logic programming , artificial intelligence , algorithm , description logic , higher order logic , mathematics , mathematical analysis , philosophy , epistemology

We present a simple, yet general top-down query answering procedure for normal logic programs over lattices and bilattices, where functions may appear in the rule bodies. Its interest relies on the fact that many approaches to paraconsistency and uncertainty in logic programs with or without non-monotonic negation are based on bilattices or lattices, respectively.

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