Logics with approximate premises

  title={Logics with approximate premises},
  author={L. Biacino and Giangiacomo Gerla},
  journal={International Journal of Intelligent Systems},
M. Ying proposed a propositional calculus in which the reasoning may be approximate by allowing the antecedent clause of a rule to match its premise only approximately. The aim of this note is to relate Ying's proposal to an extension principle for closure operators proposed by the authors. In this way it is possible to show that, in a sense, Ying's apparatus can be reduced to a fuzzy logic as defined by Pavelka [J. Pavelka, “On fuzzy logic I. Many valued rules of inference,” Zeitschrift fur… Expand
17 Citations
Similarity in Logic Programming
  • 22
On syntactical and semantical approaches to similarity-based approximate reasoning
  • 2
On implicative closure operators in approximate reasoning
  • 23
  • PDF
Fuzzy logic, continuity and effectiveness
  • 70
  • PDF
Meta-logic programming for a synonymy logic
On implicative closure operators in approximate reasoning
  • 11
  • PDF
Approximate Reasoning Based on Similarity
  • 15
Likelog for flexible query answering
  • F. Fontana
  • Mathematics, Computer Science
  • Soft Comput.
  • 2002
  • 10
  • Highly Influenced
Similarity-based Unification
  • 65


An Extension Principle for Fuzzy Logics
  • 32
A Logic for Approximate Reasoning
  • M. Ying
  • Computer Science
  • J. Symb. Log.
  • 1994
  • 110
  • PDF
On Fuzzy Logic I Many-valued rules of inference
  • J. Pavelka
  • Mathematics, Computer Science
  • Math. Log. Q.
  • 1979
  • 333