Sciweavers

49 search results - page 2 / 10
» XSB: Extending Prolog with Tabled Logic Programming
Sort
View
CL
2000
Springer
13 years 11 months ago
Querying Inconsistent Databases: Algorithms and Implementation
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
Alexander Celle, Leopoldo E. Bertossi
ICLP
1999
Springer
13 years 11 months ago
A Linear Tabling Mechanism
Delaying-based tabling mechanisms, such as the one adopted in XSB, are nonlinear in the sense that the computation state of delayed calls has to be preserved. In this paper, we pr...
Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai ...
IPPS
2002
IEEE
13 years 11 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 ...
PADL
2010
Springer
13 years 8 months ago
A Simple and Efficient Implementation of Concurrent Local Tabling
Newer Prolog implementations commonly offer support for multi-threading, and have also begun to offer support for tabling. However, most implementations do not yet integrate tablin...
Rui Marques, Terrance Swift, José C. Cunha
ICLP
2009
Springer
14 years 1 months 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