( en | de | ru )

 

Disambiguation of "Mitchell, David G."

Author of the publication

copydeleteadd this publication to your clipboard
Expressive power and abstraction in Essence.

, and . Constraints An Int. J., 13 (3): 343-384 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

David G Wigg

David G Long

Daniell Mitchell

Gail Mitchell

Margaret Mitchell

 

Other publications of authors with the same name

Problem Solving with the Enfragmo System., , and . Theory Pract. Log. Program., (2013)New Encoding for Translating Pseudo-Boolean Constraints into SAT., , and . SARA, AAAI, (2013)Grounding Formulas with Complex Terms., , , and . Canadian AI, volume 6657 of Lecture Notes in Computer Science, page 13-25. Springer, (2011)Declarative Programming of Search Problems with Built-in Arithmetic., and . IJCAI, page 942-947. (2009)Constructing Camin-Sokal Phylogenies Via Answer Set Programming., , , , , and . LPAR, volume 4246 of Lecture Notes in Computer Science, page 452-466. Springer, (2006)On the Complexity of Model Expansion., , , and . LPAR (Yogyakarta), volume 6397 of Lecture Notes in Computer Science, page 447-458. Springer, (2010)Minimum Witnesses for Unsatisfiable 2CNFs., and . SAT, volume 4121 of Lecture Notes in Computer Science, page 42-47. Springer, (2006)2-Way vs. d-Way Branching for CSP., and . CP, volume 3709 of Lecture Notes in Computer Science, page 343-357. Springer, (2005)Clause-Learning for Modular Systems., and . LPNMR, volume 9345 of Lecture Notes in Computer Science, page 446-452. Springer, (2015)Resolution Complexity of Random Constraints.. CP, volume 2470 of Lecture Notes in Computer Science, page 295-309. Springer, (2002)