Article

Constraint satisfaction, databases, and logic

Author:

Phokion G. KolaitisAuthors Info & Claims

IJCAI'03: Proceedings of the 18th international joint conference on Artificial intelligence

Pages 1587 - 1595

Published: 09 August 2003 Publication History

Abstract

No abstract available.

References

[1]

{Bib88} W. Bibel. Constraint satisfaction from a deductive viewpoint. Artificial Intelligence, 35:401-413, 1988.

Digital Library

Google Scholar

[2]

{Bod93} H.L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. In Proc. 25th ACM Symp. on Theory of Computing, pages 226-234, 1993.

Digital Library

Google Scholar

[3]

{Bul02a} A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proc. 43rd IEEE Symposium on Foundations of Computer Science, pages 649-658, 2002.

Digital Library

Google Scholar

[4]

{Bul02b} A. Bulatov. Maltsev constraints are tractable. Technical Report PRG-RR-02-05, Oxford University, 2002.

Google Scholar

[5]

{Bul03} A. Bulatov. Tractable conservative constraint satisfaction problems. In Proc. 18th IEEE Symposium on Logic in Computer Science, 2003.

Digital Library

Google Scholar

[6]

{CM77} A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th ACM Symp. on Theory of Computing, pages 77-90, 1977.

Digital Library

Google Scholar

[7]

{Dec92a} R. Dechter. Constraint networks. In S.C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 276-185. Wiley, New York, 1992.

Google Scholar

[8]

{Dec92b} R. Dechter. From local to global consistency. Artificial Intelligence, 55(1):87-107, May 1992.

Digital Library

Google Scholar

[9]

{Dec99} R. Dechter. Bucket elimination: a unifying framework for reasoning. Artificial Intelligence, 113(1-2):41-85, 1999.

Digital Library

Google Scholar

[10]

{DF99} R.G. Downey and M.R. Fellows. Parametrized Complexity. Springer-Verlag, 1999.

Digital Library

Google Scholar

[11]

{DKV02} V. Dalmau, Ph.G. Kolaitis, and M.Y. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In Proc. of the Eighth Int. Conference on Principles and Practice of Constraint Programming (CP 2002), Lecture Notes in Computer Science, pages 311-326. Springer, 2002.

Digital Library

Google Scholar

[12]

{DP89} R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, pages 353-366, 1989.

Digital Library

Google Scholar

[13]

{EFT94} H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Springer-Verlag, 2nd edition, 1994.

Google Scholar

[14]

{Fre90} E.C. Freuder. Complexity of K-tree structured constraint satisfaction problems. In Proc. of 8th National Conference on Artificial Intelligence, pages 4-9, 1990.

Google Scholar

[15]

{FV98} T. Feder and M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. on Computing, 28:57-104, 1998. Preliminary version in Proc. 25th ACM Symp. on Theory of Computing, May 1993, pp. 612-622.

Digital Library

Google Scholar

[16]

{GJ79} M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., 1979.

Digital Library

Google Scholar

[17]

{Gro03} M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Submitted for publication, 2003.

Digital Library

Google Scholar

[18]

{JCC98} P. Jeavons, D. Cohen, and M.C. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101(1- 2):251-65, May 1998.

Digital Library

Google Scholar

[19]

{JCG97} P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-48, 1997.

Digital Library

Google Scholar

[20]

{Jea98} P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200(1-2): 185- 204, 1998.

Digital Library

Google Scholar

[21]

{KV90} Ph. G. Kolaitis and M. Y. Vardi. 0-1 laws for infinitary logics. In Proc. 5th IEEE Symp. on Logic in Computer Science, pages 156-167, 1990.

Crossref

Google Scholar

[22]

{KV95} Ph. G. Kolaitis and M. Y. Vardi. On the expressive power of Datalog: tools and a case study. Journal of Computer and System Sciences, 51(1): 110-134, August 1995.

Digital Library

Google Scholar

[23]

