Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
Publication:5900286
DOI10.1007/b100482zbMath1152.68537MaRDI QIDQ5900286
Moshe Y. Vardi, Albert Atserias, Phokion G. Kolaitis
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100482
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
03F20: Complexity of proofs
Related Items
Characterizing Propositional Proofs as Noncommutative Formulas, Proof Complexity Meets Algebra, Unnamed Item, ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES, On Monotonic Determinacy and Rewritability for Recursive Queries and Views, Towards NP-P via proof complexity and search, How to deal with unbelievable assertions, Algebraic proofs over noncommutative formulas, Conjunctive query evaluation by search-tree revisited, A direct construction of polynomial-size OBDD proof of pigeon hole problem, On tseitin formulas, read-once branching programs and treewidth, Proof complexity of symbolic QBF reasoning, Resolution over linear equations modulo two, On the speed of constraint propagation and the time complexity of arc consistency testing