A powerful approach to finding errors in computer software is to translate a given program into a verification condition, a logical formula that is valid if and only if the program is free of the classes of errors under consideration. Finding errors in the program is then done by mechanically searching for counterexamples to the verification condition. This paper gives an overview of the techno...

1. Introduction Not all words, real or novel, are created equal — some sound better than others, either for phonological or for morphological reasons. That is, well-formedness is a gradient notion. One simple way to measure gradient well-formedness is through acceptability ratings. For example, native English speakers generally agree that there are several conceivable past tenses for the made-u...

This paper proposes a method of integrating two different concepts of belief in artificial intelligence: belief as a probability distribution and belief as a logical formula. The setting for the integration is a highly expressive logic. The integration is explained in detail, as its comparison to other approaches to integrating logic and probability. An illustrative example is given to motivate...

We present a method for region identification in multiple images. A set of regions in different images and the correspondences on their boundaries can be thought of as a boundary in the multi-dimensional space formed by the product of the individual image domains. We minimize an energy functional on the space of such boundaries, thereby identifying simultaneously both the optimal regions in eac...

at the basis of worshiping by humans and all other being a deity is revealed. that means there is a god who is also the creator and the only one .he is beyond time and cannot be imagined in particular space. only the relationship of man with his god satisfies his need to worship, for this relationship is the way to reach to the presence of one god. reaching god does not come from man’s need to ...

We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols actually occurring in the rules of the system. Or equivalently, termination of a term rewrite system is preserved under signature extensions. We did not directly formalize the existing proofs for this well-known result, but de...

A learning program produces, as its output, a boolean function which describes a concept. The function returns true if and only if the argument is an object which satisfies the logical expression in the body of the function. The learning program's input is a set of objects which are instances of the concept to be learnt. A compiler/interpreter has been written which performs the reverse of the ...

It is important to note that in most cases, software correctness verification, as described by Richard Linger is informed by correctness questions where mathematical verification follows (if necessary). A popular approach in software correctness verification is the translation of a specific program as well as its criteria of correctness into a mathematical logical formula and in this regard all...

Hiroshi Sakaki Meisei University 2-590 Nagabuchi Ohme-shi Tokyo 198-8655 Japan [email protected] Summary This paper aims to construct concentrated modification structure from logical formula. First the matrix expression is extracted from the logical formula. Then, the matrix is transformed into geometrical structure called dependency structure equivalent to the former. Finally modificati...