Sciweavers

33 search results - page 1 / 7
» Anytime Approximations of Classical Logic from Above
Sort
View
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 4 months ago
Anytime Approximations of Classical Logic from Above
In this paper we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of...
Marcelo Finger, Renata Wassermann
KR
2000
Springer
13 years 8 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
AIIA
1991
Springer
13 years 8 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
IJSI
2010
84views more  IJSI 2010»
13 years 3 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
JANCL
2002
121views more  JANCL 2002»
13 years 4 months ago
Approximate coherence-based reasoning
ABSTRACT. It has long been recognized that the concept of inconsistency is a central part of commonsense reasoning. In this issue, a number of authors have explored the idea of rea...
Frédéric Koriche