Sciweavers

971 search results - page 107 / 195
» Approximate Satisfiability and Equivalence
Sort
View
CSL
2006
Springer
15 years 4 months ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
FM
2006
Springer
161views Formal Methods» more  FM 2006»
15 years 4 months ago
Changing Programs Correctly: Refactoring with Specifications
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
Fabian Bannwart, Peter Müller
84
Voted
AAAI
2008
15 years 3 months ago
Horn Complements: Towards Horn-to-Horn Belief Revision
Horn-to-Horn belief revision asks for the revision of a Horn knowledge base such that the revised knowledge base is also Horn. Horn knowledge bases are important whenever one is c...
Marina Langlois, Robert H. Sloan, Balázs Sz...
BIRTHDAY
2008
Springer
15 years 2 months ago
The Church-Turing Thesis over Arbitrary Domains
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
Udi Boker, Nachum Dershowitz
104
Voted
CIE
2008
Springer
15 years 2 months ago
Effective Dimensions and Relative Frequencies
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...
Xiaoyang Gu, Jack H. Lutz