Sciweavers

611 search results - page 27 / 123
» Yuri, Logic, and Computer Science
Sort
View
CSR
2010
Springer
15 years 2 months ago
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
James Gate, Iain A. Stewart
IFIPTCS
2010
14 years 7 months ago
A Logic on Subobjects and Recognizability
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
Harrie Jan Sander Bruggink, Barbara König
CSR
2008
Springer
14 years 11 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Ugo Dal Lago, Martin Hofmann
ICALP
2007
Springer
15 years 3 months ago
Co-Logic Programming: Extending Logic Programming with Coinduction
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta
LICS
2009
IEEE
15 years 4 months ago
Logical Step-Indexed Logical Relations
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
Derek Dreyer, Amal Ahmed, Lars Birkedal