scholarly journals Forward and Backward Chaining with P Systems

2014 ◽  
pp. 149-158
Author(s):  
Sergiu Ivanov ◽  
Artiom Alhazov ◽  
Vladimir Rogojin ◽  
Miguel A. Gutiérrez-Naranjo
Keyword(s):  
Computer Science ◽  
Propositional Logic ◽  
Membrane Computing ◽  
Modus Ponens ◽  
The Other ◽  
P Systems ◽  
Backward Chaining ◽  
Other Hand

One of the concepts that lie at the basis of membrane computing is the multiset rewriting rule. On the other hand, the paradigm of rules is profusely used in computer science for representing and dealing with knowledge. Therefore, establishing a “bridge” between these domains is important, for instance, by designing P systems reproducing the modus ponens-based forward and backward chaining that can be used as tools for reasoning in propositional logic. In this paper, the authors show how powerful and intuitive the formalism of membrane computing is and how it can be used to represent concepts and notions from unrelated areas.

scholarly journals Forward and Backward Chaining with P Systems

2011 ◽  
Vol 2 (2) ◽  
pp. 56-66 ◽  
Author(s):  
Sergiu Ivanov ◽  
Artiom Alhazov ◽  
Vladimir Rogojin ◽  
Miguel A. Gutiérrez-Naranjo
Keyword(s):  
Computer Science ◽  
Propositional Logic ◽  
Membrane Computing ◽  
Modus Ponens ◽  
The Other ◽  
P Systems ◽  
Backward Chaining ◽  
Other Hand

One of the concepts that lie at the basis of membrane computing is the multiset rewriting rule. On the other hand, the paradigm of rules is profusely used in computer science for representing and dealing with knowledge. Therefore, establishing a “bridge” between these domains is important, for instance, by designing P systems reproducing the modus ponens-based forward and backward chaining that can be used as tools for reasoning in propositional logic. In this paper, the authors show how powerful and intuitive the formalism of membrane computing is and how it can be used to represent concepts and notions from unrelated areas.

scholarly journals Forward and Backward Chaining with P Systems

2012 ◽  
pp. 1522-1531
Author(s):  
Sergiu Ivanov ◽  
Artiom Alhazov ◽  
Vladimir Rogojin ◽  
Miguel A. Gutiérrez-Naranjo
Keyword(s):  
Computer Science ◽  
Propositional Logic ◽  
Membrane Computing ◽  
Modus Ponens ◽  
The Other ◽  
P Systems ◽  
Backward Chaining ◽  
Other Hand

One of the concepts that lie at the basis of membrane computing is the multiset rewriting rule. On the other hand, the paradigm of rules is profusely used in computer science for representing and dealing with knowledge. Therefore, establishing a “bridge” between these domains is important, for instance, by designing P systems reproducing the modus ponens-based forward and backward chaining that can be used as tools for reasoning in propositional logic. In this paper, the authors show how powerful and intuitive the formalism of membrane computing is and how it can be used to represent concepts and notions from unrelated areas.

Implication with possible exceptions

2001 ◽  
Vol 66 (2) ◽  
pp. 517-535
Author(s):  
Herman Jurjus ◽  
Harrie de Swart
Keyword(s):  
Propositional Logic ◽  
Modus Ponens ◽  
The Other ◽  
Classical Propositional Logic ◽  
Consequence Relation ◽  
Other Hand

AbstractWe introduce an implication-with-possible-exceptions and define validity of rules-with-possible-exceptions by means of the topological notion of a full subset. Our implication-with-possible-exceptions characterises the preferential consequence relation as axiomatized by Kraus, Lehmann and Magidor [Kraus, Lehmann, and Magidor, 1990]. The resulting inference relation is non-monotonic. On the other hand, modus ponens and the rule of monotony, as well as all other laws of classical propositional logic, are valid-up-to-possible exceptions. As a consequence, the rules of classical propositional logic do not determine the meaning of deducibility and inference as implication-without-exceptions.

scholarly journals Efficient computation in rational-valued P systems

