Sciweavers

2138 search results - page 48 / 428
» Logical Step-Indexed Logical Relations
Sort
View
SIAMCOMP
2000
86views more  SIAMCOMP 2000»
14 years 9 months ago
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
FOSSACS
2005
Springer
15 years 3 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
CSL
2001
Springer
15 years 2 months ago
Decidable Navigation Logics for Object Structures
In this paper, we introduce decidable multimodal logics to describe and reason about navigation across object structures. The starting point of these navigation logics is the model...
Frank S. de Boer, Rogier M. van Eijk
JACM
2000
81views more  JACM 2000»
14 years 9 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 1 months ago
A New Representation Theorem for Many-valued Modal Logics
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
Zoran Majkic