{KV00a} Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, pages 302-332, 2000. Earlier version in: Proc. 17th ACM Symp. on Principles of Database Systems (PODS '98).

Digital Library

Google Scholar

[24]

{KV00b} Ph.G. Kolaitis and M.Y. Vardi. A game-theoretic approach to constraint satisfaction. In Proc. of the 17th National Conference on Artificial Intelligence (AAAI2000), pages 175-181, 2000.

Digital Library

Google Scholar

[25]

{Lad75} R. E. Ladner. On the structure of polynomial time reducibility. Journal of the Association for Computing Machinery, 22(1): 155-171, 1975.

Digital Library

Google Scholar

[26]

{Mon74} U. Montanari. Networks of constraints: fundamental properties and application to picture processing. Information Science, 7:95-132, 1974.

Crossref

Google Scholar

[27]

{PJ97} J. Pearson and P. Jeavons. A survey of tractable constraint satisfaction problems. Technical Report CSD-TR-97-15, Royal Holloway University of London, 1997.

Google Scholar

[28]

{Sch78} T.J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM Symp. on Theory of Computing, pages 216-226, 1978.

Digital Library

Google Scholar

[29]

{Ull89} J. D. Ullman. Database and Knowledge-Base Systems, Volumes I and II. Computer Science Press, 1989.

Digital Library

Google Scholar

Cited By

View all

Console MGuagliardo PLibkin L(2017)On querying incomplete information in databases under bag semanticsProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171784(993-999)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171784
Ganian RRamanujan MSzeider S(2017)Discovering Archipelagos of Tractability for Constraint Satisfaction and CountingACM Transactions on Algorithms10.1145/301458713:2(1-32)Online publication date: 6-Mar-2017
https://dl.acm.org/doi/10.1145/3014587
Greco GScarcello F(2017)Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problemsInformation and Computation10.1016/j.ic.2016.11.004252:C(201-220)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.ic.2016.11.004
Show More Cited By

Constraint satisfaction, databases, and logic

Recommendations

The Logic of Constraint Satisfaction
First-order logic as a constraint satisfaction problem
Abstract
In this paper, we discourse an analysis of classical first-order predicate logic as a constraint satisfaction problem, CSP. First, we will offer our general framework for CSPs, and then apply it to first-order logic. We claim it would function as ...
Constraint structure in constraint satisfaction problems

Comments

Information & Contributors

Information

Published In

IJCAI'03: Proceedings of the 18th international joint conference on Artificial intelligence

August 2003

1674 pages

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 09 August 2003

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Console MGuagliardo PLibkin L(2017)On querying incomplete information in databases under bag semanticsProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171784(993-999)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171784
Ganian RRamanujan MSzeider S(2017)Discovering Archipelagos of Tractability for Constraint Satisfaction and CountingACM Transactions on Algorithms10.1145/301458713:2(1-32)Online publication date: 6-Mar-2017
https://dl.acm.org/doi/10.1145/3014587
Greco GScarcello F(2017)Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problemsInformation and Computation10.1016/j.ic.2016.11.004252:C(201-220)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.ic.2016.11.004
Ganian RRamanujan MSzeider S(2016)Discovering archipelagos of tractability for constraint satisfaction and countingProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884549(1670-1681)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884549
Bulatov AKoskinen EGrohe MShankar N(2016)Graphs of relational structuresProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2933604(642-651)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2933604
Gottlob GGreco GLeone NScarcello FMilo TTan W(2016)Hypertree DecompositionsProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/2902251.2902309(57-74)Online publication date: 15-Jun-2016
https://dl.acm.org/doi/10.1145/2902251.2902309
Bulatov A(2011)Complexity of conservative constraint satisfaction problemsACM Transactions on Computational Logic10.1145/1970398.197040012:4(1-66)Online publication date: 22-Jul-2011
https://dl.acm.org/doi/10.1145/1970398.1970400
Leyton-Brown KNudelman EShoham Y(2009)Empirical hardness modelsJournal of the ACM10.1145/1538902.153890656:4(1-52)Online publication date: 2-Jul-2009
https://dl.acm.org/doi/10.1145/1538902.1538906
Cadoli MMancini T(2007)USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMSApplied Artificial Intelligence10.1080/0883951070125265021:4-5(383-404)Online publication date: 1-Apr-2007
https://dl.acm.org/doi/10.1080/08839510701252650
Bulatov A(2006)A dichotomy theorem for constraint satisfaction problems on a 3-element setJournal of the ACM10.1145/1120582.112058453:1(66-120)Online publication date: 1-Jan-2006
https://dl.acm.org/doi/10.1145/1120582.1120584
Show More Cited By

Abstract

References

Cited By

Recommendations

The Logic of Constraint Satisfaction

First-order logic as a constraint satisfaction problem

Constraint structure in constraint satisfaction problems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations