21.
Metric similarities in the logic of approximation.
- Katz, Michael
We describe restricted and extended versions of the logic of approximation which is meant to handle formally the problems of measurement error and of deduction under conditions of uncertainty. We apply the logic to the foundations of social and behavioral inquiry, axiomatizing in it an inexact similarity predicate which behaves like a metric approximation to identity. In the restricted version of the logic we formulate conditions for the imbeddability of similarity models in the real line, and in the extended version we relate arbitrary predicates of our formal language to the predicate of metric similarity.
22.
La lógica como ciencia social y el fenómeno de la modernidad: el caso de Henri Lefebvre
- Villanueva Donoso, Jaime
La Lógica constituye un cuerpo fundamentalmente metodológico, con el cual se opera dentro de los distintos ámbitos del saber, por ello han tenido lugar una serie de propuestas formales emplazadas en los distintos ámbitos de las ciencias, la que aquí nos ocupa es el ensayo de una propuesta lógica para el ámbito de las ciencias sociales, pretensión que alcanza en Henri Lefebvre uno de los desarrollos y soluciones de mayor alcance y rigor, más allá de lo puramente formal. Lefebvre, dota así de nuevas perspectivas a la lógica dialéctica, ampliando su alcance, situándola a través su posición crítica frente al...
23.
Implementing a prioritized logic programming system : thesis
- Wu, Cheng-min; University of Western Sydney, Nepean; School of Computing and Information Technology
Rule based knowledge representation and reasoning often face a problem of conflict with rules. One common way of solving conflicts is to introduce priorities associate with rules. The thesis describes the underlying algorithm to implement prioritized logic programs (PLPs) proposed by Zhang and Foo in 1997. PLPs are proposed as an extension of Gelfond and Lifschitz's extended logic programs by introducing preferences associatied with rules to the program, where answer sets provide a semantics of PLPs. Major algorithms are presented in detail, and how answer sets can be derived from the algorithm demonstrated. Under this implementation, a PLP is computed...
24.
Proceedings - International Symposium on Multiple-Valued Logic.
- International Symposium on Multiple-Valued Logic.
v. :
25.
$rec.titulo
- Bridges Between Classical; Nonmonotonic Logic
The purpose of this paper is to take some of the mystery out of what is known as nonmonotonic logic, by showing that it is not as unfamiliar as may at first sight appear. In fact, it is easily accessible to anybody with a background in classical propositional logic, provided that certain misunderstandings are avoided and a tenacious habit is put aside. In effect, there are logics that act as natural bridges between classical consequence and the principal kinds of nonmonotonic logic to be found in the literature. Like classical logic, they are perfectly monotonic, but they already display some...
26.
LOGIC: Creating Online Case Studies www.logicproject.ca
By Dr Cathy Key and Roger Mundell Organizations Mentioned in this Report: a. CANARIE, Canada's advanced Internet development organization which facilitates the widespread adoption of faster, more efficient networks and by enabling the next generation of advanced products, applications and services to run on them. b. Royal Roads University, which provides online learning to midcareer learners from all over the world. c. TELUS Enterprise Solutions, an e-business and information technology solutions provider. d. The Justice Institute of BC which provides training in the areas of justice and public safety in Canada and in a number of countries around the world....
27.
SILO: Integrating Logic in Objects for Knowledge Representation and Reasoning
- I. Hatzilygeroudis
There have been a large number of systems that integrate logic and objects (frames or classes) for knowledge representation and reasoning. Most of those systems give preeminence to logic and their objects lack the structure of frames. These choices imply a number of disadvantages, as the inability to represent exceptions and perform default reasoning, and the reduction in the naturalness of representation. In this paper, aspects of knowledge representation and reasoning in SILO, a system integrating logic in objects, are presented. SILO gives pre-eminence to objects. A SILO object comprises elements from both frames and classes. A kind of many-sorted...
28.
The Subsumption Problem of the Fuzzy Description Logic ALCF H
- Steffen Hölldobler; Hans-peter Störr
We present the fuzzy description logic ALCF H where primitive concepts are modified by means of hedges taken from hedge algebras. ALCF H is strictly more expressive than Fuzzy-ALC defined in [9]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges. Furthermore, we define a decision procedure for the unsatisfiability problem in ALCF H and for the subsumption problem in a fragment of ALCF H. Key words: fuzzy logic, hedge algebras, description
29.
A LÓGICA COMO METAFÍSICA REABILITADA: SOBRE A ISOMORFIA ENTRE MUNDO E LINGUAGEM NO TRACTATUS DE WITTGENSTEIN
- MARCOS ANTONIO DA SILVA FILHO
A dissertação investiga, a partir do Tractatus de Wittgenstein, a articulação interna do mundo e da linguagem _ a isomorfia _ e elucida aquilo que, sendo idêntico aos dois, a saber, a forma lógica, permite a função de representação exercida pela linguagem. Para tanto, estabeleço, com o auxílio da Teoria de Conjuntos, que a isomorfia tractatiana respeita um mecanismo formal de mapeamento dos estados de coisas pelas proposições elementares numa função biunívoca preservadora de relações entre os nomes e os objetos nomeados. Portanto, demonstro a legitimidade do uso do conceito matemático de isomorfismo na interpretação tradicional do Tractatus. A partir...
30.
Generating Oracles from Your Favorite Temporal Logic Specifications
- L. K. Dillon; Y. S. Ramakrishna
This paper describes a generic tableau algorithm, which is the basis for a general customizable method for producing oracles from temporal logic specifications. A generic argument gives semantic rules with which to build the semantic tableau for a specification. Parameterizing the tableau algorithm by semantic rules permits it to easily accommodate a variety of temporal operators and provides a clean mechanism for fine-tuning the algorithm to produce efficient oracles. The paper develops conditions to ensure that a set of rules results in a correct tableau procedure. It gives sample rules for a variety of linear-time temporal operators and shows how...
31.
A Unified Semantic Web
- Jos De Bruijn; Frame Logic
F-Logic extensions: motivation ◮ Predicates not really appropriate to capture object typing and attributes. ◮ Consider: John is a Lawyer, has the particular name ”John Smith ” and has two children named ”Mary ” and ”Jill”. Furthermore, Lawyer is a particular kind of Human. ◮ Expressed using Logic Programming: lawyer(john). hasName(john, "John Smith"). hasChild(mary). hasChild(jill). hasName(jill, "Jill"). hasName(mary, "Mary"). person(x):- lawyer(x). ◮ This encoding: ◮ Disregards the structure of the natural language sentences ◮ Information about the particular object is no longer grouped
32.
Abstract Generating Oracles from Your Favorite Temporal Logic Specifications*
- L. K. Dillon; Y. S. Ramakrishna
This paper describes a generic tableau algorithm, which is the basis for a general customizable method for producing oracles from temporal logic specifications. A generic argument gives semantic rules with which to build the semantic tableau for a specification. Parameterizing the tableau al-gorithm by semantic rules permits it to easily accommodate a variety of temporal operators and provides a clean mech-anism for fine-tuning the algorithm to produce efficient or-acles. The paper develops conditions to ensure that a set of rules results in a correct tableau procedure. It gives sam-ple rules for a variety of linear-time temporal operators and shows how...
33.
A Simple Deduction System for First-Order Logic with Equality, Free Constructors and Induction
- Jean Goubault-larrecq; Jean Goubault-larrecq; Projet Coq
: Proof systems like Coq feature inductive datatypes, where datatype constructors are free in the sense that two terms built from constructors only are semantically equal if and only if they are syntactically identical. Although free constructors are an essential ingredient of modern formalized mathematics, no automated first-order prover has been specialized with built-in rules for dealing with free constructors, until now. We propose a sequent system for a logic where terms can be built only from variables and free constructors. Thus the logic will be kept simple, as equality in the logic will be syntactical equality. We show how...
34.
Logic Programming in Affine Logic
- Fran Soddell
Traditional logic programming languages, such as Prolog, apply the methods of classical logic to programming tasks. Recently, computer scientists introduced new logic programming languages, based on linear logic rather than classical logic. While classical logic models information that does not change, linear logic models changes of state, and accounts for finite resources, such as money or computer memory, simply and directly. It has been applied to concurrency, natural language processing, updating information in databases, and other resource-sensitive problems. Affine logic is related to linear logic and has a similar range of applications but with a different emphasis. In a linear...
35.
Theory and Practice of Logic Programming 1 N3Logic: A Logical Framework For the World Wide Web
- Tim Berners-lee; Dan Connolly; Lalana Kagal; Yosi Scharf; Jim Hendler
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the Semantic Web provides a unifying representation of richly structured data. Adding logic to the Web implies the use of rules to make inferences, choose courses of action, and answer questions. This logic must be powerful enough to describe complex properties of objects but not so powerful that agents can be tricked by being asked to consider a paradox. The Web has several characteristics that can lead to problems when existing logics are used, in...
36.
Logic Programming in Affine Logic
Traditional logic programming languages, such as Prolog, apply the methods of classical
logic to programming tasks. Recently, computer scientists introduced new logic programming
languages, based on linear logic rather than classical logic. While classical logic models information
that does not change, linear logic models changes of state, and accounts for finite resources, such
as money or computer memory, simply and directly. It has been applied to concurrency, natural
language processing, updating information in databases, and other resource-sensitive problems.
Affine logic is related to linear logic and has a similar range of applications but with a different
emphasis. In a linear logic system, axioms mean that a particular...
37.
¿Hay una lógica de las normas?
- Wright, Georg Henrik von
Traducción de Daniel González Lagier. Título original “Is there a Logic of Norms?”, en Six
Essays in Philosophical Logic, Acta Philosophica Fennica, vol. 60, 1996, págs. 35-53.
38.
F-logic Semantics and Implementation of Internet Metadata
- Technische Universitaet Dresden,Computational Logic
this document as a customer
order and can then locate all properties in an accurate way, since in the document
they are showed with tags explicitly.
39.
Optics of Thought: Logic and Vision in Müller,
Helmholtz, and Frege
- McCarty, D. C.
The historical antecedents of Frege's treatment of binocular vision in
"The thought" were the physiological writings of Johannes Mueller, Hermann
von Helmholtz, and Emil du Bois-Reymond. In their research on human vision,
logic was assigned an unexpected role: it was to be the means by which
knowledge of a world extended in three dimensions arises from stimuli that
are at best two-dimensional. An examination of this literature yields a
richer understanding of Frege's insistence that a proper epistemology
requires us to recognize the existence and importance of nonsensible
sources of knowledge.
40.
Calendar logic
- Hans Jürgen Ohlbach; Dov Gabbay
ABSTRACT. A propositional temporal logic is introduced whose operators quantify over intervals of a reference time line. The intervals are specified symbolically, for example ‘next week’s weekend’. The specification language for the intervals takes into account all the features of real calendar systems. A simple statement which can be expressed in this language is for example: ‘yesterday I worked for eight hours with one hour lunch break at noon’. Calendar Logic can be translated into propositional logic. Satisfiability is therefore decidable. Since the translation is exponential, a tableau decision procedure for checking decidability is presented as an alternative.
