2009
DOI: 10.1007/978-3-642-02614-0_9
|View full text |Cite
|
Sign up to set email alerts
|

Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations

Abstract: Abstract. We present a specialised (polynomial-based) rule for the propositional logic called the Independence Rule, which is useful to compute the conservative retractions of propositional logic theories. In this paper we show the soundness and completeness of the logical calculus based on this rule, as well as other applications. The rule is defined by means of a new kind of operator on propositional formulae. It is based on the boolean derivatives on the polynomial ring F2 [x].

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
2
2
1

Relationship

4
1

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 18 publications
(20 reference statements)
0
7
0
Order By: Relevance
“…However, the summation of additional data and attributes could make it necessary to apply conservative retraction methods [5,2] to work with a contextual KB of a feasible size.…”
Section: Concluding Remarks and Future Workmentioning
confidence: 99%
“…However, the summation of additional data and attributes could make it necessary to apply conservative retraction methods [5,2] to work with a contextual KB of a feasible size.…”
Section: Concluding Remarks and Future Workmentioning
confidence: 99%
“…Two options have been considered for solving this problem by FCA. The first one is based on avoiding inconsistencies using conservative retraction [13]. The aim is to remove one attribute from incompatible pairs in contextual KB, next to present related attribute proof.…”
Section: A Incompatible Attributesmentioning
confidence: 99%
“…Then the entailment problem with respect to K is considered. For this strategy to be successful -valid and complete-K must be a conservative extension of K (or, equivalently, K a conservative retraction of K [10]). A knowledge base K in the language L is a conservative retraction of K if K is an extension of K such that every L -fórmula entailed by K is also entailed by K .…”
Section: Introductionmentioning
confidence: 99%
“…Taking into account the aforementioned motivations, the aim of this paper is twofold. First, we intend to present a complete and detailed exposition of the foundations of the independence rule (That can be considered a tool for variable forgetting), whose basic ideas were published in [10], since no detailed exposition has been published until now. In fact, we generalize the cited paper by stating the results for any operator that induces a conservative retraction, leading as consequence that our case, the independence rule, is useful to compute the retractions.…”
Section: Introductionmentioning
confidence: 99%