Sciweavers

6054 search results - page 795 / 1211
» Implementation of Andorra-based Languages
Sort
View
315
Voted
ICLP
2009
Springer
16 years 7 months ago
Logic Programming with Defaults and Argumentation Theories
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...
Hui Wan, Benjamin N. Grosof, Michael Kifer, Paul F...
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 7 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
16 years 7 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
VLSID
2005
IEEE
129views VLSI» more  VLSID 2005»
16 years 7 months ago
A RISC Hardware Platform for Low Power Java
Java is increasingly being used as a language and binary format for low power, embedded systems. Current software only approaches to Java execution do not always suit the type of ...
Paul Capewell, Ian Watson
VLSID
2003
IEEE
253views VLSI» more  VLSID 2003»
16 years 7 months ago
High Level Synthesis from Sim-nML Processor Models
The design of modern complex embedded systems require a high level of abstraction of the design. The SimnML[1] is a specification language to model processors for such designs. Se...
Souvik Basu, Rajat Moona