Principles and Practice of Constraint Programming – CP 2004

DOI10.1007/b100482zbMath1152.68537OpenAlexW1508891358MaRDI 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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity of proofs (03F20)

Related Items (14)

On Monotonic Determinacy and Rewritability for Recursive Queries and Views ⋮ Conjunctive query evaluation by search-tree revisited ⋮ Characterizing Propositional Proofs as Noncommutative Formulas ⋮ On the speed of constraint propagation and the time complexity of arc consistency testing ⋮ Towards NP-P via proof complexity and search ⋮ Algebraic proofs over noncommutative formulas ⋮ Proof Complexity Meets Algebra ⋮ ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES ⋮ How to deal with unbelievable assertions ⋮ A direct construction of polynomial-size OBDD proof of pigeon hole problem ⋮ On tseitin formulas, read-once branching programs and treewidth ⋮ Unnamed Item ⋮ Resolution over linear equations modulo two ⋮ Proof complexity of symbolic QBF reasoning

This page was built for publication: Principles and Practice of Constraint Programming – CP 2004