Inference of the Definition of the Predicate Transformer wp with Occurrences of the Predicate Domain Based on Denotational Semantics of GCL on ZF Set Theory

Author(s):  
Federico Flaviani
2011 ◽  
Vol 11 (4-5) ◽  
pp. 611-627
Author(s):  
ANTÓNIO PORTO

AbstractProlog's very useful expressive power is not captured by traditional logic programming semantics, due mainly to the cut and goal and clause order. Several alternative semantics have been put forward, exposing operational details of the computation state. We propose instead to redesign Prolog around structured alternatives to the cut and clauses, keeping the expressive power and computation model but with a compositional denotational semantics over much simpler states—just variable bindings. This considerably eases reasoning about programs, by programmers and tools such as a partial evaluator, with safe unfolding of calls through predicate definitions. Anif-then-elseacross clauses replaces most uses of the cut, but the cut's full power is achieved by anuntilconstruct. Disjunction, conjunction anduntil, along with unification, are the primitive goal types with a compositional semantics yielding sequences of variable-binding solutions. This extends to programs via the usual technique of a least fixpoint construction. A simple interpreter for Prolog in the alternative language, and a definition ofuntilin Prolog, establish the identical expressive power of the two languages. Many useful control constructs are derivable from the primitives, and the semantic framework illuminates the discussion of alternative ones. The formalisation rests on a term language with variable abstraction as in the λ-calculus. A clause is an abstraction on the call arguments, a continuation, and the local variables. It can be inclusive or exclusive, expressing a local case bound to a continuation by either a disjunction or anif-then-else. Clauses are open definitions, composed (and closed) with simple functional application β-reduction). This paves the way for a simple account of flexible module composition mechanisms.Cube, a concrete language with the exposed principles, has been implemented on top of a Prolog engine and successfully used to build large real-world applications.


1999 ◽  
Vol 9 (5) ◽  
pp. 545-567 ◽  
Author(s):  
LAWRENCE C. PAULSON

A special final coalgebra theorem, in the style of Aczel (1988), is proved within standard Zermelo–Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions. Variant ordered pairs and tuples, of possibly infinite length, are special cases of variant functions. Analogues of Aczel's solution and substitution lemmas are proved in the style of Rutten and Turi (1993). The approach is less general than Aczel's, but the treatment of non-well-founded objects is simple and concrete. The final coalgebra of a functor is its greatest fixedpoint.Compared with previous work (Paulson, 1995a), iterated substitutions and solutions are considered, as well as final coalgebras defined with respect to parameters. The disjoint sum construction is replaced by a smoother treatment of urelements that simplifies many of the derivations.The theory facilitates machine implementation of recursive definitions by letting both inductive and coinductive definitions be represented as fixed points. It has already been applied to the theorem prover Isabelle (Paulson, 1994).


2012 ◽  
Vol 2012 ◽  
pp. 1-20 ◽  
Author(s):  
Shawkat Alkhazaleh ◽  
Abdul Razak Salleh

In 1999 Molodtsov introduced the concept of soft set theory as a general mathematical tool for dealing with uncertainty. Alkhazaleh et al. in 2011 introduced the definition of a soft multiset as a generalization of Molodtsov's soft set. In this paper we give the definition of fuzzy soft multiset as a combination of soft multiset and fuzzy set and study its properties and operations. We give examples for these concepts. Basic properties of the operations are also given. An application of this theory in decision-making problems is shown.


2018 ◽  
Vol 6 (5) ◽  
pp. 447-458
Author(s):  
Yizhou Chen ◽  
Jiayang Wang

Abstract On the basis of rough set theory, the strengths of dynamic reduction are elaborated compared with traditional non-dynamic methods. A systematic concept of dynamic reduction from sampling process to the generation of the reduct set is presented. A new method of sampling is created to avoid the defects of being too subjective. And in order to deal with the over-sized time consuming problem in traditional dynamic reduction process, a quick algorithm is proposed within the constraint conditions. We have also proved that dynamic core possesses the essential characteristics of a reduction core on the basis of the formalized definition of the multi-layered dynamic core.


Author(s):  
Debabrata Datta

