Sciweavers

150 search results - page 17 / 30
» Understanding Promise Theory Using Rewriting Logic
Sort
View
PEPM
2004
ACM
15 years 2 months ago
Proving termination of membership equational programs
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
Francisco Durán, Salvador Lucas, José...
ECIS
2011
13 years 9 months ago
Exploring the contribution of information technology to governance, risk management, and compliance (GRC) initiatives
1 Information technology (IT) has a tremendous impact on the discipline of accounting by introducing new ways of retrieving and processing information about performance deviations ...
Manuel Wiesche, Michael Schermann, Helmut Krcmar
PPDP
2007
Springer
15 years 3 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
AAI
2005
113views more  AAI 2005»
14 years 9 months ago
Analysis and Synthesis of Learning Agent's Communicative Behavior
This paper is about people. It is about understanding how learning and communication mutually influence one another; allowing people to infer each other's communicative behavi...
Nik Nailah Binti Abdullah, Stefano A. Cerri
77
Voted
TMM
2002
83views more  TMM 2002»
14 years 9 months ago
Systematic evaluation of logical story unit segmentation
Abstract--Although various Logical Story Unit (LSU) segmentation methods based on visual content have been presented in literature, a common ground for comparison is missing. We pr...
Jeroen Vendrig, Marcel Worring