2009 ◽  
Vol 19 (6) ◽  
pp. 1125-1139
Author(s):  
NADIA BUSI ◽  
MIGUEL A. GUTIÉRREZ-NARANJO ◽  
MARIO J. PÉREZ-JIMÉNEZ
Keyword(s):  
Linear Algebra ◽  
Membrane Computing ◽  
The Other ◽  
P Systems ◽  
Efficient Computation ◽  
Other Hand ◽  
The One

In this paper, we describe a new representation for deterministic rational-valued P systems that allows us to form a bridge between membrane computing and linear algebra. On the one hand, we prove that an efficient computation for these P systems can be described using linear algebra techniques. In particular, we show that the computation for getting a configuration in such P systems can be carried out by multiplying appropriate matrices. On the other hand, we also show that membrane computing techniques can be used to get the nth power of a given matrix.

scholarly journals Impact of Membrane Computing and P Systems in ISI WoS. Celebrating the 65th Birthday of Gheorghe Păun

2015 ◽  
Vol 10 (5) ◽  
Author(s):  
Ioan DZITAC
Keyword(s):  
Computer Science ◽  
Membrane Computing ◽  
Research Area ◽  
P Systems ◽  
65Th Birthday ◽  
Membrane Systems ◽  
Journal Paper ◽  
Technical Report ◽  
The Impact

Membrane Computing is a branch of Computer Science initiated by<br />Gheorghe Păun in 1998, in a technical report of Turku Centre for Computer Science<br />published as a journal paper ("Computing with Membranes" in Journal of Computer<br />and System Sciences) in 2000. Membrane systems, as Gheorghe Păun called the<br />models he has introduced, are known nowadays as "P Systems" (with the letter P<br />coming from the initial of the name of this research area "father").<br />This note is an overview of the impact in ISI WoS of Gheorghe Păun’s works, focused<br />on Membrane Computing and P Systems field, on the occasion of his 65th birthday<br />anniversary.

Abstrakcja, obiekty i cywilizacja globalna

1970 ◽  
Vol 9 (1) ◽  
pp. 203-216
Author(s):  
Robert Janusz
Keyword(s):  
Complex Systems ◽  
Computer Science ◽  
Logical Analysis ◽  
The Other ◽  
Analysis And Design ◽  
Other Hand ◽  
Exact Description

The article is about an interaction between philosophy and informatics. The discussion is based on a complex example - a country, which has an evolving domain. In contemporary computer science very complex systems are modeled. However it would be impossible to model such systems with every detail, because it would be too difficult, it would be as complex as the reality itself. Frequently complex domains don't have an exact description of their behavior: some have an inadequate description, some have a contradictory one. To model such complex domains a computer science specialist acts like a philosopher: makes classifications, explanations, etc. On the other hand there have to be some philosophical presuppositions - a conviction that a logical analysis and design will work in the domain being modeled: a postulate is introduced that logos is able to capture-in the reality. The descriptions are continuously purified from irrational influences.

ON THE POWER OF DETERMINISTIC AND SEQUENTIAL COMMUNICATING P SYSTEMS

2007 ◽  
Vol 18 (02) ◽  
pp. 415-431 ◽  
Author(s):  
LUDĚK CIENCIALA ◽  
LUCIE CIENCIALOVÁ ◽  
PIERLUIGI FRISCO ◽  
PETR SOSÍK
Keyword(s):  
The Other ◽  
P Systems ◽  
Computational Power ◽  
Other Hand ◽  
Mode 2 ◽  
Parallel Mode ◽  
Sequential Mode

We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in either minimally or maximally parallel mode, are computationally universal. Considering the sequential mode, 2 membranes are shown to characterize the power of partially blind multicounter machines. Next, a characterization of the power of 1-deterministic communicating P systems is given. Finally, we show that the nondeterministic variant in maximally parallel mode is universal already with 1 membrane. These results demonstrate differences in computational power between nondeterminism, 2-determinism and 1-determinism, on one hand, and between sequential, minimally and maximally parallel modes, on the other hand.

Principal type-schemes and condensed detachment

1990 ◽  
Vol 55 (1) ◽  
pp. 90-105 ◽  
Author(s):  
J. Roger Hindley ◽  
David Meredith
Keyword(s):  
Type Theory ◽  
Propositional Logic ◽  
Modus Ponens ◽  
The Other ◽  
Combinatory Logic ◽  
Minimal Amount ◽  
Principal Type ◽  
Condensed Detachment

