541.
USE OF FUZZY LOGIC IN META-EVALUATION: AN ALTERNATIVE APPROACH
- ANA CAROLINA LETICHEVSKY
Assuring the quality of an evaluation is a great challenge to evaluators.The evaluation of an evaluative process is called meta-evaluation. In Brazil thereis a great concern about evaluation quality, although the concept of metaevaluationis new. Evaluation professionals are still discussing the criteria ofexcellence that a true evaluation should attend. The standards defined by the JointCommittee on Standards for Educational Evaluation (1994) that are presented interms of utility, feasibility, ethics and accuracy, enlighten on that discussion. Thisstudy presents a new methodology for meta-evaluation that makes use of fuzzysets and fuzzy logic concepts. The methodology is composed of an instrument fordata collection...
542.
Predicate Logic Unplugged
- Johan Bos
this paper we describe the syntax and semantics of a description language for
underspecified semantic representations. This concept is discussed in general and in
particular applied to Predicate Logic and Discourse Representation Theory.
The reason for exploring underspecified representations as suitable semantic
representations for natural language expressions emerges directly from practical
natural language processing applications. The so-called Combinatorial Explosion
Puzzle, a well known problem in this area, can succesfully be tackled by using
underspecified representations. The source of this problem, scopal ambiguities in
natural language expressions, is discussed in section 2.
The core of the paper presents Hole Semantics. This is a general proposal for a
framework, in principle suitable...
543.
Games Logic Plays
- Ahti Pietarinen
We argue that game theory deserves a more prominent status in
the foundations of logic.
Logic, old-fashionedly summoned as a method of correct reasoning, is also a
way of describing things. Scientific methods in other disciplines often have
similar methodology: they show how to capture and symbolise things given
a limited framework of the theory, and spell out how to do this in a sound
and adequate manner.
But can logic be more that mere description? Can it be a useful method of
explanation, that is, is there a way of arguing that logic, in some sense, also
tells us why basic laws of logics are what they are...
544.
Signed Logic Programs
- Hudson Turner
In this paper we explore the notion of a "signing" of a logic program, in the framework of the answer set (or stable model) semantics [Gelfond and Lifschitz, 1991]. In particular, we generalize and extend the notion of a signing, and show that even for programs with classical negation and disjunction the existence of a signing is a simple syntactic criterion that guarantees several different sorts of good behavior.
545.
A Plural Resolution Logic
- Rick Nouwen
This paper presents an integration of centering theory ([GJW95]) into
incremental dynamic logic. The formalism is based on an idea found in
[vE00a], where contexts are permutable in order to model salience. Building
on this idea, centering theory is restated as a formalism on contexts.
546.
A Plural Resolution Logic
- Rick Nouwen
This paper presents an integration of centering theory ([GJW95]) into
incremental dynamic logic. The formalism is based on an idea found in
[vE00a], where contexts are permutable in order to model salience. Building
on this idea, centering theory is restated as a formalism on contexts.
547.
Incompleteness of a First-order Gödel Logic and some Temporal Logics of Programs
- Matthias Baaz; Alexander Leitsch; Richard Zach
It is shown that the in nite-valued rst-order Godel logic based on the set of truth values f1=k : k 2 ! n f0gg [ f0g is not r.e.
548.
The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems
- Inês de Castro Dutra; In^es De Castro Dutra; Vítor Santos Costa; Ricardo Bianchini
. In this paper we use execution-driven simulation of a scalable multiprocessor to evaluate the performance of the Andorra-I parallel logic programming system under invalidate and update-based protocols. We use two versions of Andorra-I. One of them was originally designed for bus-based multiprocessors, while the other is optimised for scalable architectures. We study a well-known invalidate protocol and two dierent update-based protocols. Our results show that for our sample logic programs the update-based protocols outperform their invalidate-based counterpart for the original version of Andorra-I. In contrast, the optimised version of Andorra-I benets the most from the invalidate-based protocol, but a...
549.
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...
550.
An elementary treatise of logic;
- Wilson, William Dexter, 1816-1900.
xix, 425 p. 20 cm.
551.
An introduction to modern logic.
- Lodge, Rupert Clendon, 1886-
1 p.l., v-xiv, 361 p.
552.
Symbolic logic, by John Venn ...
- Venn, John, 1834-1923.
xxxix, [1], 446 p.
553.
Nuevas direcciones de la lógica. Por Alberto Gómez Izquierdo ...
- Gómez Izquierdo, Alberto, 1870-
273, [4] p., 1 l.
554.
Nociones de lógica, por W. Stanley Jevons ...
- Jevons, William Stanley, 1835-1882.
180 p.
555.
Questions and answers -- a category arising in linear logic, complexity
theory, and set theory
- Blass, Andreas
A category used by de Paiva to model linear logic also occurs in Vojtas's
analysis of cardinal characteristics of the continuum. Its morphisms have been
used in describing reductions between search problems in complexity theory. We
describe this category and how it arises in these various contexts. We also
show how these contexts suggest certain new multiplicative connectives for
linear logic. Perhaps the most interesting of these is a sequential composition
suggested by the set-theoretic application.
556.
Finite Information Logic
- Rohit Parikh,Jouko Vnnen
we introduce a generalization of Independence Friendly (IF)
logic in which Eloise is restricted to a nite amount of information about
Abelard's moves. This Logic is shown to be equivalent to a sublogic
rst order logic, has the nite model property, and is decidable. Moreover,
it gives an exponential compression relative to
logic.
557.
Parallelism In Logic Programming
- Kazunori Ueda
This paper discusses two aspects of parallelism in logic programming: parallelism as a formalism (often referred to as concurrency) and the implications of parallelism with regard to performance. Two alternatives for a parallel logic programming system are considered in detail. One allows programmers to describe processes and communications using concurrent logic languages, and the other attempts to exploit the parallelism of ordinary logic programs.
558.
A Taste of Linear Logic
- Philip Wadler
This tutorial paper provides an introduction to intuitionistic
logic and linear logic, and shows how they correspond to type systems
for functional languages via the notion of `Propositions as Types'. The
presentation of linear logic is simplified by basing it on the Logic of Unity.
559.
Probabilistic Interval Temporal Logic
- Dimitar P. Guelev
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...
560.
Semantics of a Functional-Logic Language
In this thesis, we discuss semantics of a functional-logic language in view of equational
logic.
We regard a functional-logic program as non-logical axioms of equational logic, where the
functional-logic program is interpreted as defining a function. We also regard a query as an
existentially quantified equation and solving the query as proving the existentially quantified
equation by obtaining a witness. We will justify this understanding by a rigorously model
theoretic approach.
By using Herbrand's theorem for equational logic proved by Goguen and Meseguer, we
find that the quotient term model, which is standard (or initial) model of equational logic,
adequately expresses a meaning of query. Moreover by Hullot's completeness...
