
Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Mathematical Logic (F.4.1) > Logic And Constraint Programming (F.4.1...)









110 of 203
Reviews about "Logic And Constraint Programming (F.4.1...)":

Date Reviewed 

MRCPRM: a technique for resource allocation and scheduling of MapReduce jobs with deadlines Lim N., Majumdar S., AshwoodSmith P. IEEE Transactions on Parallel and Distributed Systems 28(5): 13751389, 2017. Type: Article In this paper, the authors discuss issues in scheduling (that is, match making) of job streams with endtoend servicelevel agreements (SLAs) with agreedupon quality of service (QoS) and allocation of resources in a distributed cloud environment...

Jun 9 2017 

Probability logics: probabilitybased formalization of uncertain reasoning Ognjanović Z., Rašković M., Marković Z., Springer International Publishing, New York, NY, 2016. 215 pp. Type: Book (9783319470115) Combinations of probability and logic have been a topic of interest since the seminal work of Boole [1], and they have always occupied a place of relevance in foundational studies of probability. However, the direction of development has been cons...

Jun 5 2017 

Completeness and decidability results for CTL in constructive type theory Doczkal C., Smolka G. Journal of Automated Reasoning 56(3): 343365, 2016. Type: Article The following sentence from the rather demanding introduction to this quite demanding paper reveals common ground between us users of formal methods and the expert authors of this paper: “Given the practical importance of CTL [computation tr...

Jul 15 2016 

Bivalent semantics, generalized compositionality and analytic classiclike tableaux for finitevalued logics Caleiro C., Marcos J., Volpe M. Theoretical Computer Science 603(C): 84110, 2015. Type: Article More and more computer science applications demand the extension of classical logic with its bivalent (twovalued) semantics to “manyvalued” logics that provide larger sets of truth values. Among these, the class of finitevalued logi...

Jan 13 2016 

Constraint programming and decision making Ceberio M., Kreinovich V., Springer Publishing Company, Incorporated, New York, NY, 2014. 200 pp. Type: Book (9783319042794) Constraint programming plays an ever more important role in many reallife applications that require automated decision making. This somewhat poorly edited collection of papers attempts to bridge the gap between researchers working on constraint p...

Nov 5 2014 

Constraints meet concurrency Mauro J., Atlantis Publishing Corporation, Paris, France, 2014. 170 pp. Type: Book (9789462390669) Constraintbased execution and concurrency are valuable allies, but they are not natural ones. This book examines ways in which constraints and concurrency can be brought into harmony. The results reported show how constraints can be trimmed for p...

Oct 1 2014 

A framework for testing firstorder logic axioms in program verification Ahn K., Denney E. Software Quality Journal 21(1): 159200, 2013. Type: Article As modeldriven code generators have increased in capability and in performance, so too has their use in missioncritical software development. One benefit of autogenerated code over handcrafted, individually created source code is that it is sim...

Jun 4 2014 

The complexity of the list homomorphism problem for graphs Egri L., Krokhin A., Larose B., Tesson P. Theory of Computing Systems 51(2): 143178, 2012. Type: Article Homomorphisms are very useful in combinatorial problems in mapping and assignments. Homomorphism problems involve greater modeling power than graph coloring, yet compared to general constraint satisfaction problems (CSPs), they are simple and easy...

May 8 2013 

WSMOMX: a hybrid semantic Web service matchmaker Klusch M., Kaufer F. Web Intelligence and Agent Systems 7(1): 2342, 2009. Type: Article Service discovery and selection are commonly performed using either logicbased semantic matching techniques or other nonlogicbased approaches, such as data mining, linguistic processing, or information retrieval. This paper takes a hybrid approa...

Jan 26 2010 

Heuristics for dynamically adapting propagation in constraint satisfaction problems Stergiou K. AI Communications 22(3): 125141, 2009. Type: Article Assume a set of variables pulling values from respective domains and a set of constraints they are supposed to satisfy, and you have a constraint satisfaction problem (CSP). Solving CSPs is not as easy as defining them. Due to the generality of th...

Nov 18 2009 





