Sciweavers

129 search results - page 17 / 26
» Compiling Possibilistic Knowledge Bases
Sort
View
ICSE
2012
IEEE-ACM
11 years 10 months ago
Characterizing logging practices in open-source software
—Software logging is a conventional programming practice. While its efficacy is often important for users and developers to understand what have happened in the production run, ...
Ding Yuan, Soyeon Park, Yuanyuan Zhou
VLDB
1992
ACM
101views Database» more  VLDB 1992»
13 years 11 months ago
Proclamation-Based Model for Cooperating Transactions
We propose a transaction model that provides a framework for transactions to cooperate without sacrificing serializability as a notion of correctness. Cooperation does not depend ...
H. V. Jagadish, Oded Shmueli
PEPM
1994
ACM
13 years 11 months ago
Binding-Time Analysis for Standard ML
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
Lars Birkedal, Morten Welinder
COLING
1992
13 years 8 months ago
The Kant System: Fast, Accurate, High-Quality Translation In Practical Domains
Knowledge-based interlingual machine translation systems produce semantically accurate translations, but typically require massive knowledge acquisition. Ongoing research and deve...
Eric Nyberg, Teruko Mitamura
CSCLP
2008
Springer
13 years 9 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin