61.
Episodes, Characterising Sentences and Causes: A Critique of Episodic Logic
- Lenhart K. Schubert's,Chris Fox,Episodic Logic (el
This paper is not intended to undermine this theoretical and applied work. It
aims merely to illustrate some problems with the informal intuitions that purport to
explain and justify the formal theory of EL. In particular, this paper criticises the
view that we should think of events as situations (episodes) which can be completely
characterised by natural language sentences. I argue that: (1) there are no genuine
natural language examples which require it; (2) it results in a loss of expressiveness;
and (3) it leads to problems when giving the logical form of causal statements. I suggest
that the motivating example can be dealt with adequately using...
62.
Chapter 5 Linear Logic Programming
- Linear Logic Programming
s depending on the characteristics of the language. A program in this setting is simply a collection of propositions that, through their form, will lead the proof search engine down a particular path, thereby achieving a particular computation. In order to make this both feasible from the point of view of an implementation and predictable to the programmer, we need to full linear logic. We would like to emphasize that even on this fragment (called LHHF for Linear Hereditary Harrop Formulas), not every speci cation is executable, nor is it intended to be. We hope the development and the examples...
63.
Chapter 5 Linear Logic Programming
- Linear Logic Programming
oofs depending on the characteristics of the language. A program in this setting is simply a collection of propositions that, through their form, will lead the proof search engine down a particular path, thereby achieving a particular computation. In order to make this both feasible from the point of view of an implementation and predictable to the programmer, we need to full linear logic. We would like to emphasize that even on this fragment (called LHHF for Linear Hereditary Harrop Formulas), not every specification is executable, nor is it intended to be. We hope the development and the examples in...
64.
Explicit Substitution into Action
- Non-Monotone Logic For; Marek A. Bednarczyk
A logic LP # for reasoning about change is presented. The logic, an extension of the logic of predicates with equalitu, is based on the idea that explicit substitutions can be seen as atomic formulae describing basic change of the state of a system. The logic is substructural: non-monotone and non-commutative. Its Platonic, i.e., predicate part is governed by the additive connectives, while the identity substitution and the composition of substitutions are multiplicative truth and conjunction, respectively. Potential applications of the logic are also discussed in connection to the "Frame Problem". In particular, a logical framework is presented in which...
65.
Lógica sobre hoja de cálculo (Excel)
- Saiz Noeda, Maximiliano
Ejercicio para practicar los conceptos de lógica (Tema 2: Conceptos Genéricos) sobre una hoja de cálculo (por ejemplo, Excel).
66.
Lógica sobre hoja de cálculo (Excel)
- Saiz Noeda, Maximiliano
Ejercicio para practicar los conceptos de lógica (Tema 2: Conceptos Genéricos) sobre una hoja de cálculo (por ejemplo, Excel).
67.
Logic-Motivated Choice of Fuzzy Logic Operators
- Pratit Santiprabhob Hung; Witold Pedrycz; Vladik Kreinovich
Many different "and"- and "or"-operations have been proposed for use in fuzzy logic; it is therefore important to select, for each particular application, the operations which are the best for this particular application. Several papers discuss the optimal choice of "and"- and "or"-operations for fuzzy control, when the main criterion is to get the stablest control (or the smoothest or the most robust or the fastestto -compute). In reasoning applications, however, it is more appropriate to select operations which are the best in reflecting human reasoning, i.e., operations which are "the most logical". In this paper, we explain how we...
68.
Dynamic Logic Programming
- J. J. Alferes; Dep Matem#tica; J. A. Leite; L. M. Pereira; H. Przymusinska and T. C. Przymusinski; T. C. Przymusinski
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in their bodies but also in their heads.We start by introducing the notion of an update P \Phi U of a logic program P by another logic program U . Subsequently, we provide a precise semantic characterization of P \Phi U , and study some basic properties of program updates. In particular, we show that our update programs generalize the notion of interpretation update. We then extend this notion to...
69.
Dynamic Logic Programming
- J. J. Alferes; J. A. Leite; L. M. Pereira; H. Przymusinska and T. C. Przymusinski; T. C. Przymusinski
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in their bodies but also in their heads. We start by introducing the notion of an update P \Phi U of a logic program P by another logic program U . Subsequently, we provide a precise semantic characterization of P \PhiU , and study some basic properties of program updates. In particular, we show that our update programs generalize the notion of interpretation update. We then extend this notion to...
70.
Classical Combinatory Logic
- Karim Nour
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original combinatory calculus corresponds to minimal implicative logic written in a system “à la Hilbert”. We present in this paper a combinatory logic which corresponds to propositional classical logic. This system is equivalent to the system of Barbanera and Berardi. λ Sym P rop
71.
Ejercicio de lógica. Curso 2009-2010
- Saiz Noeda, Maximiliano
Ejercicio para practicar los conceptos de lógica (Tema 2: Conceptos Genéricos) de la asignatura Técnicas Informáticas de la Diplomatura en Gestión y Administración Pública de la Universidad de Alicante.
72.
Recursive logic frames
- Shelah, Saharon; Väänänen, Jouko
We define the concept of a logic frame, which extends the concept of an
abstract logic by adding the concept of a syntax and an axiom system. In a
recursive logic frame the syntax and the set of axioms are recursively coded. A
recursive logic frame is called recursively (countably) compact, if every
recursive (respectively, countable) finitely consistent theory has a model. We
show that for logic frames built from the cardinality quantifiers ''there
exists at least lambda'' recursive compactness always implies countable
compactness. On the other hand we show that a recursively compact extension
need not be countably compact.
73.
Clocked Temporal Logic Programming
- Chuchang Liu; Mehmet A. Orgun
Clocked temporal logic programming(CTLP) is an extension of logic programming based on a clocked temporal logic(CTL). In CTL, predicates are associated with local clocks. Local clocks can be used to model multiple granularity of time, thus the resulting temporal logic programming language, called Chronolog(MC), has a stronger modeling power. This paper discusses the logical basis of the language and outlines its operational semantics. Also, a parallel execution model for Chronolog(MC) programs is outlined. An application of CTLP to distributed computations is discussed. Keywords Temporal logic, Logic programming, Clocks, Temporal resolution, Parallel execution. 1 Introduction An important activity in computer science...
74.
Kima: an Automated Error Correction System for Concurrent
- Logic Programs Yasuhiro; Yasuhiro Ajiro; Kazunori Ueda
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explicit declarations of program properties.
75.
Logic Frameworks for Logic Programs
- David A. Basin
. We show how logical frameworks can provide a basis for logic
program synthesis. With them, we may use first-order logic as a foundation
to formalize and derive rules that constitute program development calculi.
Derived rules may be in turn applied to synthesize logic programs using
higher-order resolution during proof that programs meet their specifications.
We illustrate this using Paulson's Isabelle system to derive and use a simple
synthesis calculus based on equivalence preserving transformations.
1 Introduction
Background
In 1969 Dana Scott developed his Logic for Computable Functions and with it a
model of functional program computation. Motivated by this model, Robin Milner
developed the theorem prover LCF whose logic PP...
76.
Modular Temporal Logic
- Augustin Baziramwabo; Pierre Mckenzie; Denis Thérien
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...
77.
Signed Interval Logic
- Thomas Marthedal Rasmussen
Signed Interval Logic (SIL) is an extension of Interval Temporal Logic (ITL) with the introduction of the notion of a direction of an interval. We develop syntax, semantics, and proof system of SIL, and show that this proof system is sound and complete. The proof system of SIL is not more complicated than that of ITL but SIL is (contrary to ITL) capable of specifying liveness properties. Other interval logics capable of this (such as Neighbourhood Logic) have more complicated proof systems. We discuss how to de ne future intervals in SIL for the specification of liveness properties. To characterize...
78.
Ordered linear logic programming
- Frank Pfenning; Jeff Polakow; Jeff Polakow
Webeginwithareviewofordered linear logic (OLL) 1, 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 OLL in two steps: (1) we give a system of ordered uniform derivations which is sound and complete with respect to OLL, 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 merge sort, insertion sort, and natural...
79.
Common Knowledge Logic and Game Logic
- Kaneko, Mamoru
We show the faithful embedding of common knowledge logic CKL into game logic GL, that is, CKL is embedded into GL and GL is a conservative extension of the fragment obtained by this embedding. Then many results in GL are available in CKL, and vice versa. For example, an epistemic consideration of Nash equilibrium for a game with pure strategies in GL is carried over to CKL. Another important application is to obtain a Gentzen-style sequent calculus formulation of CKL and its cut-elimination. The faithful embedding theorem is proved for the KD4-type propositional CKL and GL, but it holds for...
80.
Quantum logic: A brief outline
- Karl Svozil
Quantum logic has been introduced by Birkhoff and von Neumann as an attempt to base the logical primitives, the propositions and the relations and operations among them, on quantum theoretical entities, and thus on the related empirical evidence of the quantum world. We give a brief outline of quantum logic, and some of its algebraic properties, such as nondistributivity, whereby emphasis is given to concrete experimental setups related to quantum logical entities. A probability theory based on quantum logic is fundamentally and sometimes even spectacularly different from probabilities based on classical Boolean logic. We give a brief outline of its...
