181.
Running Head: Alleged Misconceptions about Fuzzy Logic Title: On Some Alleged Misconceptions about Fuzzy Logic
- Jeffry Pelletier
(Entemann 2002) defends fuzzy logic by pointing to what he calls ‘misconceptions ’ concerning fuzzy logic. However, some of these ‘misconceptions ’ are in fact truths, and it is Entemann who has the misconceptions. The present article points to mistakes made by Entemann in three different areas. It closes with a discussion of what sort of general considerations it would take to motivate fuzzy logic. Keywords:
182.
Polynomial time logic: Inability to express
- Shelah, Saharon
Here we deal with the logic of [GuSh 533], which tries to capture polynomial
time (for finite models). There it is proved that the logic cannot say much on
models with equality only. Here we prove that it cannot say much on models for
which we expect it cannot say much, like random enough graphs. This is the
result of having a general criterion.
183.
Truth and utility in fuzzy logic
- Sobrino, A.
The notion of degree of truth used in fuzzy logic can be interpreted in terms of partial truth or in terms of utility. By investigating how these interpretations fit in with Tarski's definition of truth, this paper explores some of their implications and their consequences for the foundations and credibility of fuzzy logic.
184.
Obsessional experiments for Linear Logic Proof-nets
- Lorenzo Tortora De Falco
We address the question of injectivity of coherent semantics of linear logic proof-nets. Starting from Girard's denition of experiment, we introduce the key-notion of \injective obsessional experiment ", which allows to give a positive answer to our question for certain fragments of linear logic, and to build counter-examples to the injectivity of coherent semantics in the general case.
185.
Semantics of Input-Consuming Logic Programs
- Annalisa Bossi Sandro; Sandro Etalle; Sabina Rossi
Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming.
186.
Static Analysis of Linear Logic Programming
- Jean-Marc Andreoli; Tiziana Castagnetti; Remo Pareschi
Linear Logic is gaining momentum in computer science because it offers a unified framework and a common vocabulary for studying and analyzing different aspects of programming and computation. We focus here on models where computation is identified with proof search in the sequent system of Linear Logic. A proof normalization procedure, called "focusing", has been proposed to make the problem of proof search tractable. Correspondingly,
187.
Disjunctive Quantum Logic in Dynamic Perspective
- Coecke, Bob
In arXiv: math.LO/0011208 we proposed the {\sl intuitionistic or disjunctive
representation of quantum logic}, i.e., a representation of the property
lattice of physical systems as a complete Heyting algebra of logical
propositions on these properties, where this complete Heyting algebra goes
equipped with an additional operation, the {\sl operational resolution}, which
identifies the properties within the logic of propositions. This representation
has an important application ``towards dynamic quantum logic'', namely in
describing the temporal indeterministic propagation of actual properties of
physical systems. This paper can as such by conceived as an addendum to
``Quantum Logic in Intuitionistic Perspective'' that discusses spin-off and
thus provides an additional motivation. We derive a...
188.
Interpolation and the Interpretability Logic of PA
- Goris, Evan
In this paper we will be concerned with the interpretability logic of PA
and in particular with the fact that this logic, which is denoted by ILM,
does not have the interpolation property. An example for this fact seems to emerge from the fact that ILM cannot express ??-ness. This suggests a way to extend the expressive power of interpretability logic, namely, by an additional operator for ??-ness, which might give us a logic with the interpolation property. We will formulate this extension, give an axiomatization which is modally complete and arithmetically complete (although for proofs of these theorems we refer to...
189.
Translating Logic Programs Into Conditional Rewriting Systems
- F. van Raamsdonk; Femke Van Raamsdonk
In this paper a translation from a subclass of logic programs consisting of the simply moded logic programs into rewriting systems is defined. In these rewriting systems conditions and explicit substitutions may be present. We argue that our translation is more natural than previously studied ones and establish a result showing its correctness. 1991 Mathematics Subject Classification: 68Q42, 16S15. 1991 Computing Reviews Classification System: D.1.6, I.2.2, I.2.3, F.3.2. Keywords and Phrases: logic programming, rewriting, program transformation. Note: This research was supported by NWO/SION project number 612-33-003, entitled `Parallel declarative programming: transforming logic programs to lazy functional programs'. A shorter version...
190.
Compositionality of Normal Open Logic Programs
- Sofie Verbaeten; Marc Denecker; Danny De Schreye
Compositionality of programs is an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly been studied for definite programs only. Here, we study compositionality in the context of normal open logic programming. This is a very expressive logic for knowledge representation of uncertainty and incomplete knowledge on concepts and on problem domain, in which the compositionality issue turns up very naturally. The semantics of the logic is a generalisation (allowing non-Herbrand interpretations) of the well-founded semantics. We provide a number of results which offer different sufficient conditions under...
191.
System Specification and Refinement in Temporal Logic
- Amir Pnueli
. We consider two types of specifications of reactive systems: requirement specification which lists properties the system should satisfy, and System specification which describes the response of the system to each incoming input. Some of the differences between these two styles of specification are analyzed with the conclusion that both types are needed in an orderly system development. Traditionally, temporal logic was used for requirement specification while process algebras, such as csp and ccs, were used for system specification. Recent developments, mainly represented in Lamport's temporal logic of actions (tla), demonstrated that temporal logic can be used effectively also for...
192.
Probabilistic Interval Temporal Logic
This paper presents an interval-based probabilistic temporal logic, that we call probabilistic
interval logic. The new logic is an extension of Interval Temporal Logic (cf. e.g. [Dut95]),
and can be viewed as a generalisation of Probabilistic Duration Calculus [LRSZ92, DZ94]. We
propose a proof system for the new logic and demonstrate its completeness. We also present
a complete axiomatisation of Chapman-Kolmogorov's property of sequential composition of
probabilistic processes relative to a class of models of probabilistic interval logic that includes
the significant class of real time based models. By giving a complete deductive system to the
new logic we make it possible to shape reasoning about probabilistic...
193.
Executing Suspended Logic Programs
- Robert A. Kowalski; Francesca Toni; Gerhard Wetzel
. We present an extension of Logic Programming (LP) which, in addition to ordinary LP clauses, also includes integrity constraints, explicit representation of disjunction in the bodies of clauses and in goals, and suspension of atoms as in concurrent logic languages. The resulting framework aims to unify Constraint Logic Programming (CLP), Abductive Logic Programming (ALP) and Semantic Query Optimisation (SQO) in deductive databases. We present a proof procedure for the new framework, simplifying and generalising previously proposed proof procedures for ALP. We discuss applications of the framework, formulating traditional problems from LP, ALP, CLP and SQO. Keywords: Logic Programming (LP),...
194.
Partial Equilibrium Logic ⋆
- Pedro Cabalar; Sergei Odintsov; David Pearce; Agustín Valverde
Abstract. Partial equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and partial stable model semantics. In particular it provides a logical foundation for these semantics as well as an extension of the basic syntax of logic programs. In this paper we describe PEL, study some of its logical properties and examine its behaviour on disjunctive and nested logic programs. In addition we consider computational features of PEL and study different approaches to its computation.
195.
A Useful Substructural Logic
this paper, we will see another formal system with a number of different uses. We will
examine a substructural logic which is important in a number of different ways. The
logic of Peirce monoids, inspired by the logic of relations, is useful in the independent
areas of linguistic types and information flow.
196.
A Useful Substructural Logic
this paper, we will see another formal system with a number of different uses. We will
examine a substructural logic which is important in a number of different ways. The
logic of Peirce monoids, inspired by the logic of relations, is useful in the independent
areas of linguistic types and information flow.
197.
A Fuzzy Logic Based Trading System
- Wee Mien; Cheung Uzay Kaymak
ABSTRACT: Technical analysis is sometimes used in financial markets to assist traders make buying and selling decisions. The success of technical analysis depends on how one interprets the available signals. Integration of human expertise into available models is considered to be essential for this purpose. Fuzzy systems could be used for developing decision models in which the experience of a trader can be incorporated in a natural way. In this paper, we examine a trading model that combines fuzzy logic and technical analysis to find patterns and trends in financial indices. The rule base of the fuzzy system is kept...
198.
Quantum Logic in Intuitionistic Perspective
- Coecke, Bob
In their seminal paper Birkhoff and von Neumann revealed the following
dilemma: "... whereas for logicians the orthocomplementation properties of
negation were the ones least able to withstand a critical analysis, the study
of mechanics points to the distributive identities as the weakest link in the
algebra of logic." In this paper we eliminate this dilemma, providing a way for
maintaining both. Via the introduction of the "missing" disjunctions in the
lattice of properties of a physical system while inheriting the meet as a
conjunction we obtain a complete Heyting algebra of propositions on physical
properties. In particular there is a bijective correspondence between property
lattices and propositional lattices...
199.
La crítica de Orayen a los lógicos relevantistas y el silogismo disyuntivo
- Peña, Lorenzo
La presente nota comenta algunos puntos de la crítica al relevantismo
que constituye el capítulo V (págªs 217-62) del libro de Raúl Orayen
Lógica, significado y ontología (UNAM, 1989). Por razones de espacio,
me centro casi exclusivamente en el debate sobre el silogismo
disyuntivo. Antes, abordo un problema metodológico general acerca de
las «intuiciones», en torno a un género de argumento que usan --aunque
con fines opuestos-- tanto los adalides del relevantismo cuanto Orayen
en su crítica.
Como conclusión de la lectura de Orayen, me preguntao si no cabe una
reapreciación de la lógica relevante. Orayen también abre una
perspectiva...
200.
CONSTRUCTING ONLINE TESTABLE CIRCUITS USING REVERSIBLE LOGIC
- Sk Noor Mahammad; Siva Kumar; Sastry Hari; Shyam Shroff; V Kamakoti
Testable fault tolerant system design has become vital for many safety critical applications. On the other hand, reversible logic is gaining interest in the recent past due to its less heat dissipating characteristics. Any Boolean logic function can be implemented using reversible gates. This paper proposes a technique to convert any reversible logic gate to a testable gate that is also reversible. The resultant reversible testable gate can detect online any single bit errors that include Single Stuck Faults and Single Event Upsets S.Karp et.al (1993). The proposed technique is illustrated using an example that converts a reversible decoder circuit...
