Some simplified forms of reasoning with distance-based entailments

Ofer Arieli, Anna Zamansky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Distance semantics is a robust way of handling dynamically evolving and possibly contradictory information. In this paper we show that in many cases distance-based entailments can be computerized in a general and modular way. We consider two different approaches for reasoning with distance semantics, apply them on some common cases, and show their relation to other known problems.

Original languageEnglish
Title of host publicationAdvances in Artificial Intelligence - 21st Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2008, Proceedings
Pages36-47
Number of pages12
DOIs
StatePublished - 2008
Externally publishedYes
Event21st Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2008 - Windsor, Canada
Duration: 28 May 200830 May 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5032 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2008
Country/TerritoryCanada
CityWindsor
Period28/05/0830/05/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Some simplified forms of reasoning with distance-based entailments'. Together they form a unique fingerprint.

Cite this