Your search for: 'author:("Orłowska, Ewa")' has returned 19 results. (0.008s) Save search

Authors: Orłowska, Ewa

Article Type: Research Article

Abstract: The central method employed today for theorem-proving is the resolution method introduced by J. A. Robinson in 1965 for the classical predicate calculus. Since then many improvements of the resolution method have been made. On the other hand, treatment of automated theorem-proving techniques for non-classical logics has been started, in connection with applications of these logics in computer science. In this paper a generalization of a notion of the resolution principle is introduced and discussed. A certain class of first order logics is considered and deductive systems of these logics with a resolution principle as an inference rule are investigated. …The necessary and sufficient conditions for the so-called resolution completeness of such systems are given. A generalized Herbrand property for a logic is defined and its connections with the resolution-completeness are presented. A class of binary resolution systems is investigated and a kind of a normal form for derivations in such systems is given. On the ground of the methods developed the resolution system for the classical predicate calculus is described and the resolution systems for some non-classical logics are outlined. A method of program synthesis based on the resolution system for the classical predicate calculus is presented. A notion of a resolution-interpretability of a logic L in another logic L ′ is introduced. The method of resolution-interpretability consists in establishing a relation between formulas of the logic L and some sets of formulas of the logic L ′ with the intention of using the resolution system for L ′ to prove theorems of L . It is shown how the method of resolution-interpretability can be used to prove decidability of sets of unsatisfiable formulas of a given logic. Show more

Keywords: classical predicate calculus, ω+-valued logic, resolution principle, Herbrand’s theorem, completeness, decidability, program synthesis

DOI: 10.3233/FI-1980-3209

Citation: Fundamenta Informaticae, vol. 3, no. 2, pp. 235-268, 1980

Authors: Orłowska, Ewa

Article Type: Research Article

Abstract: A model of information systems such that data depend on a state of the system is introduced. A logic is developed enabling us to define query languages for such systems.

Keywords: information system, query language, tense logic, Boolean algebra

DOI: 10.3233/FI-1982-5106

Citation: Fundamenta Informaticae, vol. 5, no. 1, pp. 101-118, 1982

Authors: Orłowska, Ewa

Article Type: Research Article

DOI: 10.3233/FI-1980-3306

Citation: Fundamenta Informaticae, vol. 3, no. 3, pp. 333-361, 1980

Authors: Orłowska, Ewa

Article Type: Research Article

Abstract: A resolution-style theorem proving system for the ω + -valued Post logic is developed. The soundness and the completeness of the system are proved. The two versions of the Herbrand theorem for the logic considered are given.

Keywords: theorem proving, resolution, ω+-valued Post logic, Herbrand theorem, semantic tree

DOI: 10.3233/FI-1978-2102

Citation: Fundamenta Informaticae, vol. 2, no. 1, pp. 1-15, 1978

Authors: Orlowska, Ewa

Article Type: Research Article

Abstract: Algebraic methods of proving database constraints are proposed. The first method is based on the formulation of constraints in terms of inclusions of some binary relations associated with database. The relations are generated by indiscernibility relations by means of the operations of the algebra of binary relations. The second method is based on the matrix representation of constraints.

DOI: 10.3233/FI-1987-10104

Citation: Fundamenta Informaticae, vol. 10, no. 1, pp. 57-68, 1987

Authors: Orłowska, Ewa

Article Type: Research Article

Abstract: In the paper we suggest an approach to proving global properties of structured states by using languages with special modal operators reflecting an internal structure of these states.

Keywords: program logic, modal logic

DOI: 10.3233/FI-1984-7309

Citation: Fundamenta Informaticae, vol. 7, no. 3, pp. 349-355, 1984

Authors: Orłowska, Ewa

Article Type: Research Article

Abstract: In the paper we consider dependencies of attributes in Pawlak’s model of information systems. We develop a logic which enables us to express and to prove dependencies. We present a Gentzen-style deduction system for the logic.

Keywords: information system, dependencies of attributes, propositional logic, lattice

DOI: 10.3233/FI-1983-63-403

Citation: Fundamenta Informaticae, vol. 6, no. 3-4, pp. 247-256, 1983

Authors: Orłowska, Ewa

Article Type: Research Article

Abstract: The purpose of the present paper is to give a logical framework which provides a uniform description of Pawlak’s information systems of deterministic, nondeterministic, and many-valued information. A language is introduced for representing and retrieving information. Logical aspects of dynamics of information systems are discussed.

Keywords: information system, deterministic information, nondeterministic information, many-valued information, information, query language, predicate logic

DOI: 10.3233/FI-1985-83-406

Citation: Fundamenta Informaticae, vol. 8, no. 3-4, pp. 359-378, 1985

Authors: Niwiński, Damian | Orłowska, Ewa

Article Type: Other

DOI: 10.3233/FI-2017-1607

Citation: Fundamenta Informaticae, vol. 156, no. 3-4, pp. i-ii, 2017

Authors: Hartonas, Chrysafis | Orłowska, Ewa

Article Type: Research Article

Abstract: We study general lattices with normal unary operators for which we prove relational representation and duality results. Similar results have appeared in print, using Urquhart’s lattice representation, by the second author with Vakarelov, Radzikowska and Rewitzky. We base our approach in this article on the Hartonas and Dunn lattice duality, proven by Gehrke and Harding to deliver a canonical lattice extension, and on recent results by the first author on the relational representation of normal lattice operators. We verify that the operators at the representation level (appropriately generated by relations) are the canonical extensions of the lattice operators, in Gehrke …and Harding’s sense. Show more

DOI: 10.3233/FI-2019-1793

Citation: Fundamenta Informaticae, vol. 166, no. 1, pp. 29-56, 2019