Sciweavers

JSYML
2006
71views more  JSYML 2006»
13 years 5 months ago
The generalised type-theoretic interpretation of constructive set theory
Abstract. We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-L
Peter Aczel, Nicola Gambino
JSW
2006
82views more  JSW 2006»
13 years 5 months ago
Incremental Implementation of Syntax Driven Logics
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...
Ignatius Sri Wishnu Brata Prasetya, A. Azurat, Tan...
ML
2008
ACM
150views Machine Learning» more  ML 2008»
13 years 5 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
ENTCS
2007
104views more  ENTCS 2007»
13 years 5 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
ENTCS
2007
91views more  ENTCS 2007»
13 years 5 months ago
A Logic for Reasoning about Generic Judgments
This paper presents an extension of a proof system for encoding generic judgments, the logic FOλ∆ of Miller and Tiu, with an induction principle. The logic FOλ∆ is itself an...
Alwen Tiu
ENTCS
2007
116views more  ENTCS 2007»
13 years 5 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen
ENTCS
2007
129views more  ENTCS 2007»
13 years 5 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
JOLLI
2006
123views more  JOLLI 2006»
13 years 5 months ago
Cut and Pay
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
Marcelo Finger, Dov M. Gabbay
ENTCS
2007
109views more  ENTCS 2007»
13 years 5 months ago
Hybrid Logics and Ontology Languages
Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for ...
Ian Horrocks, Birte Glimm, Ulrike Sattler
LOGCOM
2008
97views more  LOGCOM 2008»
13 years 5 months ago
One-and-a-halfth-order Logic
The practice of first-order logic is replete with meta-level concepts. Most notably there are meta-variables ranging over formulae, variables, and terms, and properties of syntax s...
Murdoch James Gabbay, Aad Mathijssen