927,328 research outputs found
Focusing and Polarization in Intuitionistic Logic
A focused proof system provides a normal form to cut-free proofs that
structures the application of invertible and non-invertible inference rules.
The focused proof system of Andreoli for linear logic has been applied to both
the proof search and the proof normalization approaches to computation. Various
proof systems in literature exhibit characteristics of focusing to one degree
or another. We present a new, focused proof system for intuitionistic logic,
called LJF, and show how other proof systems can be mapped into the new system
by inserting logical connectives that prematurely stop focusing. We also use
LJF to design a focused proof system for classical logic. Our approach to the
design and analysis of these systems is based on the completeness of focusing
in linear logic and on the notion of polarity that appears in Girard's LC and
LU proof systems
An algebraic generalization of Kripke structures
The Kripke semantics of classical propositional normal modal logic is made
algebraic via an embedding of Kripke structures into the larger class of
pointed stably supported quantales. This algebraic semantics subsumes the
traditional algebraic semantics based on lattices with unary operators, and it
suggests natural interpretations of modal logic, of possible interest in the
applications, in structures that arise in geometry and analysis, such as
foliated manifolds and operator algebras, via topological groupoids and inverse
semigroups. We study completeness properties of the quantale based semantics
for the systems K, T, K4, S4, and S5, in particular obtaining an axiomatization
for S5 which does not use negation or the modal necessity operator. As
additional examples we describe intuitionistic propositional modal logic, the
logic of programs PDL, and the ramified temporal logic CTL.Comment: 39 page
Recommended from our members
Expressive Policy Analysis with Enhanced System Dynamicity
Despite several research studies, the effective analysis of policy based systems remains a significant challenge. Policy analysis should at least (i) be expressive (ii) take account of obligations and authorizations, (iii) include a dynamic system model, and (iv) give useful diagnostic information. We present a logic-based policy analysis framework which satisfies these requirements, showing how many significant policy-related properties can be analysed, and we give details of a prototype implementation. Copyright 2009 ACM
Experiments with a Convex Polyhedral Analysis Tool for Logic Programs
Convex polyhedral abstractions of logic programs have been found very useful
in deriving numeric relationships between program arguments in order to prove
program properties and in other areas such as termination and complexity
analysis. We present a tool for constructing polyhedral analyses of
(constraint) logic programs. The aim of the tool is to make available, with a
convenient interface, state-of-the-art techniques for polyhedral analysis such
as delayed widening, narrowing, "widening up-to", and enhanced automatic
selection of widening points. The tool is accessible on the web, permits user
programs to be uploaded and analysed, and is integrated with related program
transformations such as size abstractions and query-answer transformation. We
then report some experiments using the tool, showing how it can be conveniently
used to analyse transition systems arising from models of embedded systems, and
an emulator for a PIC microcontroller which is used for example in wearable
computing systems. We discuss issues including scalability, tradeoffs of
precision and computation time, and other program transformations that can
enhance the results of analysis.Comment: Paper presented at the 17th Workshop on Logic-based Methods in
Programming Environments (WLPE2007
Formal Analysis of Linear Control Systems using Theorem Proving
Control systems are an integral part of almost every engineering and physical
system and thus their accurate analysis is of utmost importance. Traditionally,
control systems are analyzed using paper-and-pencil proof and computer
simulation methods, however, both of these methods cannot provide accurate
analysis due to their inherent limitations. Model checking has been widely used
to analyze control systems but the continuous nature of their environment and
physical components cannot be truly captured by a state-transition system in
this technique. To overcome these limitations, we propose to use
higher-order-logic theorem proving for analyzing linear control systems based
on a formalized theory of the Laplace transform method. For this purpose, we
have formalized the foundations of linear control system analysis in
higher-order logic so that a linear control system can be readily modeled and
analyzed. The paper presents a new formalization of the Laplace transform and
the formal verification of its properties that are frequently used in the
transfer function based analysis to judge the frequency response, gain margin
and phase margin, and stability of a linear control system. We also formalize
the active realizations of various controllers, like
Proportional-Integral-Derivative (PID), Proportional-Integral (PI),
Proportional-Derivative (PD), and various active and passive compensators, like
lead, lag and lag-lead. For illustration, we present a formal analysis of an
unmanned free-swimming submersible vehicle using the HOL Light theorem prover.Comment: International Conference on Formal Engineering Method
- ā¦