The condensed detachment rule, or ruleD, was first proposed by Carew Meredith in the 1950's for propositional logic based on implication. It is a combination of modus ponens with a “minimal” amount of substitution. We shall give a precise detailed statement of rule D. (Some attempts in the published literature to do this have been inaccurate.)The D-completeness question for a given set of logical axioms is whether every formula deducible from the axioms by modus ponens and substitution can be deduced instead by rule D alone. Under the well-known formulae-as-types correspondence between propositional logic and combinator-based type-theory, rule D turns out to correspond exactly to an algorithm for computing principal type-schemes in combinatory logic. Using this fact, we shall show that D is complete for intuitionistic and classical implicational logic. We shall also show that D is incomplete for two weaker systems, BCK- and BCI-logic.In describing the formulae-as-types correspondence it is common to say that combinators correspond to proofs in implicational logic. But if “proofs” means “proofs by the usual rules of modus ponens and substitution”, then this is not true. It only becomes true when we say “proofs by rule D”; we shall describe the precise correspondence in Corollary 6.7.1 below.This paper is written for readers in propositional logic and in combinatory logic. Since workers in one field may not feel totally happy in the other, we include short introductions to both fields.We wish to record thanks to Martin Bunder, Adrian Rezus and the referee for helpful comments and advice.

Ideen zu einer Kritik ‚algorithmischer‘ Rationalität

2019 ◽  
Vol 67 (5) ◽  
pp. 851-873
Author(s):  
Dieter Mersch
Keyword(s):  
Computer Science ◽  
20Th Century ◽  
The Other ◽  
Critical Approach ◽  
Halting Problem ◽  
Human Thought ◽  
Other Hand ◽  
The One ◽  
Mathematical Foundations

Abstract A critique of algorithmic rationalisation offers at best some initial reasons and preliminary ideas. Critique is understood as a reflection on validity. It is limited to an “epistemological investigation” of the limits of the calculable or of what appears “knowable” in the mode of the algorithmic. The argumentation aims at the mathematical foundations of computer science and goes back to the so-called “foundational crisis of mathematics” at the beginning of the 20th century with the attempt to formalise concepts such as calculability, decidability and provability. The Gödel theorems and Turing’s halting problem prove to be essential for any critical approach to “algorithmic rationalisation”. Both, however, do not provide unambiguous results, at best they run towards what later became known as “Gödel’s disjunction”. The chosen path here, however, suggests the opposite way, insofar as, on the one hand, the topos of creativity appear constitutive for what can be regarded as cognitive “algorithmic rationalisation” and which encounters systematic difficulties in the evaluation of non-trivial results. On the other hand, the investigations lead to a comparison between the “mediality” of formally generated structures, which have to distinguish between object-and metalanguages, and the “volatile” differentiality of human thought, which calls for syntactically non-simulatable sense structures.

scholarly journals Fuzzy b-Metric Spaces

2016 ◽  
Vol 11 (2) ◽  
pp. 273 ◽  
Author(s):  
Sorin Nădăban
Keyword(s):  
Control Theory ◽  
Computer Science ◽  
Metric Space ◽  
Metric Spaces ◽  
Denotational Semantics ◽  
Decomposition Theorem ◽  
The Other ◽  
Fuzzy Metric Space ◽  
Fuzzy Metric ◽  
Other Hand

Metric spaces and their various generalizations occur frequently in computer science applications. This is the reason why, in this paper, we introduced and studied the concept of fuzzy b-metric space, generalizing, in this way, both the notion of fuzzy metric space introduced by I. Kramosil and J. Michálek and the concept of b-metric space. On the other hand, we introduced the concept of fuzzy quasi-bmetric space, extending the notion of fuzzy quasi metric space recently introduced by V. Gregori and S. Romaguera. Finally, a decomposition theorem for a fuzzy quasipseudo- b-metric into an ascending family of quasi-pseudo-b-metrics is established. The use of fuzzy b-metric spaces and fuzzy quasi-b-metric spaces in the study of denotational semantics and their applications in control theory will be an important next step.

Sign in / Sign up

Export Citation Format

Share Document