Sciweavers

1059 search results - page 150 / 212
» Standard Logics Are Valuation-Nonmonotonic
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 6 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
ICIW
2009
IEEE
14 years 4 months ago
Towards a Disciplined Engineering of Adaptive Service-Oriented Business Processes
Today’s cross-organizations are increasingly coordinating their capabilities in the quest of dynamically adaptable and thus highly competitive realistic services. Unfortunately,...
Nasreddine Aoumeur, Kamel Barkaoui
CIE
2007
Springer
14 years 4 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
SEMWEB
2005
Springer
14 years 3 months ago
Modeling Degrees of Conceptual Overlap in Semantic Web Ontologies
Information retrieval systems have to deal with uncertain knowledge and query results should reflect this uncertainty in some manner. However, Semantic Web ontologies are based on...
Markus Holi, Eero Hyvönen
FLOPS
1999
Springer
14 years 2 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer