Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
A Logical Framework for Evolution of Specifications
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
A Computational Framework for Convergent Agents
IDEAL '00 Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents
A consistency-based approach for belief change
Artificial Intelligence
On Computing Belief Change Operations using Quantified Boolean Formulas
Journal of Logic and Computation
The Computer Journal
Mathematical Logic: Foundations for Information Science
Mathematical Logic: Foundations for Information Science
A decomposition based algorithm for maximal contractions
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
This paper investigates the problem of computing all maximal contractions of a given formula set Γ with respect to a consistent set Δ of atomic formulas and negations of atomic formulas. We first give a constructive definition of minimal inconsistent subsets and propose an algorithmic framework for computing all minimal inconsistent subsets of any given formula set. Then we present an algorithm to compute all maximal contractions fromminimal inconsistent subsets. Based on the algorithmic framework and the algorithm, we propose a general framework for computing all maximal contractions. The computability of the minimal inconsistent subset and maximal contraction problems are discussed. Finally, we demonstrate the ability of this framework by applying it to the first-order language without variables and design an algorithmfor the computation of all maximal contractions.