A rational reconstruction of nonmonotonic truth maintenance systems
โ Scribed by Charles Elkan
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 792 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
โฆ Synopsis
The main contribution of this paper is a precise characterization of the inferences performed by nonmonotonic truth maintenance systems ( TMSs), using two standard nonmonotonic formalisms: logic programming with the stable set semantics and autoepistemic logic. The paper also contains an analysis of the role of dependency-directed backtracking in dealing with contradictions, and a proof that implementing a nonmonotonic TMS is an NP-complete problem.
๐ SIMILAR VOLUMES
The paper demonstrates the feasibility of planning using the properties of operations available in a factory, without the explicit statement of the relationships between these operations being required. This approach allows the generation of plans to be broken down into sub-problems which can be per
In this paper the framework DESIRE for the design of compositional reasoning systems and multi-agent systems was applied to build a generic nonmonotonic reasoning system. The outcome is a general reasoning system that can be used to model different nonmonotonic reasoning formalisms and that can be e
In this paper, we investigate a smoothing-type algorithm with a nonmonotone line search for solving a system of equalities and inequalities. We prove that the nonmonotone algorithm is globally and locally superlinearly convergent under suitable assumptions. The preliminary numerical results are repo