Overcoming Misleads In Logic Programs by Redefining Negation

05/31/2011
by   M. A. El-Dosuky, et al.
0

Negation as failure and incomplete information in logic programs have been studied by many researchers In order to explains HOW a negated conclusion was reached, we introduce and proof a different way for negating facts to overcoming misleads in logic programs. Negating facts can be achieved by asking the user for constants that do not appear elsewhere in the knowledge base.

READ FULL TEXT
research
06/03/2011

Semantics for Possibilistic Disjunctive Programs

In this paper, a possibilistic disjunctive logic programming approach fo...
research
06/07/2013

Accomplishable Tasks in Knowledge Representation

Knowledge Representation (KR) is traditionally based on the logic of fac...
research
02/14/2012

Inference in Probabilistic Logic Programs using Weighted CNF's

Probabilistic logic programs are logic programs in which some of the fac...
research
09/22/2020

Enhancing Linear Algebraic Computation of Logic Programs Using Sparse Representation

Algebraic characterization of logic programs has received increasing att...
research
01/29/2013

Towards a Logic-Based Unifying Framework for Computing

In this paper we propose a logic-based, framework inspired by artificial...
research
08/06/2020

Incremental maintenance of overgrounded logic programs with tailored simplifications

The repeated execution of reasoning tasks is desirable in many applicati...
research
02/04/2012

Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive datalog

We propose a novel, type-elimination-based method for reasoning in the d...

Please sign up or login with your details

Forgot password? Click here to reset