Sciweavers

2911 search results - page 57 / 583
» A Theory of Expressiveness in Mechanisms
Sort
View
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 9 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
LATA
2010
Springer
16 years 3 months ago
The Inclusion Problem for Regular Expressions
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
Dag Hovland
ASAP
2005
IEEE
87views Hardware» more  ASAP 2005»
15 years 11 months ago
Expression Synthesis in Process Networks generated by LAURA
The COMPAAN/LAURA [18] tool chain maps nested loop applications written in Matlab onto reconfigurable platforms, such as FPGAs. COMPAAN rewrites the original Matlab application a...
Claudiu Zissulescu, Bart Kienhuis, Ed F. Depretter...
IJAOSE
2007
93views more  IJAOSE 2007»
15 years 6 months ago
A formal semantics for Gaia liveness rules and expressions
The Gaia methodology is a development methodology for multi-agent systems that uses the concept of roles to define behaviour. Gaia uses liveness expressions, which are expression...
Tim Miller, Peter McBurney
TLCA
2007
Springer
16 years 8 days ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek