Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A General Framework for Reasoning On InconsistencyAlgorithms

A General Framework for Reasoning On Inconsistency: Algorithms [In this chapter we present several general algorithms (independent of the specific logic) to compute the preferred options for a given knowledge base. We start by showing a naive algorithm that makes no assumptions about the weakening mechanism or the preference relation. We also show that for specific combinations of weakening mechanisms and preference relations, the preferred options coincide with the computation of maximal consistent subsets and therefore can be computed efficiently for certain logics. Finally, we develop two algorithms that exploit properties of monotonicity and anti-monotonicity in the preference relation, respectively, in order to compute the preferred options more efficiently.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Loading next page...
 
/lp/springer-journals/a-general-framework-for-reasoning-on-inconsistency-algorithms-PYX5Pnh00N

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer New York
Copyright
© The Author(s) 2013
ISBN
978-1-4614-6749-6
Pages
13 –20
DOI
10.1007/978-1-4614-6750-2_3
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter we present several general algorithms (independent of the specific logic) to compute the preferred options for a given knowledge base. We start by showing a naive algorithm that makes no assumptions about the weakening mechanism or the preference relation. We also show that for specific combinations of weakening mechanisms and preference relations, the preferred options coincide with the computation of maximal consistent subsets and therefore can be computed efficiently for certain logics. Finally, we develop two algorithms that exploit properties of monotonicity and anti-monotonicity in the preference relation, respectively, in order to compute the preferred options more efficiently.]

Published: Feb 13, 2013

Keywords: Maximal Consistent Subsets; Mechanical Weakness; Knowledge Base; Preferred Ones; Bigger Options

There are no references for this article.