101.
Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary
Affine Logic
- Coppola, Paolo; Martini, Simone
We present a type inference algorithm for lambda-terms in Elementary Affine
Logic using linear constraints.
102.
Stable models and an alternative logic programming paradigm
- Marek, Victor W.; Truszczynski, Miroslaw
In this paper we reexamine the place and role of stable model semantics in
logic programming and contrast it with a least Herbrand model approach to Horn
programs.
103.
The Complexity of Temporal Logic over the Reals
- Reynolds, M.
It is shown that the decision problem for the temporal logic with until and
since connectives over real-numbers time is PSPACE-complete.
104.
Introduction to linear logic and ludics, part I
- Curien, Pierre-Louis
This two-parts paper offers a survey of linear logic and ludics, which were
introduced by Girard in 1986 and 2001, respectively.
105.
The succinctness of first-order logic on linear orders
- Grohe, Martin; Schweikardt, Nicole
Succinctness is a natural measure for comparing the strength of different
logics.
106.
Well-Typed Logic Programs Are not Wrong
- Deransart, Pierre; Smaus, Jan-Georg
This proof-theoretic view
leads us to questioning a condition which is usually considered necessary for
subject reduction, namely the head condition.
107.
A three-valued semantics for logic programmers
- Naish, Lee
The study of semantics of logic programs has shown
strong links between the model theoretic semantics (truth and falsity of atoms
in the programmer's interpretation of a program), procedural semantics (for
example, SLD resolution) and fixpoint semantics (which is useful for program
analysis and alternative execution mechanisms).
108.
Calculating modules in contextual logic program refinement
- Colvin, Robert; Hayes, Ian J.; Strooper, Paul
The refinement calculus for logic programs is a framework for deriving logic
programs from specifications.
109.
Interval Neutrosophic Sets and Logic: Theory and Applications in
Computing
- Wang, Haibin; Smarandache, Florentin; Zhang, Yan-Qing; Sunderraman, Rajshekhar
This book presents the advancements and applications of neutrosophics.
110.
A Logic of Reachable Patterns in Linked Data-Structures
- Yorsh, Greta; Rabinovich, Alexander; Sagiv, Mooly; Meyer, Antoine; Bouajjani, Ahmed
We define a new decidable logic for expressing and checking invariants of
programs that manipulate dynamically-allocated objects via pointers and
destructive pointer updates.
111.
Proof Search in Hajek's Basic Logic
- Bova, S.; Montagna, F.
We introduce a proof system for Hajek's logic BL based on a relational
hypersequents framework.
112.
Logic Column 16: Higher-Order Abstract Syntax: Setting the Record
Straight
- Crary, Karl; Harper, Robert
This article responds to a critique of higher-order abstract syntax appearing
in Logic Column 14, ``Nominal Logic and Abstract Syntax'', cs.LO/0511025.
113.
Extremal problems in logic programming and stable model computation
- Cholewinski, Pawel; Truszczynski, Miroslaw
We study the following problem: given a class of logic programs C, determine
the maximum number of stable models of a program from C.
114.
Logic Column 13: Reasoning Formally about Quantum Systems: An Overview
- Papanikolaou, Nick
This article is intended as an introduction to the subject of quantum logic,
and as a brief survey of the relevant literature.
115.
A Cut-free Sequent Calculus for Bi-Intuitionistic Logic: Extended
Version
- Buisman, Linda; Goré, Rajeev
Bi-intuitionistic logic was introduced by
Rauszer as a Hilbert calculus with algebraic and Kripke semantics.
116.
De los reguladores convencionales a los reguladores basados en lógica difusa
- Ferreiro García, Ramón; Pardo Martínez, Xoán C.; Vidal Paz, José
En este trabajo se revisan los conceptos de control industrial referido a tareas de control típicamente afrontadas por medio de reguladores PID convencionales y que son susceptibles de ser resueltas mediante reguladores basados en reglas.
117.
P-time Completeness of Light Linear Logic and its Nondeterministic
Extension
- Matsuoka, Satoshi
In CSL'99 Roversi pointed out that the Turing machine encoding of Girard's
seminal paper "Light Linear Logic" has a flaw.
118.
Deciding regular grammar logics with converse through first-order logic
- Demri, Stephane; de Nivelle, Hans
We provide a simple translation of the satisfiability problem for regular
grammar logics with converse into GF2, which is the intersection of the guarded
fragment and the 2-variable fragment of first-order logic.
119.
A Generalization of the Lifting Lemma for Logic Programming
- Payet, Etienne; Mesnard, Fred
In this
paper, we first generalize a version of the lifting lemma, by extending the
relation "is more general than" so that it takes into account only some
arguments of the atoms.
120.
Using First-Order Logic to Reason about Policies
- Halpern, Joseph Y.; Weissman, Vicky
We show that a fragment of (multi-sorted) first-order logic can be
used to represent and reason about policies.
