661.
Programmable Logic Design
- Quick Start; Hand Book; Karen Parnell; Nick Mehta; Karen Parnell; Nick Mehta; Programmable Logic; Design Quick; Start Hand; Quick Start; Hand Book; Programmable Logic; Design Quick; Start Hand
Whether you design with discrete logic, base all of your designs on microcontrollers, or simply want to learn how to use the latest and most advanced programmable logic software, you will find this book an interesting insight into a different way to design. Programmable logic devices were invented in the late seventies and since then have proved to be very popular and are now one of the largest growing sectors in the semiconductor industry. Why are programmable logic devices so widely used? Programmable logic devices provide designers ultimate flexibility, time to market advantage, design integration, are easy to design with...
662.
Modularity in Logic Programming
- Edelmira Pasarella,Fernando Orejas
this document,
some basic notions and results of logic programming and a succinct presenta4
tion of intuitionistic logic. We assume the reader is familiar with first order
logic.
663.
A Combination of Interval Logic and Linear Temporal Logic
The super-dense computation model provides an abstraction of real-time behaviour of computing systems.
Logics to deal with this model are being studied. In the paper, we propose a combination of a linear
temporal logic and an interval logic, and demonstrate how this combination can be used to specify a
real-time semantics of an OCCAM-like programming language and its real-time properties, where the
super-dense computation model is adopted.
664.
A Fuzzy Logic-based Resource Management Scheme for High-quality Broadband Wireless Access Systems
- Romano Fantacci; Giovanni Giambene
This paper deals with the Radio Resource Management (RRM) layer of future Broadband Wireless Access System (BWAS). The interest here is in designing an e#cient scheme able to integrate highly demanding tra#cs, such as high-quality real-time streaming video and interactive Web tra#cs. Many medium access protocols have been proposed in the literature for BWAS systems, but the fair sharing of resources and the achievement of a high throughput combined with good Quality of Service (QoS) levels are still open issues. We consider the tra#c managed by an access point that coordinates video and interactive tra#c terminals. These tra#c sources notify...
665.
A Multiple-Conclusion Meta-Logic
- Dale Miller
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic refinement, Lolli [12], provide for various forms of abstraction (modules, abstract data types, higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] provides for concurrency but lacks abstraction mechanisms. In this paper we present Forum, a logic programming presentation of all of linear logic that modularly extends the languages Prolog, Lolli, and LO. Forum, therefore, allows specifications to incorporate both abstractions and concurrency. As...
666.
A Syntax for Linear Logic
- Philip Wadler
. There is a standard syntax for Girard's linear logic, due to
Abramsky, and a standard semantics, due to Seely. Alas, the former is
incoherent with the latter: different derivations of the same syntax may
be assigned different semantics. This paper reviews the standard syntax
and semantics, and discusses the problem that arises and a standard
approach to its solution. A new solution is proposed, based on ideas
taken from Girard's Logic of Unity. The new syntax is based on pattern
matching, allowing for concise expression of programs.
1 Introduction
Somewhere inside linear logic, there is a programming language struggling to
get out. We wish to define an analogue of...
667.
A System for Dialogue Logic
- Jurgen Ehrensberger
. We present a proof system which implements dialogue logic
as originally developed by Lorenzen. Intuitionistic and classic logic are
pre-defined. A rule language allows to easily define dialogue rules for
other logics. DiaLog provides multi-sorted logic. The system supports
fully automated and interactive proof search. A user-friendly graphical
interface displays the dialogue tableau, a dialogue trace field and a dialogue
strategy grapher.
1 Dialogue logic
The principles of dialogue logic were proposed by Paul Lorenzen in 1958 in
order to provide a new autonomous foundation of intuitionistic logic (cf. [5]). In
this new approach the validity of a given formula is examined in a formal dialogue
between two participants: the...
668.
Implementation of Threshold Logic
- Alexander Stokman
Traditionally, logic circuits have been, and are still being implemented using Boolean
logic. Although there has been a tremendous increase in the performance of the
technology used to implement Boolean logic primitives, the underlying paradigm has
remained unchanged over the years. Since the early 1960's there is a fundamentally
more powerful alternative for Boolean logic available, called Threshold Logic (TL).
Although implementations of TL gates have grown with the advances in technology,
none of these have ever proven widely applicable. Because of this TL was never
a practical success. Recently a new technology called Capacitive Threshold Logic
(CTL) was disclosed which holds the promise of being the first...
669.
Modular Temporal Logic
- Augustin Baziramwabo,Pierre Mckenzie
Th'erien and Wilke characterized the Until hierarchy
of linear temporal logic in terms of aperiodic monoids.
Here, a temporal operator able to count modulo q is
introduced. Temporal logic augmented with such operators
is found decidable as it is shown to express precisely
the solvable regular languages. Natural hierarchies
are shown to arise when modular and conventional
operators are interleaved. Modular operators are
then cast as special cases of more general "group" temporal
operators which, added to temporal logic, allow
capturing any regular language L in much the same
way that the syntactic monoid of L is constructed from
groups and aperiodic monoids in the sense of KrohnRhodes.
Keywords: temporal logic, finite model...
670.
Bayesian Logic Programs
- Kristian Kersting,Luc De Raedt
Various proposals for combining first order logic with Bayesian nets exist. Many of these are based on the so-called knowledge-based model construction method, e.g. probabilistic logic programs by Ngo and Haddawy, relational Bayesian nets by Jaeger and the more recent probabilistic relational models by Koller et. al. Upon a first investigation these frameworks seem different despite the fact that they attack essentially the same problem. The relationship among these approaches has so far not been studied. The main contribution of this paper is, that we clarify the relation among the three existing frameworks. This is achieved through the introduction of...
671.
A System for Dialogue Logic
- Jurgen Ehrensberger
. We present a proof system which implements dialogue logic
as originally developed by Lorenzen. Intuitionistic and classic logic are
pre-defined. A rule language allows to easily define dialogue rules for
other logics. DiaLog provides multi-sorted logic. The system supports
fully automated and interactive proof search. A user-friendly graphical
interface displays the dialogue tableau, a dialogue trace field and a dialogue
strategy grapher.
1 Dialogue logic
The principles of dialogue logic were proposed by Paul Lorenzen in 1958 in
order to provide a new autonomous foundation of intuitionistic logic (cf. [5]). In
this new approach the validity of a given formula is examined in a formal dialogue
between two participants: the...
672.
Signed Formula Logic Programming: Operational Semantics and Applications
- Jacques Calmet; Maria Rodriguez; James J. Lu
. Signed formula can be used to reason about a wide variety of multiple-valued logics. The formal theoretical foundation of logic programming based on signed formulas is developed in [26]. In this paper, the operational semantics of signed formula logic programming is investigated through constraint logic programming. Applications to bilattice logic programming and truthmaintenance are considered. Keywords: Logic for Artificial Intelligence, Multiple-valued Logic, Signed Formula, Constraint Logic Programming, Truth-Maintenance, Bilattices * Please address all correspondence to: James Lu Department of Computer Science Bucknell University Lewisburg, PA 17837 U.S.A. E-mail: jameslu@bucknell.edu Phone: +1 717 524 1394 Fax: +1 717 524 1822...
673.
Aplicação de lógica fuzzy no controle de tráfego do serviço ABR em redes ATM.
- Azeka, Marcos Akira
Neste trabalho estuda-se a idéia de utilizar a lógica fuzzy no controle de tráfego gerado pelo serviço ABR (Available Bit Rate), proposto pelo Forum ATM. Neste tipo de controle, uma taxa explícita é calculada pelo comutador ATM e enviada de volta para a fonte através das células RM (Resource Management). Este cálculo é baseado na ocupação do fubber e no crescimento dessa ocupação utilizando um conjunto de regras lingüísticas. Utiliza-se um simulador de rede para implementar o algoritmo e são feitas várias séries de simulações. O algoritmo fuzzy apresenta melhor desempenho em relação ao tempo de transferência das células entre...
674.
Specification and Verification of the Tree Identify Protocol of IEEE 1394 in Rewriting Logic
- Alberto Verdejo; Isabel Pita; Narciso Martí-oliet
We present three descriptions, at di#erent abstract levels, of the tree identify protocol from the IEEE 1394 serial multimedia bus standard. The descriptions are given using the language Maude based on rewriting logic. Particularly, the time aspects of the protocol are studied. We prove the correctness of the protocol in two steps. First, the descriptions are validated by an exhaustive exploration of all the possible states reachable from an initial configuration of a network, checking that always only one leader is chosen. Then, we give a formal proof showing that the desirable properties of the protocol are always fulfilled by...
675.
An Adaptive Fuzzy Logic Based Handoff Algorithm For Interworking Between Wlans And Mobile Networks
- Amir Majlesi; Babak H. Khalaj
In this paper, the goal is to propose an optimal handoff algorithm for hybrid networks (HNs), which are constructed by interworking between wireless LANs (WLANs) and mobile networks. The proposed algorithm is an adaptive fuzzy logic based algorithm that can adapt itself with the dynamic conditions in HNs. It uses mobile terminal speed estimation and traffic in the WLAN as additional input parameters. This algorithm is designed to meet special requirements of HNs. The simulation results show that it has much better performance than conventional algorithms.
676.
Undecidability of Compass Logic
- Maarten Marx
It is known that the tiling technique can be used to give simple proofs of undecidability of various two-dimensional modal and temporal logics. However, up until now, the simplest two-dimensional temporal logic, the compass logic of Venema, has eluded such treatment. We present a new coding of an enumeration of the tiling plane which enables us to show that the compass logic is undecidable.
677.
Taming First-Order Logic
- Szabolcs Mikul
In this paper we define computationally well-behaved versions of classical first-order logic and prove
that the validity problem is decidable
1
.
Keywords : first-order logic, decidability, relativization, mosaic, polyadic and counting quantifiers.
1Taming
In [5], we developed a strategy for taming logics. The idea of taming can be described
as follows. Let us assume that we have a well-investigated logic with some undesirable
metalogical properties. An example is the incompleteness and undecidability of the
finite variable fragment of classical first-order logic, FOL, with at least three variables,
cf. [4] 4.1.3 and 4.2.18 for the equivalent algebraic results. Taming a logic amounts to
finding a version of the logic such that...
678.
Predicate Logic with Anaphora
- Paul Dekker
In this paper I make a case for a separate treatment of (singular) anaphoric pronouns
within a predicate logic with anaphora (PLA). Discourse representation theoretic
results (from Kamp 1981) can be formulated in a compositional way, without fiddling
with orthodox notions of scope and binding. In contrast with its predecessor
dynamic predicate logic (Groenendijk and Stokhof 1991), the system of PLA is a
proper extension of ordinary predicate logic and it has a genuine update semantics.
679.
Temporalizing Epistemic Default Logic
- John-jules Meyer
this paper in the Sections 2 to 6 the logic EDL is presented. As compared with earlier
publications ([MH91a, MH92a, MH93a,b]), the logic is slightly extended in order to cater for
downward reflection in subsequent sections. In Section 7 we define a labeled branching time
temporalization of this logic, in spirit of the approach of [FG92]. In Section 8 we define
sceptical and credulous entailment relations based on temporal models
680.
Embedding Logics Into Product Logic
- Matthias Baaz
We construct a faithful interpretation of / Lukasiewicz's logic in the product logic (both
propositional and predicate). Using known facts it follows that the product predicate logic is
not recursively axiomatizable.
We prove a completeness theorem for the product logic extended by a unary connective 4
of Baaz [1]. We show that Godel's logic is a sublogic of this extended product logic.
We also prove NP-completeness of the set of propositional formulas satisfiable in product
logic (resp. in Godel's logic).
1 Introduction
We shall be concerned with many-valued logics in this paper; in particular, in / Lukasiewicz's logic
/ L, Godel's logic G and product logic P. Our aim...
