Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  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...)  
 
Options:
 
  1-10 of 76 Reviews about "Logic And Constraint Programming (F.4.1...)": Date Reviewed
  Probability logics: probability-based formalization of uncertain reasoning
Ognjanović Z., Rašković M., Marković Z., Springer International Publishing, New York, NY, 2016. 215 pp.  Type: Book (978-3-319470-11-5)

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 h...

Jun 5 2017
  Completeness and decidability results for CTL in constructive type theory
Doczkal C., Smolka G. Journal of Automated Reasoning 56(3): 343-365, 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...

Jul 15 2016
  Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
Caleiro C., Marcos J., Volpe M. Theoretical Computer Science 603(C): 84-110, 2015.  Type: Article

More and more computer science applications demand the extension of classical logic with its bivalent (two-valued) semantics to “many-valued” logics that provide larger sets of truth values. Among these, the class o...

Jan 13 2016
  Constraint programming and decision making
Ceberio M., Kreinovich V., Springer Publishing Company, Incorporated, New York, NY, 2014. 200 pp.  Type: Book (978-3-319042-79-4)

Constraint programming plays an ever more important role in many real-life applications that require automated decision making. This somewhat poorly edited collection of papers attempts to bridge the gap between researchers working on ...

Nov 5 2014
  Constraint handling rules: current research topics
Schrijvers T. (ed), Frühwirth T. (ed), Springer Publishing Company, Incorporated, 2009. 245 pp.  Type: Book (9783540922421)

This is a selection of papers that represents current work in constraint handling rules (CHR), a logic programming language. I appreciated a small number of papers that are longer than the standard conference paper, as it enabled topic...

May 4 2009
  Design of financial CDO squared transactions using constraint programming
Flener P., Pearson J., Reyna L., Sivertsson O. Constraints 12(2): 179-205, 2007.  Type: Article

A specific problem in financial optimal design is addressed in this paper: the construction of collateralized debt obligation (CDO) transactions with minimum overlapping between two tranches. A CDO is divided into tranches, each consis...

Jan 7 2008
  Efficient solving of quantified inequality constraints over the real numbers
Ratschan S. ACM Transactions on Computational Logic 7(4): 723-748, 2006.  Type: Article

The problem of solving quantified constraints over real numbers is, in general, undecidable when allowing function symbols such as sin or cosine. However, Ratschan presents an algorithm that nevertheless almost always terminates, excep...

Apr 23 2007
  Recent advances in constraints: Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, Uppsala, Sweden, June 2005 (Lecture Notes in Artificial Intelligence 3978)
Hnich B., Carlsson M., Fages F., Dechter R., Springer-Verlag New York, Inc., Secaucus, NJ, 2006. 179 pp.  Type: Book (9783540342151)

The concept of constraint processing, as addressed by this book, includes global constraints (three papers), search and heuristics (four papers), language and implementation issues (two papers), and modeling (three papers). A remarkabl...

Apr 17 2007
  Propositional satisfiability and constraint programming: a comparative survey
Bordeaux L., Hamadi Y., Zhang L. ACM Computing Surveys 38(4): 12-es, 2006.  Type: Article

Although satisfiability (SAT) and constraint programming (CP) problems can intuitively be seen as somewhat close to each other, the truth is that both types of problems are approached in rather different ways by completely different sc...

Apr 4 2007
  Selectors make set-based analysis too hard
Meunier P., Findler R., Steckler P., Wand M. Higher-Order and Symbolic Computation 18(3-4): 245-269, 2005.  Type: Article

Neither the title of this paper, its abstract, nor even the name of the journal in which it appears clearly explain that it mainly discusses the programming language Scheme. A specialist in this area would probably know that this journ...

Nov 3 2006
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy