Sciweavers

348 search results - page 30 / 70
» Using Case-Based Reasoning to Write Constraint Programs
Sort
View
DKE
2010
167views more  DKE 2010»
15 years 2 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
SAC
2008
ACM
15 years 1 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
15 years 6 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
AAAI
2008
15 years 4 months ago
Credulous Resolution for Answer Set Programming
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
Piero A. Bonatti, Enrico Pontelli, Tran Cao Son
ICFP
2008
ACM
16 years 2 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...