Sciweavers

306 search results - page 32 / 62
» Constructive algebraic integration theory
Sort
View
POPL
2006
ACM
16 years 3 days ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
14 years 9 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
ICLP
2011
Springer
14 years 3 months ago
Transaction Logic with Defaults and Argumentation Theories
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
Paul Fodor, Michael Kifer
AIEDU
2005
185views more  AIEDU 2005»
14 years 11 months ago
A Bayesian Student Model without Hidden Nodes and its Comparison with Item Response Theory
The Bayesian framework offers a number of techniques for inferring an individual's knowledge state from evidence of mastery of concepts or skills. A typical application where ...
Michel C. Desmarais, Xiaoming Pu
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 3 days ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen