Enforcing logically weaker knowledge in classical logic

Authors:
Philippe Besnard;Éric Grégoire;Sébastien Ramon
Affiliations:
IRIT CNRS UMR 5505, Toulouse, France;Université Lille - Nord de France, Lens, Artois;Université Lille - Nord de France, Lens, Artois
Venue:
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
Year:
2011

Citing 6
Cited 1

On the complexity of propositional knowledge base revision, updates, and counterfactuals

Artificial Intelligence
Automated Refinement of First-Order Horn-Clause Domain Theories

Machine Learning
Fusing Cooperative Technical-Specification Knowledge Components

ICTAI '02 Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence
Local-search Extraction of MUSes

Constraints
Does This Set of Clauses Overlap with at Least One MUS?

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Overriding subsuming rules

ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty

Overriding subsuming rules

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with a fundamental issue in knowledge representation and reasoning that, surprisingly, has received little attention so far. The point is that inserting some logically weaker (but, in a sense, more precise) information within a logic-based representation is not a straightforward process if the extra information must prevail. Indeed, it does neither prevail by itself nor disable the already existing logically stronger (but less precise) information that subsumes it. A general framework for solving this problem is introduced and instantiated to the task of making some rules prevail over more general ones.