Welcome to the InfoSci Platform
Analysis of Defeasible Reasoning

Analysis of Defeasible Reasoning

Copyright: © 2018 |Pages: 21
ISBN13: 9781522527824|ISBN10: 1522527826|EISBN13: 9781522527831
DOI: 10.4018/978-1-5225-2782-4.ch004
Cite Chapter Cite Chapter

MLA

Boris Kulik and Alexander Fridman. "Analysis of Defeasible Reasoning." N-ary Relations for Logical Analysis of Data and Knowledge, IGI Global, 2018, pp.148-168. https://doi.org/10.4018/978-1-5225-2782-4.ch004

APA

B. Kulik & A. Fridman (2018). Analysis of Defeasible Reasoning. IGI Global. https://doi.org/10.4018/978-1-5225-2782-4.ch004

Chicago

Boris Kulik and Alexander Fridman. "Analysis of Defeasible Reasoning." In N-ary Relations for Logical Analysis of Data and Knowledge. Hershey, PA: IGI Global, 2018. https://doi.org/10.4018/978-1-5225-2782-4.ch004

Export Reference

Mendeley
Favorite

Abstract

This chapter describes implementation of abductive and modified conclusions by means of NTA. The algorithm and rules to form hypotheses for abductive conclusions are proposed. They can be applied not only to NTA objects expressing formulas of propositional calculus, but also to a more general case when attribute domains contain more than two values. Within a specific knowledge system, choosing variables and their values depends on criteria determined by the content of the system. The techniques that we developed simplify generating abductive conclusions for given limitations, for instance, in composition and number of variables. A distinctive feature of the proposed methods is that they are based on the classical foundations of logic, that is, they do not use non-monotonic logic, the logic of defaults, etc., which allowed some violations of laws of Boolean algebra and algebra of sets.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.