DeepAI
Log In Sign Up

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
06/03/2011

Semantics for Possibilistic Disjunctive Programs

In this paper, a possibilistic disjunctive logic programming approach fo...
01/27/2021

Tutorial on implementing Hoare logic for imperative programs in Haskell

Using the programming language Haskell, we introduce an implementation o...
06/07/2013

Accomplishable Tasks in Knowledge Representation

Knowledge Representation (KR) is traditionally based on the logic of fac...
09/22/2020

Enhancing Linear Algebraic Computation of Logic Programs Using Sparse Representation

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

Towards a Logic-Based Unifying Framework for Computing

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

Incremental maintenance of overgrounded logic programs with tailored simplifications

The repeated execution of reasoning tasks is desirable in many applicati...