Sciweavers

4949 search results - page 221 / 990
» Consistency and Set Intersection
Sort
View
AI
2010
Springer
15 years 6 months ago
Reasoning under inconsistency: A forgetting-based approach
In this paper, a fairly general framework for reasoning from inconsistent propositional bases is defined. Variable forgetting is used as a basic operation for weakening pieces of ...
Jérôme Lang, Pierre Marquis
AUTOMATICA
2008
98views more  AUTOMATICA 2008»
15 years 6 months ago
An algorithm for bounded-error identification of nonlinear systems based on DC functions
This paper presents a guaranteed method for the parameter estimation of nonlinear models in a bounded-error context. This method is based on functions which consists of the differ...
J. M. Bravo, T. Alamo, M. J. Redondo, Eduardo F. C...
CORR
2002
Springer
81views Education» more  CORR 2002»
15 years 5 months ago
Value withdrawal explanations: a theoretical tool for programming environments
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
Willy Lesaint
OTM
2010
Springer
15 years 4 months ago
Identifying and Eliminating Inconsistencies in Mappings across Hierarchical Ontologies
Abstract. Many applications require the establishment of mappings between ontologies. Such mappings are established by domain experts or automated tools. Errors in mappings can int...
Bhavesh Sanghvi, Neeraj Koul, Vasant Honavar
EACL
2009
ACL Anthology
15 years 3 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud