Sciweavers

215 search results - page 2 / 43
» Tabling with Answer Subsumption: Implementation, Application...
Sort
View
ICLP
2009
Springer
14 years 3 days ago
An Engine for Computing Well-Founded Models
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...
Terrance Swift
IPPS
2002
IEEE
13 years 10 months ago
Achieving Scalability in Parallel Tabled Logic Programs
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
ERLANG
2003
ACM
13 years 10 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
EDBT
2010
ACM
188views Database» more  EDBT 2010»
13 years 11 months ago
Subsumption and complementation as data fusion operators
The goal of data fusion is to combine several representations of one real world object into a single, consistent representation, e.g., in data integration. A very popular operator...
Jens Bleiholder, Sascha Szott, Melanie Herschel, F...
ICLP
2009
Springer
14 years 6 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...