Topic models have been used successfully for a variety of problems, often in the form of applicationspecific extensions of the basic Latent Dirichlet Allocation (LDA) model. Because deriving these new models in order to encode domain knowledge can be difficult and time-consuming, we propose the Fold·all model, which allows the user to specify general domain knowledge in First-Order Logic (FOL)....

Both firstand second-order logic (FOL and SOL, respectively) as we use them today were arguably created by Frege in his Begriffsschrift – if we ignore the notational differences. SOL also suggests itself as a natural, and because of its much greater strength, desirable extension of FOL. But at least since W. V. Quine’s famous claim that SOL is “set theory in sheep’s clothing” it is widely held ...

Semantic Web data management raises the challenge of answering queries under constraints (i.e., in the presence of implicit data). To bridge the gap between this extended setting and that of query evaluation provided by database engines, a reasoning step (w.r.t. the constraints) is necessary before query evaluation. A large and useful set of ontology languages enjoys FOL reducibility of query a...

The vascular fusariosis is one of the main obstacles in tomato crop production. Currently, management nutrient solution presented as a control option for fusariosis, such reason different solutions with nitrogen (N), phosphorus (P), potassium (K) and calcium (Ca) modifications; four saladette varieties Bony Best (BB), Manapal (M), Walter (W) FLA were evaluated this research, order to analyze da...

Bu çal??mada, domateste baz? hastal?k ve zararl?lar için geli?tirilen SCAR CAPS markörlerinin moleküler markör destekli seleksiyon çal??malar?nda geçerlili?ini kontrol etmek amaçlanm??t?r. amaçla Domates lekeli solgunluk virüsü (TSWV), Fusarium solgunlu?u (FOL), yaprak k?v?rc?kl??? (TYLCV), kök-ur nematodu (RKN), gibi zararl?lara dayan?kl?l?k geli?tirilmi? olan markörler test edilmi?tir. markör...

The main goal of this paper is to present the basis for a heterogeneous Euler/Venn diagram and First Order Logic (FOL) reasoning system. We will begin by defining a homogeneous reasoning system for Euler/Venn diagrams including named constants and show this system to be sound and complete. Then we will propose a heterogeneous rule of inference allowing the extraction of formulas of FOL from an ...

Learning in first-order logic (FOL) languages suffers from a specific difficulty: both induction and classification are potentially exponential in the size of hypotheses. This difficulty is usually dealt wi th by l imit ing the size of hypotheses, via either syntactic restrictions or search strategies. This paper is concerned with polynomial induction and use of FOL hypotheses with no size rest...

Mathematics and computer science pervasively use logics formal languages for reasoning in. One of the most common is classical First-Order Logic with equality (FOL) [Bell and Machover, 1977, Gabbay and Günthner, 1986]. For example FOL is routinely used as a foundational tool to express Zermelo-Fraenkel set theory (ZF sets) [Johnstone, 1987, Machover, 1996] and thus as a (language to express) a ...

where ax depends only on X and nothing else. Also, for r1, r2 < 1, fo' ff(re219) f(r2e2tri) x dO -* 0 as (ri, r2) --(1, 1), and there exists a measurable function F(O) on the boundary r = e2'i0 such that, for 0 < r < 1, fol If(re2i0) F(O)lx do -0 as r -* 1. The quantity M(r) = fOIif(re ) | do is monotonely increasing in r. Using this, it is not hard to verify that Theorem 1 gives rise to the fo...

Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homomorphism called projection, whose semantics is usually given in terms of positive, conjunctive, existential FOL. We present here a family of extensions of this model, based on rules and constraints, keeping graph homom...