Sciweavers

2145 search results - page 262 / 429
» Lax Logical Relations
Sort
View
AAAI
1990
13 years 9 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 8 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 8 months ago
Cardinality heterogeneities in Web service composition: Issues and solutions
Abstract. Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a c...
Michael Mrissa, Philippe Thiran, Jean-Marie Jacque...
AML
2006
83views more  AML 2006»
13 years 8 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
ENTCS
2007
87views more  ENTCS 2007»
13 years 8 months ago
Aspect-orientation For Revitalising Legacy Business Software
This paper relates on a first attempt to see if aspect-oriented programming (AOP) and logic meta-programming (LMP) can help with the revitalisation of legacy business software. B...
Kris De Schutter, Bram Adams