Results 231 to 240 of about 328,022 (293)

Checking several forms of consistency in nonmonotonic knowledge-bases

open access: closedLecture Notes in Computer Science, 1997
In this paper, a new method is introduced to check several forms of logical consistency in nonmonotonic knowledge-bases (KBs). The knowledge representation language under consideration is full propositional logic, using “Abnormal” propositions to be minimized. Basically, the method is based on the use of local search techniques for SAT.
Eric Gregoire
exaly   +5 more sources

Probabilistic consistency of knowledge bases in inference systems

open access: closed, 2005
We consider a probabilistic knowledge base represented by a conditional probability assessment on an arbitrary finite family of conditional events. Following the approach of de Finetti to conditional events, we use the concept of generalized atom to introduce a suitable matrix representing the truth values of the given conditional events.
Angelo Gilio
exaly   +4 more sources

Method for Restoring Consistency in Probabilistic Knowledge Bases

open access: closedCybernetics and Systems, 2018
ABSTRACTEnsuring consistency of knowledge systems is always one of the essential requirements because, without it, most of these systems become useless. Because of the importance, many studies have involved the restoration of consistency in knowledge systems.
Van Tham Nguyen   +2 more
exaly   +3 more sources

On the consistency of knowledge bases: the COVADIS system

open access: closedComputational Intelligence, 1988
It is currently thought in the knowledge‐based systems (KBS) domain that sophisticated tools are necessary for helping an expert with the difficult task of knowledge acquisition. The problem of detecting inconsistencies is especially crucial. The risk of inconsistencies increases with the size of the knowledge base; for large knowledge bases, detecting
Marie‐Christine Rousset
exaly   +4 more sources

Minimal and consistent evolution of knowledge bases

Journal of Applied Non-Classical Logics, 1997
ABSTRACT This work presents efficient algorithms to update knowledge bases in the presence of integrity constraints. The algorithms ensure that the changes to the knowledge bases are minimal. We use the deductive database paradigm to represent knowledge. Minimality is defined as a natural partial order over possible models of the database and expresses
Jorge Lobo
exaly   +2 more sources

A Finely-Interleaved Consistency Checking Method for Knowledge-bases

open access: closedInternational Journal on Artificial Intelligence Tools, 1995
An efficient method to determine consistency in a knowledge-base is described. The traditional generation and evaluation steps are interleaved to compute the differences between two consecutive knowledge-base states. The method employs an optimized update propagation algorithm to improve efficiency.
John V. Harrison
openalex   +2 more sources

Knowledge-Based Description Logic ALCO Knowledge Compiled Algorithm to Determine Consistency

Advanced Materials Research, 2012
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which reasoning can be answered efficiently. The precompilation of description logic knowledge base is important for reasoning and services of description logic.
Ya Qiong Jiang, Jun Wang
exaly   +2 more sources

Transformation approach for consistency in object-oriented knowledge bases

open access: closedACM SIGART Bulletin, 1989
A knowledge base is consistent if all its data, information, or knowledge (regardless they are stored in database or implied by inference engine) satisfy the predefined constraints which represent a real world rules or restrictions.
Hsin-Hsen Yao, Hwa Soo Kim
openalex   +2 more sources

The role of domain models in maintaining consistency of large medical knowledge bases

open access: closedLecture Notes in Medical Informatics, 1991
Andrzej Glowinski   +2 more
exaly   +2 more sources

Home - About - Disclaimer - Privacy