Sciweavers

1055 search results - page 73 / 211
» Enumerations in computable structure theory
Sort
View
ICFCA
2005
Springer
15 years 3 months ago
On Computing the Minimal Generator Family for Concept Lattices and Icebergs
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
Kamal Nehmé, Petko Valtchev, Mohamed Rouane...
ICFP
2000
ACM
15 years 2 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
MKM
2007
Springer
15 years 3 months ago
Context Aware Calculation and Deduction
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
Amine Chaieb, Makarius Wenzel
AMAI
2002
Springer
14 years 9 months ago
Probabilistic Argumentation Systems and Abduction
Probabilistic argumentation systems are based on assumption-based reasoning for obtaining arguments supporting hypotheses and on probability theory to compute probabilities of sup...
Jürg Kohlas, Dritan Berzati, Rolf Haenni
JSYML
2008
95views more  JSYML 2008»
14 years 9 months ago
Examples of non-locality
free but not Whitehead Abelian groups to construct Abstract Elementary Classes (AEC) which satisfy the amalgamation property but fail various conditions on the locality of Galois-...
John T. Baldwin, Saharon Shelah