Description: This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various area...

Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of correct programs. In this paper, we describe an integration of both methods which combines their complementary benefits and alleviates some of their drawbacks. The core of our integration is an algorithm which automat...

samples of participants’ writing were scored by two raters using toefl writing scoring rubric. the readability index of each text was calculated through the use of six readability formulae and graphs, i.e., flesch-kincaid index, reading ease index, fog index, smog formula, fry’s graph, and dale-chall readability index. the scores given to each essay were later compared to the obtained readabili...

We show how the formalization and application of schemata for program development can be reduced to the formalization and application of derived rules of inference. We formalize and derive schemata as rules in theories that axiomatize program data and programs themselves. We reduce schema-based program development to ordinary theorem proving, where higher-order uniication is used to apply rules...

Effective application of AI techniques requires an understanding of how the representation vs. reasoning tradeoffs impact the domain of interest. In this paper we evaluate these tradeoffs for the software engineering problem of automatically retrieving components from a library. We generalize our experience in building several automated component retrieval and automated program synthesis system...

In this paper, we present a new methodology towards performing high-level synthesis. During high-level synthesis an algorithmic description is mapped to a structure of hardware components. In our approach, high-level synthesis is performed via program transformations. All transformations are performed within a higher order logic theorem prover thus guaranteeing correctness. Our approach is not ...

In this paper we explore ways of capturing well-formed patterns of recursion in the form of generic reductions. These reductions, called uniform traversal combinators, can substantially help the theorem proving process by eliminating the need for induction and can also be an aid in achieving eeective program synthesis.

This paper describes a method for proving termination of recursively de0ned functions based on ordinal measure. It generalizes a termination procedure developed by Manoury and Simonot initially for an automated program synthesis system called ProPre. For that, we associate ordinal functions to formal proofs made in the system and show that they follow a decreasing property. In this way, after h...

A synthetic strategy combining automated solid-phase chemical synthesis and enzymatic sialylation was developed to access α(2,3)-sialylated glycans.

This paper introduces Gesture Engine, an animation system that synthesizes human gesturing behaviors from augmented conversation transcripts using a database of highlevel gesture definitions. An abstract scripting language to specify hand-arm gestures is introduced that incorporates knowledge from sign language research, psycholinguistics, and traditional keyframe animation. A new planning algo...