( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Unbounded Model-Checking with Interpolation for Regular Language Constraints.

, , , , и . TACAS, том 7795 из Lecture Notes in Computer Science, стр. 277-291. Springer, (2013)

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.

Marc Stuckey

Peter J Schmidt

Peter J Barth

Peter J Deneffe

Peter J Michael

 

Другие публикации лиц с тем же именем

Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches., , , и . CPAIOR, том 4510 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2007)A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects., , и . CPAIOR, том 7874 из Lecture Notes in Computer Science, стр. 340-346. Springer, (2013)Rail Capacity Modelling with Constraint Programming., и . CPAIOR, том 9676 из Lecture Notes in Computer Science, стр. 170-186. Springer, (2016)Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving.. CPAIOR, том 6140 из Lecture Notes in Computer Science, стр. 5-9. Springer, (2010)Termination Analysis with Types Is More Accurate., , и . ICLP, том 2916 из Lecture Notes in Computer Science, стр. 254-268. Springer, (2003)Just enough tabling., и . PPDP, стр. 78-89. ACM, (2004)Solving Set Constraint Satisfaction Problems using ROBDDs., , и . J. Artif. Intell. Res., (2005)Efficient Representation of Adhoc Constraints., , и . IJCAI, стр. 1368-1369. Morgan Kaufmann, (2003)Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions., , , , , , и . IJCAI, стр. 1078-1085. ijcai.org, (2019)Flexible, Rule-Based Constraint Model Linearisation., , , и . PADL, том 4902 из Lecture Notes in Computer Science, стр. 68-83. Springer, (2008)