An algorithm of calculation of lower solutions of fuzzy relational equations.
This paper deals with the problem of the determination of lower solutions of fuzzy relational equations. An algorithm of calculation of such a solution is presented.
An application of logical-probabilistic expressions to the realization of stochastic automata
An approach to solve a fuzzy bi-objective multi-index fixed charge transportation problem
In this paper, we propose a novel approach for solving a fuzzy bi-objective multi-index fixed-charge transportation problem where the aim is to minimize two objectives: the total transportation cost and transportation time. The parameters of the problem, such as fixed cost, variable cost, and transportation time are represented as fuzzy numbers. To extract crisp values from these parameters, a linear ranking function is used. The proposed approach initially separates the main problem into sub-problems....
An axiom system for full -dimensional Euclidean geometry
We present an axiom system for class of full Euclidean spaces (i.e. of projective closures of Euclidean spaces) and prove the representation theorem for our system, using connections between Euclidean spaces and elliptic planes.
An axiom system for incidence spatial geometry.
Incidence spatial geometry is based on three-sorted structures consisting of points, lines and planes together with three intersort binary relations between points and lines, lines and planes and points and planes. We introduce an equivalent one-sorted geometrical structure, called incidence spatial frame, which is suitable for modal considerations. We are going to prove completeness by SD-Theorem. Extensions to projective, affine and hyperbolic geometries are also considered.
An Axiomatics for Hyperbolic Projective-Metric Planes in Terms of Lines and Orthogonality
Hyperbolic projective-metric planes, first axiomatized by R. Lingenberg [7], are shown to be axiomatizable in terms of lines and orthogonality.
An axiomatization of extensional probability measures
An explicit basis for the admissible inference rules in the Gödel-Löb logic GL.
An explicit basis for the admissible inference rules of the modal logics extending S4.1 and Grz.
An extension method for t-norms on subintervals to t-norms on bounded lattices
In this paper, a construction method on a bounded lattice obtained from a given t-norm on a subinterval of the bounded lattice is presented. The supremum distributivity of the constructed t-norm by the mentioned method is investigated under some special conditions. It is shown by an example that the extended t-norm on from the t-norm on a subinterval of need not be a supremum-distributive t-norm. Moreover, some relationships between the mentioned construction method and the other construction...
An extension of the Kreisel-Putman system.
An extension of the ordering based on nullnorms
In this paper, we generally study an order induced by nullnorms on bounded lattices. We investigate monotonicity property of nullnorms on bounded lattices with respect to the -partial order. Also, we introduce the set of incomparable elements with respect to the F-partial order for any nullnorm on a bounded lattice. Finally, we investigate the relationship between the order induced by a nullnorm and the distributivity property for nullnorms.
An extension of the probability logic
An ILP model for a monotone graded classification problem
Motivation for this paper are classification problems in which data can not be clearly divided into positive and negative examples, especially data in which there is a monotone hierarchy (degree, preference) of more or less positive (negative) examples. We present a new formulation of a fuzzy inductive logic programming task in the framework of fuzzy logic in narrow sense. Our construction is based on a syntactical equivalence of fuzzy logic programs FLP and a restricted class of generalised annotated...
An implementation of the induction rule into resolution procedures for automatic theorem proving.
An inheritance criterion for the admissible inference rules of K4.
An inquiry-based method for Choquet integral-based aggregation of interface usability parameters
The concept of usability of man-machine interfaces is usually judged in terms of a number of aspects or attributes that are known to be subject to some rough correlations, and that are in many cases given different importance, depending on the context of use of the application. In consequence, the automation of judgment processes regarding the overall usability of concrete interfaces requires the design of aggregation operators that are capable of modeling approximate or ill-defined interactions...
An intensional approach to questions
An introduction to algorithmic logic. Metamathematical investigations in the theory of programs
An intuitionistic logic with probablistic operators.