منابع مشابه
Partial Recursive Functions in Higher-Order Logic
Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for them. Our method expresses termination in a uniform manner and includes a very general form of pattern matching, where patterns can be arbitrary expressions. Termination proofs can be deferred, restricted to subsets of argument...
متن کاملPartial first-order logic relying on optimistic, pessimistic and average partial membership functions
One of the common features of decision–theoretic rough set models is that they rely on total background (available) knowledge in the sense that the knowledge covers the discourse universe. In the proposed framework the author gives up this requirement and allows that available knowledge about the discourse universe may be partial. It is shown by introducing optimistic, average and pessimistic p...
متن کاملPartial First-order Logic with Approximative Functors Based on Properties
In the present paper a logically exact way is presented in order to define approximative functors on object level in the partial first–order logic relying on approximation spaces. By the help of defined approximative functors one can determine what kind of approximations has to be taken into consideration in the evaluating process of a formula. The representations of concepts (properties) of ou...
متن کاملPartial Order Logic Programmingy
This paper shows the use of partial-order assertions and lattice domains for logic programming. We illustrate the paradigm using a variety of examples, ranging from program analysis to deductive databases. These applications are characterized by a need to solve circular constraints and perform aggregate operations. We show in this paper that deening functions with subset assertions and, more ge...
متن کاملA First-order Logic for String Diagrams
Equational reasoning with string diagrams provides an intuitive means of proving equations between morphisms in a symmetric monoidal category. This can be extended to proofs of infinite families of equations using a simple graphical syntax called !-box notation. While this does greatly increase the proving power of string diagrams, previous attempts to go beyond equational reasoning have been l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90005-3