Partition search for non-binary constraint satisfaction-Reference-Cited by-同舟云学术

Partition search for non-binary constraint satisfaction

Published:2007-09 Issue:18 Volume:177 Page:3639-3678
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Ullmann Julian R.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference87 articles.

1. Random constraint satisfaction: a more accurate picture;Achlioptas;Constraints,2001

2. Algorithms for trie compaction;Al-Suwaiyel;ACM Trans. Database Syst.,1984

3. A trie compaction algorithm for a large set of keys;Aoe;IEEE Trans. Data Knowledge Eng.,1996

4. Identification of β-sheet motifs, of ψ-loops and of patterns of amino-acid residues in three-dimensional protein structures using a subgraph-isomorphism algorithm;Artymiuk;J. Chem. Inform. Comput. Sci.,1994

5. Implementing a relational database by means of specialized hardware;Babb;ACM Trans. Database Syst.,1979

Cited by 42 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A CP-Based Automatic Tool for Instantiating Truncated Differential Characteristics;Lecture Notes in Computer Science;2024

2. New Methods for Compressing Table Constraints;Studies in Computational Intelligence;2024

3. An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints;The Journal of Supercomputing;2022-07-14

4. Adaptive constraint propagation in constraint satisfaction: review and evaluation;Artificial Intelligence Review;2021-05-11

5. Segmented Tables: An Efficient Modeling Tool for Constraint Reasoning;FRONT ARTIF INTEL AP;2020