Fusarium oxysporum is an ascomycetous fungus that is well-known as a soilborne plant pathogen. In addition, a large population of nonpathogenic F. oxysporum (NPF) inhabits various environmental niches, including the phytosphere. To obtain an insight into the origin of plant pathogenic F. oxysporum, we focused on the tomato (Solanum lycopersicum) and its pathogenic F. oxysporum f. sp. lycopersic...

We describe the isolation and characterization of a Pediococcus cerevisiae thymidine-requiring mutant and its thymidine-independent revertant. The mutant strain lacked thymidylate synthetase activity and had an absolute requirement for low concentrations (2 micrograms/ml) of thymidine in addition to a requirement for N-5-formyl tetrahydrofolic acid (folinate). Even at high concentrations (up to...

The core of temporal logic model checking is the reachability problem, which is not expressible in first-order logic (FOL). Most model checking algorithms, both for finite and infinite Kripke structures, contain a loop that iterates to reach a fixed-point. As a result, reasoners with input languages no more expressive than FOL have been used iteratively for model checking rather than having the...

We are concerned with reasoning efficiently over large-scale commonsense knowledge bases (KBs). In this paper we report on a case study of reasoning with ResearchCyc, a large KB of everyday-world facts represented in a high-order logic. The contributions of this paper are two-fold. First, we present a translation of a large part (over 90%) of the ResearchCyc ontology into First-Order Logic (FOL...

Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a reactive system while LTL specifies its (dynamic) behavior. In this paper, we derive undecidability and deci...

We propose to build an automated reasoning system for first-order logic (FOL) by translating reasoning problems to a fragment of FOL called coherent logic (CL) and then solving them by a fast problem solver for CL. Both the translation and the fast CL solver are to be developed in the project. Automated reasoning in FOL is an established research field with many applications in mathematics, log...

A propositionalization of a theory in First-Order Logic (FOL) is a set of propositional sentences that is satisfiable iff the original theory is satisfiable. We cannot translate arbitrary FOL theories to propositional logic because FOL is only semi-decidable. However, when possible, it is often advantageous to do so because we can use optimized, efficient SAT solvers (e.g. [Moskewicz et al., 20...

The vascular wilt of tomato caused by Fusarium oxysporum f.sp. lycopersici is an important soil borne pathogen causes severe yield loss. The molecular characterization and their interaction with its host is necessary to develop a protection strategy. 20 isolates of F. oxysporum f.sp. lycopersici (FOL) were isolated from wilt infected tomato plants across Tamil Nadu. They were subjected to cultu...

In this paper we considered the extension of the First-order Logic (FOL) by Bealer’s intensional abstraction operator. Contemporary use of the term ’intension’ derives from the traditional logical Frege-Russell’s doctrine that an idea (logic formula) has both an extension and an intension. Although there is divergence in formulation, it is accepted that the extension of an idea consists of the ...