메뉴 건너뛰기




Volumn 3, Issue 4, 2007, Pages

A characterisation of first-order constraint satisfaction problems

Author keywords

Constraint satisfaction problems; Finite duality; First order logic; Tree duality

Indexed keywords

ALGEBRA; CHARACTERIZATION; CONSTRAINT THEORY; FORMAL LOGIC; POLYNOMIAL APPROXIMATION;

EID: 85025078284     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(4:6)2007     Document Type: Article
Times cited : (72)

References (15)
  • 4
    • 33750042019 scopus 로고    scopus 로고
    • The Complexity of Constraint Languages
    • (F. Rossi, P. van Beek, T. Walsh eds.), chapter 8, Elsevier
    • D. Cohen and P. G. Jeavons. The Complexity of Constraint Languages, in Handbook of Con-straint Programming (F. Rossi, P. van Beek, T. Walsh eds.), chapter 8, Elsevier, 2006, 978 pp.
    • (2006) Handbook of Con-Straint Programming , pp. 978
    • Cohen, D.1    Jeavons, P.G.2
  • 5
    • 69949162338 scopus 로고    scopus 로고
    • Linear Datalog and bounded path duality of relational structures
    • V. Dalmau. Linear Datalog and bounded path duality of relational structures. Logical Methods in Computer Science, 1(1), 2005.
    • (2005) Logical Methods in Computer Science , vol.1 , Issue.1
    • Dalmau, V.1
  • 9
    • 0032057865 scopus 로고    scopus 로고
    • The Computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory
    • T. Feder, M. Y. Vardi. The Computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM Journal of Computing 28, (1998), 57-104.
    • (1998) SIAM Journal of Computing , vol.28 , pp. 57-104
    • Feder, T.1    Vardi, M.Y.2
  • 10
    • 0001110897 scopus 로고    scopus 로고
    • On the algebraic structure of combinatorial problems
    • P. Jeavons. On the algebraic structure of combinatorial problems Theoret. Comput. Sci. 200 no. 1-2, 185-204, 1998.
    • (1998) Theoret. Comput. Sci , vol.200 , Issue.1-2 , pp. 185-204
    • Jeavons, P.1
  • 11
    • 38149070894 scopus 로고    scopus 로고
    • Universal algebra and hardness results for constraint satisfaction prob-lems
    • B. Larose and P. Tesson. Universal algebra and hardness results for constraint satisfaction prob-lems. ICALP 2007, 267-278.
    • (2007) ICALP , pp. 267-278
    • Larose, B.1    Tesson, P.2
  • 12
    • 17744411843 scopus 로고    scopus 로고
    • Duality theorems for finite structures (Characterising gaps and good char-acterisations)
    • J. Nešetřil, C. Tardif. Duality theorems for finite structures (characterising gaps and good char-acterisations). J. Combin. Theory Ser. B 80, 2000, 80-97.
    • (2000) J. Combin. Theory Ser. B , vol.80 , pp. 80-97
    • Nešet, J.1    Řiltardif, C.2
  • 13
    • 33751171304 scopus 로고    scopus 로고
    • Short answers to exponentially long questions: Extremal aspects of homo-morphism duality
    • J. Nešetřil, C. Tardif. Short answers to exponentially long questions: extremal aspects of homo-morphism duality. SIAM J. Discrete Math. 19, 2005, 914-920
    • (2005) SIAM J. Discrete Math , vol.19 , pp. 914-920
    • Nešet, J.1    Řiltardif, C.2
  • 15
    • 0018053728 scopus 로고
    • The complexity of satisfiability problems
    • T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM STOC, pages 216-226, 1978.
    • (1978) Proc. 10Th ACM STOC , pp. 216-226
    • Schaefer, T.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.