Tractability and learnability arising from algebras with few subpowers

Authors:
Pawel Idziak;Petar Markovic;Ralph McKenzie;Matthew Valeriote;Ross Willard
Affiliations:
Jagiellonian University, Poland;University of Novi Sad, Serbia;Vanderbilt University, USA;McMaster University, Canada;University of Waterloo, Canada
Venue:
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Year:
2007

Citing 0
Cited 16

The complexity of temporal constraint satisfaction problems

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Non-dichotomies in Constraint Satisfaction Complexity

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
There are no pure relational width 2 constraint satisfaction problems

Information Processing Letters
Recent Results on the Algebraic Approach to the CSP

Complexity of Constraints
Dualities for Constraint Satisfaction Problems

Complexity of Constraints
Constraint Satisfaction Problems with Infinite Templates

Complexity of Constraints
A new line of attack on the dichotomy conjecture

Proceedings of the forty-first annual ACM symposium on Theory of computing
The complexity of temporal constraint satisfaction problems

Journal of the ACM (JACM)
Congruence Distributivity Implies Bounded Width

SIAM Journal on Computing
Tractability and Learnability Arising from Algebras with Few Subpowers

SIAM Journal on Computing
Generic expression hardness results for primitive positive formula comparison

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Quantified Equality Constraints

SIAM Journal on Computing
Tractable set constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: Colouring, constraint satisfaction, and complexity

Computer Science Review
Constraint Satisfaction Problems Solvable by Local Consistency Methods

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The decidability of equality is proved for Martin-Lof type theory with a universe á la Russell and typed beta-eta- equality judgements. A corollary of this result is that the constructor for dependent function types is injective, a property which ...