Fundamenta Informaticae - Volume 33, issue 1

Authors: Czaja, Ludwik

Article Type: Research Article

Abstract: It is shown that minimal-time singly-valued (counterparts of 1-safe Petri nets) cause-effect (c-e) structures are of the same expressive power as no-time singly-valued c-e structures, while maximal-time multi-valued c-e structures are of essentially greater expressive power than no-time multi-valued c-e structures.

DOI: 10.3233/FI-1998-33101

Citation: Fundamenta Informaticae, vol. 33, no. 1, pp. 1-16, 1998

Authors: Czaja, Ludwik

Article Type: Research Article

DOI: 10.3233/FI-1998-33102

Citation: Fundamenta Informaticae, vol. 33, no. 1, pp. 17-42, 1998

Authors: Dimov, Georgi | Vakarelov, Dimiter

Article Type: Research Article

Abstract: The notion of Scott consequence system (briefly, S-system) was introduced by D. Vakarelov in [32] in an analogy to a similar notion given by D. Scott in [26]. In part one of the paper we study the category SSyst of all S-systems and all their morphisms. We show that the category DLat of all distributive lattices and all lattice homomorphisms is isomorphic to a reflective full subcategory of the category SSyst. Extending the representation theory of D. Vakarelov [32] for S-systems in P-systems, we develop an isomorphism theory for S-systems and for Tarski consequence systems. In part two of the …paper we prove that the separation theorem for S-systems is equivalent in ZF to some other separation principles, including the separation theorem for filters and ideals in Boolean algebras and separation theorem for convex sets in convexity spaces. Show more

DOI: 10.3233/FI-1998-33103

Citation: Fundamenta Informaticae, vol. 33, no. 1, pp. 43-70, 1998

Authors: Schmitt, Vincent

Article Type: Research Article

Abstract: In this paper CR-structures are introduced. They consist of a slight generalization of general event structures [16], and supply a representation theorem for concurrency domains, – which are called here CR-domains for short. We recall that the latter domains are exactly the unfoldings of concurrent automata [7],[3]. This result also generalizes Droste's characterization of domains of configurations of general event structures [6].

Keywords: Event structures, CR-structures, domains, concurrent automata

DOI: 10.3233/FI-1998-33104

Citation: Fundamenta Informaticae, vol. 33, no. 1, pp. 71-83, 1998

Authors: Vigneron, Laurent

Article Type: Research Article

Abstract: We present a non-exhaustive state of the art in the domain of deduction in first-order logic with equality, describing different strategies introduced over the years: strategies for selecting deduction steps, for eliminating redundant information, for delaying the resolution of unsolved or too difficult problems, for applying deductions with built-in properties. We also present the system daΤac that implements our deduction techniques modulo associative-commutative properties. Finally we detail an application of those techniques to the study of non-classical logics, work realised in collaboration with Prof. Wasilewska (Stony Brook University, New York).

Keywords: automated deduction, theorem proving, equational theories, first-order logic, constraint deduction, modal logic, rough sets

DOI: 10.3233/FI-1998-33105

Citation: Fundamenta Informaticae, vol. 33, no. 1, pp. 85-103, 1998