481.
An input weights aware synthesis tool for threshold logic networks
- Li Zhang; Sorin Cotofana
Abstract — In this paper we present a TL specific synthesis tool that aims to exploit the specific characteristics of TL gates, especially the possibility to assign weights larger than one to TL gate inputs. Moreover, instead of confining network nodes with input fan-in restriction, we employ the sum of weights as constraint, as this is more relevant to the physical basis of TL implementations. To make a seamless concatenation with Boolean logic network access and synthesis, we embedded our program into a widely applied existing logic synthesis tool, SIS from University of Berkeley, by supplementing it with 8 new...
482.
Linear, Branching Time and Joint Closure Semantics for Temporal Logic *
- Joeri Engelfriet; Jan Treur
Abstract. Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often used for this purpose: linear and branching time models. In this paper a third approach, based on socalled joint closure models, is studied using models which incorporate all possible behaviour in one model. Relations between this approach and the other two are studied. In order to define constructions needed to relate branching time models, appropriate algebraic notions are defined (in a category theoretical manner) and exploited. In particular, the...
483.
FLOW PREDICTION MODEL WITH FUZZY LOGIC APPROACHES: DIM STREAM
- M. Erol Keski̇n; Emine Dilek Taylan; A. Gökhan Yilmaz
In planning of the water structures, it is need some information about flow values. The identification of suitable generation models for future streamflows is an important precondition for successful planning and management of water resources, operation of flood control reservoirs, determination of flow potential in stream, forecasting of electric generation in hydroelectric power plants in drought periods, distribution of domestic and irrigation water and navigation in rivers. Flow prediction methods are countable as rainfall-runoff models or flood routing models for short periods; indis variable models, water budget models, rainfall-runoff models and time series models, respectively. In time series models, future...
484.
A New Deconstructive Logic: Linear Logic
- Vincent Danos,Jean-baptiste Joinet,Harold Schellinx
The main concern of this paper is the design of a noetherian and
confluent normalization for LK
2
(that is, classical second order predicate
logic presented as a sequent calculus).
The method we present is powerful: since it allows us to recover
as fragments formalisms as seemingly different as Girard's LC and
Parigot's ¯, FD ([10, 12, 29, 33]), delineates other viable systems
as well, and gives means to extend the Krivine/Leivant paradigm of
`programming-with-proofs' ([24, 25]) to classical logic; it is painless:
since we reduce strong normalization and confluence to the same properties
for linear logic (for non-additive proof nets, to be precise) using
appropriate embeddings (so-called decorations); it is unifying:...
485.
A New Deconstructive Logic: Linear Logic
- Vincent Danos,Jean-baptiste Joinet,Harold Schellinx
The main concern of this paper is the design of a noetherian and
confluent normalization for LK
2
(that is, classical second order predicate
logic presented as a sequent calculus).
The method we present is powerful: since it allows us to recover
as fragments formalisms as seemingly different as Girard's LC and
Parigot's ¯, FD ([10, 12, 29, 33]), delineates other viable systems
as well, and gives means to extend the Krivine/Leivant paradigm of
`programming-with-proofs' ([24, 25]) to classical logic; it is painless:
since we reduce strong normalization and confluence to the same properties
for linear logic (for non-additive proof nets, to be precise) using
appropriate embeddings (so-called decorations); it is unifying:...
486.
A New Deconstructive Logic: Linear Logic
- Vincent Danos,Jean-baptiste Joinet,Harold Schellinx
The main concern of this paper is the design of a noetherian and
confluent normalization for LK
2
(that is, classical second order predicate
logic presented as a sequent calculus).
The method we present is powerful: since it allows us to recover
as fragments formalisms as seemingly different as Girard's LC and
Parigot's , FD ([9, 11, 27, 31]), delineates other viable systems
as well, and gives means to extend the Krivine/Leivant paradigm of
`programming-with-proofs' ([22, 23]) to classical logic; it is painless:
since we reduce strong normalization and confluence to the same properties
for linear logic (for non-additive proof nets, to be precise) using
appropriate embeddings (so-called decorations); it is unifying:...
487.
TRIBOLOGY A NON BOOLEAN LOGIC TO PROCESS SIGNALS GENERATED BY BALL BEARING’S DEFECTS
Fuzzy logic is a theory with deep structure, which is flexible enough to cover properties of the natural language. The basic laws of classical logic are formulated with two logic values 0 and 1. This logic is named "boolean logic". In an opposite side is fuzzy logic, which is based on membership function. The basis to create this membership is to do some assumptions with some degrees of truth. The truth degree of the result is also derived. All the operations in the fuzzy sets theory are based on the connectives from fuzzy logic. These connectives are used to express...
488.
Exploiting And-Parallelism And Combined And/orparallelism In Logic Programs: A Survey
- Kang Zhang
] Logic programs provide many opportunities for parallel execution. Among different forms of parallelism found in logic programs, AND-parallelism and OR-parallelism have shown to be most effective in speeding up the execution of logic programs. Research in the exploitation of AND-parallelism, OR-parallelism alone and combined AND/OR-parallelism has led to the proposals and implementations of various execution models and working systems. This paper offers a review of major activities in exploiting AND-parallelism and combined AND/ORparallelism. Keywords: Logic programming, Prolog, AND-parallelism, Combined AND/OR-parallelism 1. INTRODUCTION There has been a flurry of research activities in parallel processing of logic programs in the last...
489.
Timetabling in Constraint Logic Programming
- Francisco Azevedo; Pedro Barahona
Generating timetables is a cumbersome and time consuming task, but programs developed to solve them are usually meant for a particular organisation and can not be easily adapted. Constraint Logic Programming, the result of generalizing Logic Programming unification to constraint solving over a computation domain, aim at expressing constrained decision problems declaratively, and still solve them efficiently. DOMLOG is a CLP(FD) system, that extends CHIP with features such as user-defined heuristics, and more flexible lookahead constraint solving. The adequacy of integrating heuristics and lookahead was discussed in previous work for a simplified timetabling problem. This paper presents the main features...
490.
Calculi for Disjunctive Logic Programming
- Peter Baumgartner; Ulrich Furbach
In this paper we investigate relationships between top-down and bottomup approaches to computation with disjunctive logic programs (DLPs). The bottom-up calculus considered, hyper tableaux, is depicted in its ground version and its relation to fixed point approaches from the literature is investigated. For the top-down calculus we use restart model elimination (RME) and show as our main result that hyper tableaux provide a bottom-up semantics for it. This generalizes the well-known result linking the T -operator to SLDresolution for definite programs towards disjunctive programs. Furthermore we discuss that hyper tableaux can be seen as an extension of SLO-resolution. Keywords: Disjunctive...
491.
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
- Abhik Roychoudhury; K. Narayan Kumar; C. R. Ramakrishnan; I. V. Ramakrishnan
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs typically fold using using a single, non-recursive clause i.e. the folding transformation is very restricted. In this paper we present a transformation system that permits folding in the presence of recursion, disjunction, as well as negation. We show that the transformations are correct with respect to various model theoretic semantics of normal logic programs including the well-founded model and stable model semantics.
492.
A Belief-Function Logic
- Alessandro Saffiotti
We present BFL, a hybrid logic for representing uncertain
knowledge. BFL attaches a quantified notion of belief ---
based on Dempster-Shafer's theory of belief functions ---
to classical first-order logic. The language of BFL is composed
of objects of the form F:[a,b], where F is a firstorder
sentence, and a and b are numbers in the [0,1]
interval (with ab). Intuitively, a measures the strength of
our belief in the truth of F, and (1--b) that in its falseness. A
number of properties of first-order logic nicely generalize
to BFL; in return, BFL gives us a new perspective on some
important points of Dempster-Shafer theory (e.g., the role
of Dempster's combination...
493.
Object Specification Logic
- Cristina Sernadas
A logic for specifying and reasoning about object classes and their instances
(aspects) is presented and illustrated. This logic is an extension
of a rather standard linear temporal, many-sorted, first-order predicate
logic with equality. The extensions where designed to be as simple as
possible while supporting the envisaged locality of arguments, object specialization
and object aggregation. Objects are specified through their
aspects. Each aspect establishes a local vocabulary (signature). The logic
works at two levels: first, we can specify and prove assertions about a
given object aspect in isolation (local reasoning), eg persons, or patients,
or cars; second, we can specify interaction constraints and make inferences
between aspects within the...
494.
A Belief-Function Logic
- Alessandro Saffiotti
We present BFL, a hybrid logic for representing uncertain
knowledge. BFL attaches a quantified notion of belief ---
based on Dempster-Shafer's theory of belief functions ---
to classical first-order logic. The language of BFL is composed
of objects of the form F:[a,b], where F is a firstorder
sentence, and a and b are numbers in the [0,1]
interval (with ab). Intuitively, a measures the strength of
our belief in the truth of F, and (1--b) that in its falseness. A
number of properties of first-order logic nicely generalize
to BFL; in return, BFL gives us a new perspective on some
important points of Dempster-Shafer theory (e.g., the role
of Dempster's combination...
495.
Contextual Deontic Logic
- Yao-hua Tan
In this article we propose contextual deontic logic (CDL). Contextual obligations are written as
O(ffjfinfl), and are to be read as `ff should be the case if fi is the case, unless fl is the case'. The
unless clause is analogous to the justification in Reiter's default rules. We show how contextual
obligations can be used to solve certain aspects of contrary-to-duty paradoxes of dyadic deontic
logic.
1 Contrary-to-duty reasoning
In recent years several researchers have argued that deontic logic is a useful tool to model reasoning
in (legal) knowledge-based systems [JS92, RL92, Smi94, Roy96]. The problem, however, is that
deontic logic is hampered by the so-called deontic...
496.
Contextual Deontic Logic
- Yao-hua Tan
In this article we propose contextual deontic logic (CDL). Contextual obligations are written as
O##j#n##, and are to be read as `# should be the case if # is the case, unless # is the case'. The
unless clause is analogous to the justification in Reiter's default rules. We show how contextual
obligations can be used to solve certain aspects of contrary-to-duty paradoxes of dyadic deontic
logic.
1 Contrary-to-duty reasoning
In recent years several researchers have argued that deontic logic is a useful tool to model reasoning
in (legal) knowledge-based systems [JS92, RL92, Smi94, Roy96]. The problem, however, is that
deontic logic is hampered by the so-called deontic...
497.
Ordered Linear Logic Programming
- Jeff Polakow; Frank Pfenning
We begin with a review of intuitionistic non-commutative linear logic (INCLL), a refinement of linear logic with an inherent notion of order proposed by the authors in prior work. We then develop a logic programming interpretation for INCLL in two steps: (1) we give a system of ordered uniform derivations which is sound and complete with respect to INCLL, and (2) we present a model of resource consumption which removes non-determinism from ordered resource allocation during search for uniform derivations. We also illustrate the expressive power of the resulting ordered linear logic programming language through some examples, including programs for...
498.
The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic
- Sam Buss; Grigori Mints
This paper considers the computational complexity of the disjunction and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A B , a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunction property, namely, there is a superexponential lower bound on the time required, given a proof of A B , to produce one of A and B which is true. In addition, there is superexponential lower bound on the size...
499.
Nonmonotonic Reasoning Based on Incomplete Logic Tuan-FangFan I-PengLin DepartmentofComputerScienceandInformationEngineering, NationalTaiwanUniversity,
- Taipei Taiwan
ABSTRACT. What characterizes human reasoning is the ability of dealing with incomplete information. Incomplete logic is developed for modeling incomplete knowledge. The most distinctive feature of incomplete logic is its semantics. This is an alternative presentation of partial semantics. In this paper, we will introduce the general notion of incomplete logic(ICL), compare it with partial logic, and give the resolution method for it. We will also show howICL can be applied to nonmonotonic reasoning. We de ne nonmonotonic derivation as monotonic derivation in ICL from the database and some consistent assumptions. The mechanism of ICL makes it easy to assert...
500.
A Brief Guide to Linear Logic
An overview of linear logic is given, including an extensive bibliography
and a simple example of the close relationship between linear
logic and computation.
1 Overview
Linear logic, introduced by Girard [45], is a refinement of classical logic.
Linear logic is sometimes described as resource sensitive because it provides
an intrinsic and natural accounting of resources. This is indicated by the
fact that in linear logic, two assumptions of a formula A are distinguished
from a single assumption of A. Informally, on the level of basic intuition, one
might say that classical logic is about truth, that intuitionistic logic is about
construction of proofs, and that linear logic is about...
