OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Communications of the ACM
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A New Data Structure for Implementing Extensions to Prolog
PLILP '90 Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming
Metastructures versus Attributed Variables in the Context of Extensible Unification
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Compiling Constraint Handling Rules into Prolog with Attributed Variables
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Efficient data structures for tabled resolution
Efficient data structures for tabled resolution
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
Proceedings of the 17th International Conference on Logic Programming
A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Generation of Rule-Based Constraint Solvers: Combined Approach
Logic-Based Program Synthesis and Transformation
Unicast and multicast QoS routing with soft-constraint logic programming
ACM Transactions on Computational Logic (TOCL)
Optimizing inequality joins in datalog with approximated constraint propagation
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
A general implementation framework for tabled CLP
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
As extensions to traditional logic programming, both tabling and Constraint Logic Programming (CLP) have proven powerful tools in many areas. They make logic programming more efficient and more declarative. However, combining the techniques of tabling and constraint solving is still a relatively new research area. In this paper, we show how to build a Tabled Constraint Logic Programming (TCLP) system based on XSB -- a tabled logic programming system. We first discuss how to extend XSB with the fundamental mechanism of constraint solving, basically the introduction of attributed variables to XSB, and then present a general framework for building a TCLP system. An interface among the XSB tabling engine, the corresponding constraint solver, and the user's program is designed to fully utilize the power of tabling in TCLP programs.