Sciweavers

53 search results - page 9 / 11
» From Conditional to Unconditional Rewriting
Sort
View
KI
2008
Springer
13 years 7 months ago
Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework
Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...
Martin Hofmann 0008, Emanuel Kitzelmann, Ute Schmi...
DLOG
2010
13 years 5 months ago
Structure Preserving TBox Repair using Defaults
Unsatisfiable concepts are a major cause for inconsistencies in Description Logics knowledge bases. Popular methods for repairing such concepts aim to remove or rewrite axioms to r...
Thomas Scharrenbach, Rolf Grütter, Bettina Wa...
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 9 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
VEE
2006
ACM
150views Virtualization» more  VEE 2006»
14 years 1 months ago
Evaluating fragment construction policies for SDT systems
Software Dynamic Translation (SDT) systems have been used for program instrumentation, dynamic optimization, security policy enforcement, intrusion detection, and many other uses....
Jason Hiser, Daniel Williams, Adrian Filipi, Jack ...
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
14 years 2 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch