Applying Constraint Logic Programming to SQL Semantic Analysis
نویسندگان
چکیده
منابع مشابه
Applying Constraint Logic Programming to SQL Test Case Generation
We present a general framework for generating SQL query test cases using Constraint Logic Programming. Given a database schema and a SQL view defined in terms of other views and schema tables, our technique generates automatically a set of finite domain constraints whose solutions constitute the test database instances. The soundness and correctness of the technique w.r.t. the semantics of Exte...
متن کاملApplying Constraint Logic Programming
In nesting problems a two-dimensional piece of material must be divided into smaller pieces with irregular shape. The variant of the problem dealt with here considers only one big piece with fixed width and infinite length. Nesting problems have traditionally been tackled either by heuristic algorithms or, for rather small problems, by building mixed integer programming models. A more flexible ...
متن کاملApplying Constraint Logic Programming to the Resolution of Nesting Problems
Nesting problems are combinatorial optimisation problems where one or more pieces of material or space must be divided into smaller irregular pieces, minimising the waste. In OR, the state-of-the-art in nesting problems is to solve them by means of heuristic algorithms; the use of mixed integer programming models can handle only rather small instances. The satisfaction of geometric constraints ...
متن کاملJ LOGIC PROGRAMMING to appear Constraint Logic Programming A Survey
Machine This section discusses some major issues in the design of an abstract machine for the execution of CLP programs The primary focus here will be on the design of the instruction set with emphasis on the interaction between their use and information obtained from a potential program analyzer Some elements of the runtime structure will also be mentioned In general the essential features of ...
متن کاملApplying Constraint Programming to Protein Structure Determination
In this paper, we propose a constraint-based approach to determining protein structures compatible with distance constraints obtained from Nuclear Magnetic Resonance (NMR) data. We compare the performance of our proposed algorithm with DYANA ("Dynamics algorithm for NMR applications” [1]) an existing commercial application based on simulated annealing. For our test case, computation time for DY...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2019
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068419000206