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
  Tsiknis, George Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 4 of 4 reviews    
  A corrigendum for the optimized-IPIA
Kean A., Tsiknis G. Journal of Symbolic Computation 17(2): 181-187, 1994.  Type: Article

The main purpose of this paper is to correct an inaccurately reported algorithm. In 1990, the authors reported on an algorithm called IPIA, which incrementally generates the prime implicates/implicants of a set of clauses [1]. An impro...
...
Oct 1 1995  
  A logic for category theory
Gilmore P., Tsiknis G. Theoretical Computer Science 111(1-2): 211-252, 1993.  Type: Article

An excellent proposal for a natural-deduction-based set-theoretic semantics for category theory is presented. In the natural deduction logic NaDSet, only joint denial (neither nor) operators and universal ...
...
Sep 1 1994  
  Logical foundations for programming semantics
Gilmore P., Tsiknis G. Theoretical Computer Science 111(1-2): 253-290, 1993.  Type: Article

NaDSet, or natural-deduction-based set theory, was developed in several other papers mostly by the first author. In NaDSet, only names of sets, not the sets themselves, may be members of sets; this feature is essential for the introdu...
...
Jul 1 1994  
  An incremental method for generating prime implicants/implicates
Kean A., Tsiknis G. Journal of Symbolic Computation 9(2): 185-206, 1990.  Type: Article

We use our knowledge not only to predict new facts but to explain new observations. “Explain” sometimes means that this observation is a consequence of our existing knowledge, but to explain usually means to figure ...
...
Nov 1 1990  

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