Sciweavers

4352 search results - page 179 / 871
» A Representation Theorem and Applications
Sort
View
AAAI
1992
15 years 8 months ago
Lexical Imprecision in Fuzzy Constraint Networks
We define fuzzy constraint networks and prove a theorem about their relationship to fuzzy logic. Then we introduce Khayyam, a fuzzy constraint-based programming language in which ...
James Bowen, K. Robert Lai, Dennis Bahler
218
Voted
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 7 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
ENTCS
2008
81views more  ENTCS 2008»
15 years 7 months ago
Presenting Dcpos and Dcpo Algebras
Dcpos can be presented by a preorder of generators and inequational relations expressed as covers. Algebraic operations on the generators (possibly with their results being ideals...
Achim Jung, M. Andrew Moshier, Steven J. Vickers
172
Voted
ENTCS
2008
104views more  ENTCS 2008»
15 years 7 months ago
A Logic for Virtual Memory
We present an extension to classical separation logic which allows reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover in a manner allowing ...
Rafal Kolanski
ENTCS
2008
79views more  ENTCS 2008»
15 years 7 months ago
The Compositional Method and Regular Reachability
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
Ingo Felscher