•  27
    Logics of binary relations corresponding, among others, to the class RRA of representable relation algebras and the class FRA of full relation algebras are presented together with the proof systems in the style of dual tableaux. Next, the logics are extended with relational constants interpreted as point relations. Applications of these logics to reasoning in non-classical logics are recalled. An example is given of a dual tableau proof of an equation which is RRA-valid, while not RA-valid.
  • List of participants 17 Robert K. Meyer (Camberra, Australia) Barbara Morawska (Gdansk, Poland) Daniele Mundici (Milan, Italy)
    with Kazumi Nakamatsu, Marek Nasieniewski, Volodymyr Navrotskiy, Sergey Pavlovich Odintsov, Carlos Oiler, Mieczyslaw Omyla, Hiroakira Ono, Katarzyna Palasihska, and Francesco Paoli
    Logic and Logical Philosophy 7 16. 2001.
  •  5
    This book presents the refereed proceedings of the Sixth European Workshop on Logics in Artificial Intelligence, JELIA '96, held in Evora, Portugal in September/October 1996. The 25 revised full papers included together with three invited papers were selected from 57 submissions. Many relevant aspects of AI logics are addressed. The papers are organized in sections on automated reasoning, modal logics, applications, nonmonotonic reasoning, default logics, logic programming, temporal and spatial …Read more
  •  17
    Foreword
    with Alberto Policriti and Andrzej Szalas
    Journal of Applied Non-Classical Logics 16 (3-4): 249-250. 2006.
    No abstract
  •  8
    A Relational Formalisation Of Arbitrary Finite Valued Logics
    with B. Konikowska and C. Morgan
    Logic Journal of the IGPL 6 (5): 755-774. 1998.
    A method of developing a relational semantics and relational proof systems for many-valued logics based on finite algebras of truth values is presented. The method is applied to Rosser-Turquette logic, logics based on symmetric Heyting algebras with operators and a Post-style logic
  •  49
    Relational proof systems for spatial reasoning
    with Joanna Golińska-Pilarek
    Journal of Applied Non-Classical Logics 16 (3-4): 409-431. 2006.
    We present relational proof systems for the four groups of theories of spatial reasoning: contact relation algebras, Boolean algebras with a contact relation, lattice-based spatial theories, spatial theories based on a proximity relation
  • Logic of vague concepts
    Bulletin of the Section of Logic 11 (3-4): 115-126. 1982.
    This paper contains a logic enabling us to reason in the presence of vague- ness phenomena. We consider an epistemological vagueness of concepts caused by the unavailability of total information about a continuous world which we describe in observational terms. Lack of information is manifested by the existence of borderline cases for concepts. Since we are unable to perceive concepts exactly, we cannot establish a sharp boundary between an extension of a concept and its complement. Some results…Read more
  • Three aspects of verisimilitude. Part II
    Bulletin of the Section of Logic 16 (4): 140-147. 1987.
    In the following two sections we propose ordering relations for which the material for comparison of theories of concepts the theories deal with. The relations refer to what is called concept analysis. In the present section we introduce relations enabling us to compare theories from the point of view of the following aspect: How well the theories in question classify objects into positive and negative instances of concepts. Classifications of objects provided by a theory can be correct or incorr…Read more
  • Three aspects of verisimilitude. Part I
    Bulletin of the Section of Logic 16 (3): 96-103. 1987.
    One of the generalizations of R. W´ojcicki’s concept of referential matrix is so-called pseudo-referential matrix. G. Malinowski, who introduced that concept, also considers a particular case of pseudo-referential matrices called discrete pseudo-referential matrices. In this note we want to show how any generalized matrix determines a semantically equivalent discrete pseudo-referential matrix.
  •  18
    Obituary Zdzislaw Pawlak (1926–2006)
    Journal of Applied Non-Classical Logics 17 (1): 7-8. 2007.
    No abstract
  •  39
    Logic For Reasoning About Knowledge
    Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (6): 559-572. 1989.
    One of the important issues in research on knowledge based computer systems is development of methods for reasoning about knowledge. In the present paper semantics for knowledge operators is introduced. The underlying logic is developed with epistemic operators relative to indiscernibility. Facts about knowledge expressible in the logic are discussed, in particular common knowledge and joint knowledge of n group of agents. Some paradoxes of epistemic logic are shown to be eliminated in the given…Read more
  • A Logic With Relevant Inplication
    Bulletin of the Section of Logic 16 (1): 39-43. 1987.
    In Orlowska and Weingartner an approach to relevance was proposed based on the notion of sematic relevance criterion which is understood as a binary relation in the set of predicates of a language under consideration. Some general properties were investigated of sets of formulas relevant with respect to relevance criteria or sets of relevance criteria. Informally, a predicate P is relevant for a predicate Q whenever some information about instances of Q can be derived from information about inst…Read more
  •  18
    Dual tableau-based decision procedures for relational logics with restricted composition operator
    with Domenico Cantone and Marianna Nicolosi Asmundo
    Journal of Applied Non-Classical Logics 21 (2): 177-200. 2011.
    We consider fragments of the relational logic RL(1) obtained by posing various constraints on the relational terms involving the operator of composition of relations. These fragments allow to express several non classical logics including modal and description logics. We show how relational dual tableaux can be employed to provide decision procedures for each of them.
  • Resolution system for ω+-valued logic
    Bulletin of the Section of Logic 7 (2): 68-72. 1978.
  •  7
    Foreword
    Journal of Applied Non-Classical Logics 8 (1-2): 7-8. 1998.
  •  14
    Monoidal triangular norm logic MTL is the logic of left-continuous triangular norms. In the paper we present a relational formalization of the logic MTL and then we introduce relational dual tableau that can be used for verification of validity of MTL-formulas. We prove soundness and completeness of the system.
  • Logic For Reasoning About Knowledge
    Bulletin of the Section of Logic 16 (1): 26-36. 1987.
    One of the important issues in research on knowledge based computer systems is development of methods for reasoning about knowledge. In the present paper semantics for knowledge operators is introduced. The underlying logic is developed with epistemic operators relative to indiscernibility. Facts about knowledge expressible in the logic are discussed, in particular common knowledge and joint knowledge of n group of agents. Some paradoxes of epistemic logic are shown to be eliminated in the given…Read more
  •  21
    Dynamic logic with program specifications and its relational proof system
    Journal of Applied Non-Classical Logics 3 (2): 147-171. 1993.
    ABSTRACT Propositional dynamic logic with converse and test, is enriched with complement, intersection and relational operations of weakest prespecification and weakest postspecification. Relational deduction system for the logic is given based on its interpretation in the relational calculus. Relational interpretation of the operators ?repeat? and ?loop? is given
  •  6
    International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers Harrie de Swart. Dual residua of a lattice join were ... The dual residua of well— known t-conorms Definition 2. ([28], [29]) A double residuated lattice ...
  • Three Aspects of Verisimilitude'
    Bulletin of the Section of Logic 16 (3): 96-106. 1987.
    One of the generalizations of R. W´ojcicki’s concept of referential matrix is so-called pseudo-referential matrix . G. Malinowski, who introduced that concept, also considers a particular case of pseudo-referential matrices called discrete pseudo-referential matrices . In this note we want to show how any generalized matrix determines a semantically equivalent discrete pseudo-referential matrix
  • Interpretation of dynamic logic and its extensions in the relational calculus
    Bulletin of the Section of Logic 18 132-137. 1989.
  •  28
    Logics of similarity and their dual tableaux. A survey
    In Giacomo Della Riccia, Didier Dubois & Hans-Joachim Lenz (eds.), Preferences and Similarities, Springer. pp. 129--159. 2008.
    We present several classes of logics for reasoning with information stored in information systems. The logics enable us to cope with the phenomena of incompleteness of information and uncertainty of knowledge derived from such an information. Relational inference systems for these logics are developed in the style of dual tableaux.
  •  31
    A hierarchy of modal logics with relative accessibility relations
    with Philippe Balbiani
    Journal of Applied Non-Classical Logics 9 (2-3): 303-328. 1999.
    ABSTRACT In this paper we introduce and investigate various classes of multimodal logics based on frames with relative accessibility relations. We discuss their applicability to representation and analysis of incomplete information. We provide axiom systems for these logics and we prove their completeness