Sciweavers

75 search results - page 8 / 15
» Abstract Interpretation of Proofs: Classical Propositional C...
Sort
View
90
Voted
JSYML
2011
84views more  JSYML 2011»
14 years 7 months ago
On the non-confluence of cut-elimination
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....
Matthias Baaz, Stefan Hetzl
PODS
1997
ACM
124views Database» more  PODS 1997»
15 years 4 months ago
Languages for Relational Databases 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
CONCUR
2010
Springer
15 years 1 months ago
Theory by Process
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
Yuxi Fu
93
Voted
CSL
2007
Springer
15 years 6 months ago
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
90
Voted
TABLEAUX
2005
Springer
15 years 5 months ago
Comparing Instance Generation Methods for Automated Reasoning
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...
Swen Jacobs, Uwe Waldmann