Sciweavers

37 search results - page 2 / 8
» Speculative Computations in Or-Parallel Tabled Logic Program...
Sort
View
EUROPAR
2004
Springer
13 years 11 months ago
Concurrent Table Accesses in Parallel Tabled Logic Programs
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
PPDP
2004
Springer
13 years 11 months ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey
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 ...
AAAI
2008
13 years 7 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
OOPSLA
2007
Springer
14 years 12 days ago
No ifs, ands, or buts: uncovering the simplicity of conditionals
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...
Jonathan Edwards