Uncertainty analysis of any physical model is always an essential task from the point of decision making analysis. Two kinds of uncertainties exist: (1) aleatory uncertainty which is due to randomness of the parameters of models of interest and (2) the epistemic uncertainty which is due to fuzziness of the parameters of the same models. So far both these uncertainties are addressed independently; however since in any practical problem both the types of uncertain variables present, it is required to address them jointly. In order to solve practical problems on uncertainty modeling, it is required to replace the abstract definition of hybrid set by fuzzy random set. Since uncertainty modeling using fuzzy random set has not been carried out so far, the present chapter will address the utility of fuzzy random set for uncertainty modeling on geotechnical and hydrological applications. This chapter will present the fundamentals of fuzzy random set and their application in uncertainty analysis.


Author(s):  
Ludovic Liétard ◽  
Daniel Rocacher

This chapter is devoted to the evaluation of quantified statements which can be found in many applications as decision making, expert systems, or flexible querying of relational databases using fuzzy set theory. Its contribution is to introduce the main techniques to evaluate such statements and to propose a new theoretical background for the evaluation of quantified statements of type “Q X are A” and “Q B X are A.” In this context, quantified statements are interpreted using an arithmetic on gradual numbers from Nf, Zf, and Qf. It is shown that the context of fuzzy numbers provides a framework to unify previous approaches and can be the base for the definition of new approaches.


1998 ◽  
Vol 8 (1) ◽  
pp. 1-22 ◽  
Author(s):  
AMR SABRY

Functional programming languages are informally classified into pure and impure languages. The precise meaning of this distinction has been a matter of controversy. We therefore investigate a formal definition of purity. We begin by showing that some proposed definitions which rely on confluence, soundness of the beta axiom, preservation of pure observational equivalences and independence of the order of evaluation, do not withstand close scrutiny. We propose instead a definition based on parameter-passing independence. Intuitively, the definition implies that functions are pure mappings from arguments to results; the operational decision of how to pass the arguments is irrelevant. In the context of Haskell, our definition is consistent with the fact that the traditional call-by-name denotational semantics coincides with the traditional call-by-need implementation. Furthermore, our definition is compatible with the stream-based, continuation-based and monad-based integration of computational effects in Haskell. Finally, we observe that call-by-name reasoning principles are unsound in compilers for monadic Haskell.


1997 ◽  
Vol 07 (03) ◽  
pp. 329-356
Author(s):  
Maurad Debbabi

In this paper we address the problem of specification and design of concurrent systems. More accurately, we present the definition of a new specification language that is formal, wide-spectrum, model-based, concurrent, polymorphic and strongly implicitly typed. The language is built upon a concurrent, funtional and imperative programming language: Concurrent ML. Specification aspects are supported thanks to the addition of some specification constructs and also by allowing axioms to ML structures and signatures. The resulting specification language is thus highly expressive though it embodies a restricted number of concepts. We present here the motivations underlying the definition of such a language as well as the design choices. Furthermore, we introduce the specification and development methology and illustrate it on various examples. We will see that many specification styles are allowed: algebraic, applicative, state-based, concurrent applicative and concurrent imperative. We show that the language rests on secure theoretical foundations exemplified by formal syntactic and semantic definitions. The latter consists in a static semantics together with a dynamic semantics. The static semantics reconstructs not only principal types but also minimal side and communication effects. This is done thanks to an extension of the type and effect discipline. The language is also endowed with a dynamic denotational semantics. The underlying model is based on an extension of the acceptance trees model to handle value-passing, communication, assignment, sequencing, return of results and higher order objects.


1950 ◽  
Vol 15 (2) ◽  
pp. 103-112 ◽  
Author(s):  
Hao Wang

In mathematics, when we want to introduce classes which fulfill certain conditions, we usually prove beforehand that classes fulfilling such conditions do exist, and that such classes are uniquely determined by the conditions. The statements which state such unicity and existence of classes are in mathematical logic consequences of the principles of extensionality and class existence. In order to illustrate how these principles enable us to introduce classes into systems of mathematical logic, let us consider the manner in which Gödel introduces classes in his book on set theory.For instance, before introducing the definition of the non-ordered pair of two classesGödel puts down as its justification the following two axioms:By A4, for every two classesyandzthere exists at least one non-ordered pairwof them; and by A3,wis uniquely determined in A4.


Sign in / Sign up

Export Citation Format

Share Document