The report addresses the basic problems of the Arabic language formalization based on analysis of linguistic errors in software products. Reviewing the principles of modern information systems operation the authors come to the conclusion that the existing methods of the Arabic formalization allow to note a shift towards the technological aspects of the linguistic processing of facts, however, t...

In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, hospital scheduling and the domain described in this paper: distributed sensor networks. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem and a general so...

Nowadays, the computer vision community conducts an effort to produce canny systems able to tackle unconstrained environments. However, the information contained in images is so massive that fast and reliable knowledge extraction is impossible without restricting the range of expected meaningful signals. Inserting a priori knowledge on the operative “context” and adding expectations on object a...

Till now, a large variety of researchers have carried out lots of efforts on object-oriented and UML model metrics from different views. They put forward numerous of metrics and carried out some series of theoretical and experimental verifications on understandability, analyzability, maintainability, fault-proneness, change-proneness and reuse. However, there is no formal semantic specification...

The traditional approach for solving Constraint satisfaction Problems (CSPs) is searching the Assignment Space in which each state represents an assignment to some variables. This paper suggests a new search space formalization for CSPs, the Partial Domain Search Tree (PDST). In each PDST node a unique subset of the original domain is considered, values are excluded from the domains in each nod...

In this project, a rather complete proof-theoretical formalization of Lambek Calculus (non-associative with arbitrary extensions) has been ported from Coq proof assistent to HOL4 theorem prover, with some improvements and new theorems. Three deduction systems (Syntactic Calculus, Natural Deduction and Sequent Calculus) of Lambek Calculus are defined with many related theorems proved. The equiva...

We present the state of the art of the development of dynamic energy budget theory, and its expected developments in the near future within the molecular, physiological and ecological domains. The degree of formalization in the set-up of the theory, with its roots in chemistry, physics, thermodynamics, evolution and the consistent application of Occam's razor, is discussed. We place the various...

This paper describes morphdb.hu, a Hungarian lexical database and morphological grammar. Morphdb.hu is the outcome of a severalyear collaborative effort and represents the resource with the widest coverage and broadest range of applicability presently available for Hungarian. The grammar resource is the formalization of well-founded theoretical decisions handling inflection and productive deriv...