Structure identification of Boolean relations and plain bases for co-clones

Journal of Computer and System Sciences

Volumn 74, Issue 7, 2008, Pages 1103-1115

  Creignou, Nadia ^a   Kolaitis, Phokion ^b   Zanuttini, Bruno ^c  

^a AIX MARSEILLE UNIVERSITY   (France)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c UNIVERSITÉ DE CAEN   (France)

Author keywords

Boolean co clones; Boolean constraints; Closure properties; Computational complexity; Inverse satisfiability

Indexed keywords

COMPUTATIONAL COMPLEXITY; STRUCTURE (COMPOSITION);

BOOLEAN CO-CLONES; BOOLEAN CONSTRAINT; BOOLEAN RELATIONS; CLOSURE PROPERTY; CONJUNCTIVE QUERIES; QUADRATIC ALGORITHMS; SATISFIABILITY; STRUCTURE IDENTIFICATION;

CLONING;

EID: 52949097206     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2008.02.005     Document Type: Article

References (21)

1. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley
2. Bergman C., and Slutzki G. Complexity of some problems concerning varieties and quasi-varieties of algebras. SIAM J. Comput. 30 2 (2000) 359-382
3. Böhler E., Creignou N., Reith S., and Vollmer H. Playing with Boolean blocks, Part I: Post's lattice with applications to complexity theory. ACM-SIGACT News 34 4 (2003) 38-52 Complexity Theory Column 42
4. Böhler E., Creignou N., Reith S., and Vollmer H. Playing with Boolean blocks, Part II: Constraint satisfaction problems. ACM-SIGACT News 35 1 (2004) 22-35 Complexity Theory Column 43
5. Böhler E., Reith S., Schnoor H., and Vollmer H. Bases for Boolean co-clones. Inform. Process. Lett. 96 (2005) 59-66
6. Creignou N., Khanna S., and Sudan M. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monogr. Discrete Math. Appl. (2001)
7. N. Creignou, Ph.G. Kolaitis, B. Zanuttini, Preferred representations of Boolean relations, Electronic Colloquium on Computational Complexity (ECCC), Technical report TR05-119, 2005
8. V. Dalmau, Computational complexity of problems over generalized formulas, PhD thesis, Department de Llenguatges i Sistemes Informàtica, Universitat Politécnica de Catalunya, 2000
9. Dechter R. Constraint Processing (2003), Morgan Kaufmann
10. Dechter R., and Pearl J. Structure identification in relational data. Artificial Intelligence 58 (1992) 237-270
11. Geiger D. Closed systems of functions and predicates. Pacific J. Math. 27 2 (1968) 228-250
12. Garcia-Molina H., Ullman J.D., and Widom J. Database Systems: The Complete Book (2002), Prentice Hall
13. Kavvadias D., and Sideri M. The inverse satisfiability problem. SIAM J. Comput. 28 1 (1998) 152-163
14. Ladner R. On the structure of polynomial time reducibility. J. ACM 22 1 (1975) 155-171
15. Pippenger N. Theories of Computability (1997), Cambridge University Press, Cambridge
16. Pöschel R., and Kalužnin L.A. Funktionen- und Relationenalgebren (1979), DVW, Berlin
17. Post E.L. The two-valued iterative systems of mathematical logic. Ann. of Math. Stud. vol. 5 (1941) 1-122
18. Schaefer T. The complexity of satisfiability problems. Proc. 10th STOC. San Diego, CA, USA (1978), Association for Computing Machinery 216-226
19. H. Schnoor, I. Schnoor, Partial polymorphisms and constraint satisfaction problems, in: N. Creignou, Ph.G. Kolaitis, H. Vollmer (Eds.), Complexity of Constraints, Springer-Verlag, Berlin, in press
20. Szendrei A. Clones in Universal Algebra. Séminaire de Mathématiques Supérieures vol. 99 (1986), Les Presses de l'Université de Montréal, Montréal
21. Zanuttini B., and Hébrard J.-J. A unified framework for structure identification. Inform. Process. Lett. 81 6 (2002) 335-339