Sciweavers

2436 search results - page 239 / 488
» Comonadic Notions of Computation
Sort
View
ICALP
2000
Springer
15 years 10 months ago
The Many Faces of a Translation
First-order translations have recently been characterized as the maps computed by aperiodic single-valued nondeterministic finite transducers (NFTs). It is shown here that this ch...
Pierre McKenzie, Thomas Schwentick, Denis Th&eacut...
TABLEAUX
1995
Springer
15 years 10 months ago
A Connection Based Proof Method for Intuitionistic Logic
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
Jens Otten
SAS
1991
Springer
102views Formal Methods» more  SAS 1991»
15 years 10 months ago
Equational Logics
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
Yong Sun
AAAI
2007
15 years 9 months ago
Representative Explanations for Over-Constrained Problems
In many interactive decision making scenarios there is often no solution that satisfies all of the user’s preferences. The decision process can be helped by providing explanati...
Barry O'Sullivan, Alexandre Papadopoulos, Boi Falt...
WSC
2008
15 years 9 months ago
A preliminary study of optimal splitting for rare-event simulation
Efficiency is a big concern when using simulation to estimate rare-event probabilities, since a huge number of simulation replications may be needed in order to obtain a reasonabl...
John F. Shortle, Chun-Hung Chen