Sciweavers

1137 search results - page 69 / 228
» Partial Program Admission
Sort
View
AAAI
2006
13 years 11 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez
ICLP
2011
Springer
13 years 1 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
DAGSTUHL
1996
13 years 11 months ago
What Not to Do When Writing an Interpreter for Specialisation
A partial evaluator, given a program and a known "static" part of its input data, outputs a specialised or residual program in which computations depending only on the st...
Neil D. Jones
CC
2003
Springer
14 years 3 months ago
Improving Data Locality by Chunking
Cache memories were invented to decouple fast processors from slow memories. However, this decoupling is only partial, and many researchers have attempted to improve cache use by p...
Cédric Bastoul, Paul Feautrier
PADO
2001
Springer
14 years 2 months ago
Run-Time Bytecode Specialization
This paper describes a run-time specialization system for the Java language. One of the main difficulties of supporting the full Java language resides in a sound yet effective ma...
Hidehiko Masuhara, Akinori Yonezawa