Sciweavers

344 search results - page 10 / 69
» Some Theorems We Should Prove
Sort
View
FOIS
2001
13 years 8 months ago
A note on proximity spaces and connection based mereology
-- Representation theorems for systems of regions have been of interest for some time, and various contexts have been used for this purpose: Mormann [17] has demonstrated the fruit...
Dimiter Vakarelov, Ivo Düntsch, Brandon Benne...
TAP
2008
Springer
153views Hardware» more  TAP 2008»
13 years 7 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
FOCS
2008
IEEE
13 years 8 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy
IGPL
2008
124views more  IGPL 2008»
13 years 6 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
13 years 11 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider