Sciweavers

1943 search results - page 111 / 389
» Ordering Default Theories
Sort
View
ICFP
2005
ACM
15 years 12 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
CADE
2011
Springer
13 years 12 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
HYBRID
1997
Springer
15 years 4 months ago
Hybrid Systems with Finite Bisimulations
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
Gerardo Lafferriere, George J. Pappas, Shankar Sas...
AMAI
2006
Springer
14 years 12 months ago
Functional and multivalued dependencies in nested databases generated by record and list constructor
tor. In order to capture different data models at a time, an abstract algebraic approach based on nested attributes is taken. The presence of the list constructor calls for a new i...
Sven Hartmann, Sebastian Link, Klaus-Dieter Schewe
IJAC
2008
158views more  IJAC 2008»
14 years 12 months ago
The Braid rook Monoid
species and combinatorial Hopf algebras on the one hand, and quantum groups and the classification theory of abstract Hopf algebras on the other. This is part of joint work with Sw...
Eddy Godelle