Fundamenta Informaticae - Volume 16, issue 1

Article Type: Other

DOI: 10.3233/FI-1992-16101

Citation: Fundamenta Informaticae, vol. 16, no. 1, pp. i-vii, 1992

Authors: Rutten, J.J.M.M. | Zucker, J.I.

Article Type: Research Article

Abstract: In the semantic framework of metric process theory, we undertake a general investigation of fairness of processes from two points of view: (1) intrinsic fairness of processes, and (2) fair operations on processes. Regarding (1), we shall define a “fairification” operation on processes called Fair such that for every (generally unfair) process p the process Fair(p) is fair, and contains precisely those paths of p that are fair. Its definition uses systematic alternation of random choices. The second part of this paper treats the notion of fair operations on processes: suppose given an operator on processes (like merge, or infinite …iteration), we want to define a fair version of it. For the operation of infinite iteration we define a fair version, again by a “fair scheduling” technique. Show more

Keywords: Fairness, semantic domains of metric processes, fair infinite iteration, alternation of random choices

DOI: 10.3233/FI-1992-16102

Citation: Fundamenta Informaticae, vol. 16, no. 1, pp. 1-38, 1992

Authors: Leischner, Martin

Article Type: Research Article

Abstract: For a semantics SEM of a logical language L an associated semantics S E M ˆ is constructed by topological means such that the compactness theorem is true in S E M ˆ . The formulas in L , which are valid with respect to SEM , are identical to the formulas which are valid with respect to S E M ˆ . The concepts developed in the paper are illustrated by examples from the field of propositional temporal logics.

DOI: 10.3233/FI-1992-16103

Citation: Fundamenta Informaticae, vol. 16, no. 1, pp. 39-57, 1992

Authors: Gelfond, Michael | Przymusinska, Halina

Article Type: Research Article

Abstract: In this paper we expand the results on existence and uniqueness of stable autoepistemic expansions for finite stratified autoepistemic theories to the infinite case. We also introduce a notion of the closed world completion of autoepistemic theory T, which can be viewed as an autoepistemic version of Closed World Assumption. We describe a class of autoepistemic theories called strongly stratified and prove that closed world completions of such theories have consistent stable autoepistemic expansions.

DOI: 10.3233/FI-1992-16104

Citation: Fundamenta Informaticae, vol. 16, no. 1, pp. 59-92, 1992

Authors: Mäkinen, Erkki

Article Type: Research Article

Abstract: This note studies the conjecture that context-free matrix languages over one-letter alphabet are regular. We are able to confirm the conjecture in a special case where at most one non terminal can have an unbounded number of occurrences in sentential forms.

DOI: 10.3233/FI-1992-16105

Citation: Fundamenta Informaticae, vol. 16, no. 1, pp. 93-97, 1992